{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MQZGM4CBZNY2RDFCUPR3YG4POP","short_pith_number":"pith:MQZGM4CB","schema_version":"1.0","canonical_sha256":"6432667041cb71a88ca2a3e3bc1b8f73da8a7df6091fc24f9d84bfce76901884","source":{"kind":"arxiv","id":"1602.02797","version":1},"attestation_state":"computed","paper":{"title":"Spanning Trees and Mahler Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Daniel S. Silver, Susan G. Williams","submitted_at":"2016-02-08T21:39:20Z","abstract_excerpt":"The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\\mathbb Z}^d$-symmetry, then the logarithmic Mahler measure $m(\\Delta)$ of its Laplacian polynomial $\\Delta$ is the exponential growth rate of the complexity of finite quotients of $G$. It is bounded below by $m(\\Delta({\\mathbb G}_d))$, where ${\\mathbb G}_d$ is the grid graph of dimension $d$. The growth rates $m(\\Delta({\\mathbb G}_d))$ are asymptotic to $\\log 2d$ as $d$ tends to inf"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.02797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T21:39:20Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"b3cf2e121f3259b4acbe8eb1b674d0c28b69cb35c3bb071bb58c336d8ace4a32","abstract_canon_sha256":"413853e1abb16bb6b7c093ee706341da7202d066f92f2fa2d9950e013e961d70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:08.127616Z","signature_b64":"/B23JbM/YOb84y5W4OHv7ovwXfJi4j8h/hZQDYlTzcUfuycy1j0+nqf06Zp3SiBMVV8bRhhk5Ui1pQFVHh5PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6432667041cb71a88ca2a3e3bc1b8f73da8a7df6091fc24f9d84bfce76901884","last_reissued_at":"2026-05-18T01:21:08.126966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:08.126966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning Trees and Mahler Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Daniel S. Silver, Susan G. Williams","submitted_at":"2016-02-08T21:39:20Z","abstract_excerpt":"The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\\mathbb Z}^d$-symmetry, then the logarithmic Mahler measure $m(\\Delta)$ of its Laplacian polynomial $\\Delta$ is the exponential growth rate of the complexity of finite quotients of $G$. It is bounded below by $m(\\Delta({\\mathbb G}_d))$, where ${\\mathbb G}_d$ is the grid graph of dimension $d$. The growth rates $m(\\Delta({\\mathbb G}_d))$ are asymptotic to $\\log 2d$ as $d$ tends to inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02797","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02797","created_at":"2026-05-18T01:21:08.127058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02797v1","created_at":"2026-05-18T01:21:08.127058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02797","created_at":"2026-05-18T01:21:08.127058+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQZGM4CBZNY2","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQZGM4CBZNY2RDFC","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQZGM4CB","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP","json":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP.json","graph_json":"https://pith.science/api/pith-number/MQZGM4CBZNY2RDFCUPR3YG4POP/graph.json","events_json":"https://pith.science/api/pith-number/MQZGM4CBZNY2RDFCUPR3YG4POP/events.json","paper":"https://pith.science/paper/MQZGM4CB"},"agent_actions":{"view_html":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP","download_json":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP.json","view_paper":"https://pith.science/paper/MQZGM4CB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02797&json=true","fetch_graph":"https://pith.science/api/pith-number/MQZGM4CBZNY2RDFCUPR3YG4POP/graph.json","fetch_events":"https://pith.science/api/pith-number/MQZGM4CBZNY2RDFCUPR3YG4POP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/action/storage_attestation","attest_author":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/action/author_attestation","sign_citation":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/action/citation_signature","submit_replication":"https://pith.science/pith/MQZGM4CBZNY2RDFCUPR3YG4POP/action/replication_record"}},"created_at":"2026-05-18T01:21:08.127058+00:00","updated_at":"2026-05-18T01:21:08.127058+00:00"}