{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CJJGZ5FNBO2YLBJGUUHBMM3XFU","short_pith_number":"pith:CJJGZ5FN","schema_version":"1.0","canonical_sha256":"12526cf4ad0bb5858526a50e1633772d22c876123517acaae0885dd5505f544a","source":{"kind":"arxiv","id":"1510.08659","version":2},"attestation_state":"computed","paper":{"title":"Self-avoiding walks and amenability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP","math.PR"],"primary_cat":"math.GR","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","submitted_at":"2015-10-29T12:05:40Z","abstract_excerpt":"The connective constant $\\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the current work.\n  Various properties of connective constants depend on the existence of so-called 'graph height functions', namely: (i) whether $\\mu(G)$ is a local function on certain graphs derived from $G$, (ii) the equality of $\\mu(G)$ and the asymptotic growth rate of bridges, and (iii) whether there exists a terminating algorithm for approximating $\\mu(G)$"},"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":"1510.08659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-10-29T12:05:40Z","cross_cats_sorted":["math-ph","math.CO","math.MP","math.PR"],"title_canon_sha256":"9a1501c7044070d1fa8e3911e1b552d3c6788b43a778257eb8c29a91839cb6cb","abstract_canon_sha256":"715f4d8f3eb2e81580e0d523881eba690dbbe637457dbbb350b6946961b2c5f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:09.252776Z","signature_b64":"VpOr6tSGVpjFwcDMxOvmwpyqp4ZpyNvLUXucTFE91AJqd8wflI/5k5MPEHvdaGr5FPDPy3Gs1vqnJ10Kwy8TDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12526cf4ad0bb5858526a50e1633772d22c876123517acaae0885dd5505f544a","last_reissued_at":"2026-05-18T01:26:09.252245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:09.252245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-avoiding walks and amenability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP","math.PR"],"primary_cat":"math.GR","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","submitted_at":"2015-10-29T12:05:40Z","abstract_excerpt":"The connective constant $\\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the current work.\n  Various properties of connective constants depend on the existence of so-called 'graph height functions', namely: (i) whether $\\mu(G)$ is a local function on certain graphs derived from $G$, (ii) the equality of $\\mu(G)$ and the asymptotic growth rate of bridges, and (iii) whether there exists a terminating algorithm for approximating $\\mu(G)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08659","kind":"arxiv","version":2},"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":"1510.08659","created_at":"2026-05-18T01:26:09.252327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08659v2","created_at":"2026-05-18T01:26:09.252327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08659","created_at":"2026-05-18T01:26:09.252327+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJJGZ5FNBO2Y","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJJGZ5FNBO2YLBJG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJJGZ5FN","created_at":"2026-05-18T12:29:14.074870+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/CJJGZ5FNBO2YLBJGUUHBMM3XFU","json":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU.json","graph_json":"https://pith.science/api/pith-number/CJJGZ5FNBO2YLBJGUUHBMM3XFU/graph.json","events_json":"https://pith.science/api/pith-number/CJJGZ5FNBO2YLBJGUUHBMM3XFU/events.json","paper":"https://pith.science/paper/CJJGZ5FN"},"agent_actions":{"view_html":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU","download_json":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU.json","view_paper":"https://pith.science/paper/CJJGZ5FN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08659&json=true","fetch_graph":"https://pith.science/api/pith-number/CJJGZ5FNBO2YLBJGUUHBMM3XFU/graph.json","fetch_events":"https://pith.science/api/pith-number/CJJGZ5FNBO2YLBJGUUHBMM3XFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/action/storage_attestation","attest_author":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/action/author_attestation","sign_citation":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/action/citation_signature","submit_replication":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/action/replication_record"}},"created_at":"2026-05-18T01:26:09.252327+00:00","updated_at":"2026-05-18T01:26:09.252327+00:00"}