back to table · edit · history · where entries came from · files · download
2477 bytes, as of the version from 2026-10-29 12:06 (current). Recorded here, not run.
# Sources inspected for T608
I. Sato, **The Ihara Zeta function and Quantum Walk**, RIMS Kokyuroku 2120
(2019), 199–219:
https://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/2120-10.pdf
The graph-theoretic definition on p. 202 retains orientation. The triangle
example on p. 203 gives `(1-u^3)^2` and rooted walk counts 6 at lengths 3, 6,
and 9. Theorem 3 on p. 204 gives both determinant formulas. The same page's
diamond example gives
`(1-u^2)*(1-u)*(1+u^2)*(1+u+2*u^2)*(1-u^2-2*u^3)`.
All these conventions and controls were read from the downloaded paper. Our
matrix B corresponds to the paper's B-J_0. The paper's intermediate displayed
diamond determinant drops the prefactor in its typesetting; the theorem and
final factorization include it, and the independent edge determinant agrees
with the final factorization. The generator retains the full prefactor.
T. Hasegawa and S. Saito, **On a prime zeta function of a graph**, Pacific
Journal of Mathematics 273 (2015), 123–146, DOI 10.2140/pjm.2015.273.123:
https://msp.org/pjm/2015/273-1/pjm-v273-n1-p06-p.pdf
Definitions on pp. 125–126 specify primitive, backtrack-free, tailless closed
walks modulo cyclic rotation and the Bass formula with Q=D-I. Facts 1(4),
p. 128, gives the leading coefficient. Their analytic results exclude cycle
graphs; the table does not import that exclusion. Cycles are covered directly
by the definition, as illustrated separately by Sato's triangle example.
Brendan McKay, **Description of graph6, sparse6 and digraph6 encodings**:
https://users.cecs.anu.edu.au/~bdm/data/formats.txt
This defines the graph6 alphabet and upper-triangular adjacency encoding.
Canonicalization is an additional choice, fixed here to Sage's `sage`
algorithm to match the actual identifiers read from T237 and T238.
NetworkX, **graph_atlas_g**:
https://networkx.org/documentation/stable/reference/generated/networkx.generators.atlas.graph_atlas_g.html
Documents the independent list of 1,253 graphs on at most seven vertices,
from Read and Wilson's *An Atlas of Graphs* (1998). The build filters this list
by connectedness, order and minimum degree, independently of nauty's generator.
The run retains the downloaded PDFs and graph6 specification, extracted Sato
text, source hashes, full offline checks and stored-value checks. The archived
skill manifest is `agents/runs/20261029T113821Z-build-skills/manifest.json`;
both skill SHA-256 values are recorded in `skill-evidence.json`.