{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G7WWPEKZSD7RJFHSMWQ2FUM2T3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3a170a11f6f2c7a209f4d7e5c73fb2bd1ac1f44541a9e6be5644b12bd770fd63","cross_cats_sorted":["math-ph","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-29T20:12:56Z","title_canon_sha256":"9a102dbae981941da365c9a5ee44a17a7cb9ed1dff441a4783330e77957d1a03"},"schema_version":"1.0","source":{"id":"1412.0150","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0150","created_at":"2026-05-18T00:07:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0150v5","created_at":"2026-05-18T00:07:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0150","created_at":"2026-05-18T00:07:51Z"},{"alias_kind":"pith_short_12","alias_value":"G7WWPEKZSD7R","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G7WWPEKZSD7RJFHS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G7WWPEKZ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:7563121ec20c81e6f307bff92607b06dab1544dc09f4f7a94e7011c9f0aac923","target":"graph","created_at":"2026-05-18T00:07:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","cross_cats":["math-ph","math.MP","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-29T20:12:56Z","title":"Locality of connective constants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0150","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e1230a93bcb12e02e9a84564be300aadbaccd9dac8446b1178726b2729d3c81f","target":"record","created_at":"2026-05-18T00:07:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3a170a11f6f2c7a209f4d7e5c73fb2bd1ac1f44541a9e6be5644b12bd770fd63","cross_cats_sorted":["math-ph","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-29T20:12:56Z","title_canon_sha256":"9a102dbae981941da365c9a5ee44a17a7cb9ed1dff441a4783330e77957d1a03"},"schema_version":"1.0","source":{"id":"1412.0150","kind":"arxiv","version":5}},"canonical_sha256":"37ed67915990ff1494f265a1a2d19a9ece416086134b9cfb377e522f652a1e56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37ed67915990ff1494f265a1a2d19a9ece416086134b9cfb377e522f652a1e56","first_computed_at":"2026-05-18T00:07:51.370077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:51.370077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wvBqYHD0iEfUFF/31AWq3J4uxO5uPQyIqe8h9tD+qYPcONq2/sUa9W4W6Fm9ly2X1GdIWxt804yqjL/HpMrpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:51.370905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0150","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1230a93bcb12e02e9a84564be300aadbaccd9dac8446b1178726b2729d3c81f","sha256:7563121ec20c81e6f307bff92607b06dab1544dc09f4f7a94e7011c9f0aac923"],"state_sha256":"c912c7e8aa71bdb587b21a8aee19def7062a1d91ab38bfaf652e9c815cd5bd25"}