{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G7WWPEKZSD7RJFHSMWQ2FUM2T3","short_pith_number":"pith:G7WWPEKZ","schema_version":"1.0","canonical_sha256":"37ed67915990ff1494f265a1a2d19a9ece416086134b9cfb377e522f652a1e56","source":{"kind":"arxiv","id":"1412.0150","version":5},"attestation_state":"computed","paper":{"title":"Locality of connective constants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"math.CO","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","submitted_at":"2014-11-29T20:12:56Z","abstract_excerpt":"The connective constant $\\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective constants of two graphs are close in value whenever the graphs agree on a large ball around the origin (and a further condition is satisfied). The proof exploits a generalized bridge decomposition of self-avoiding walks, which is valid subject to the assumption that the underlying graph is quasi-transitive and possesses a so-called unimodular graph height functi"},"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":"1412.0150","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-29T20:12:56Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"9a102dbae981941da365c9a5ee44a17a7cb9ed1dff441a4783330e77957d1a03","abstract_canon_sha256":"3a170a11f6f2c7a209f4d7e5c73fb2bd1ac1f44541a9e6be5644b12bd770fd63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:51.370905Z","signature_b64":"wvBqYHD0iEfUFF/31AWq3J4uxO5uPQyIqe8h9tD+qYPcONq2/sUa9W4W6Fm9ly2X1GdIWxt804yqjL/HpMrpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37ed67915990ff1494f265a1a2d19a9ece416086134b9cfb377e522f652a1e56","last_reissued_at":"2026-05-18T00:07:51.370077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:51.370077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality of connective constants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"math.CO","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","submitted_at":"2014-11-29T20:12:56Z","abstract_excerpt":"The connective constant $\\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective constants of two graphs are close in value whenever the graphs agree on a large ball around the origin (and a further condition is satisfied). The proof exploits a generalized bridge decomposition of self-avoiding walks, which is valid subject to the assumption that the underlying graph is quasi-transitive and possesses a so-called unimodular graph height functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0150","kind":"arxiv","version":5},"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":"1412.0150","created_at":"2026-05-18T00:07:51.370219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0150v5","created_at":"2026-05-18T00:07:51.370219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0150","created_at":"2026-05-18T00:07:51.370219+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7WWPEKZSD7R","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7WWPEKZSD7RJFHS","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7WWPEKZ","created_at":"2026-05-18T12:28:28.263976+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/G7WWPEKZSD7RJFHSMWQ2FUM2T3","json":"https://pith.science/pith/G7WWPEKZSD7RJFHSMWQ2FUM2T3.json","graph_json":"https://pith.science/api/pith-number/G7WWPEKZSD7RJFHSMWQ2FUM2T3/graph.json","events_json":"https://pith.science/api/pith-number/G7WWPEKZSD7RJFHSMWQ2FUM2T3/events.json","paper":"https://pith.science/paper/G7WWPEKZ"},"agent_actions":{"view_html":"https://pith.science/pith/G7WWPEKZSD7RJFHSMWQ2FUM2T3","download_json":"https://pith.science/pith/G7WWPEKZSD7RJFHSMWQ2FUM2T3.json","view_paper":"https://pith.science/paper/G7WWPEKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0150&json=true","fetch_graph":"https://pith.science/api/pith-number/G7WWPEKZSD7RJFHSMWQ2FUM2T3/graph.json","fetch_events":"https://pith.science/api/pith-number/G7WWPEKZSD7RJFHSMWQ2FUM2T3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7WWPEKZSD7RJFHSMWQ2FUM2T3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7WWPEKZSD7RJFHSMWQ2FUM2T3/action/storage_attestation","attest_author":"https://pith.science/pith/G7WWPEKZSD7RJFHSMWQ2FUM2T3/action/author_attestation","sign_citation":"https://pith.science/pith/G7WWPEKZSD7RJFHSMWQ2FUM2T3/action/citation_signature","submit_replication":"https://pith.science/pith/G7WWPEKZSD7RJFHSMWQ2FUM2T3/action/replication_record"}},"created_at":"2026-05-18T00:07:51.370219+00:00","updated_at":"2026-05-18T00:07:51.370219+00:00"}