{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CJJGZ5FNBO2YLBJGUUHBMM3XFU","short_pith_number":"pith:CJJGZ5FN","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"},"canonical_sha256":"12526cf4ad0bb5858526a50e1633772d22c876123517acaae0885dd5505f544a","source":{"kind":"arxiv","id":"1510.08659","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08659","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08659v2","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08659","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"CJJGZ5FNBO2Y","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJJGZ5FNBO2YLBJG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJJGZ5FN","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CJJGZ5FNBO2YLBJGUUHBMM3XFU","target":"record","payload":{"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"},"canonical_sha256":"12526cf4ad0bb5858526a50e1633772d22c876123517acaae0885dd5505f544a","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"},"source_kind":"arxiv","source_id":"1510.08659","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QM6VIOaUmG5UrFH4U6kMwawqQbhTpgWaSOv7iUQx5vrqevTQJNH8v6gv75p++H4tGXX3ZcCr4TDYZO0ka0yZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:33:43.628037Z"},"content_sha256":"49abb09dc8366fa6499651196392263b3e35c2f727ebcf5dc73118c3e688fcb5","schema_version":"1.0","event_id":"sha256:49abb09dc8366fa6499651196392263b3e35c2f727ebcf5dc73118c3e688fcb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CJJGZ5FNBO2YLBJGUUHBMM3XFU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsjESveJjYlH2/bT2c7uuez+bwY2O0EpKNugvRC9XL9ra1OOgLmfsgKbmnoHyR8THm2G3xE1E5bYLlj/6lNuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:33:43.628401Z"},"content_sha256":"78af1f7f755c64ad5ca96be805f398af17cb28b081e7096f45137edba20ddf25","schema_version":"1.0","event_id":"sha256:78af1f7f755c64ad5ca96be805f398af17cb28b081e7096f45137edba20ddf25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/bundle.json","state_url":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T14:33:43Z","links":{"resolver":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU","bundle":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/bundle.json","state":"https://pith.science/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJJGZ5FNBO2YLBJGUUHBMM3XFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CJJGZ5FNBO2YLBJGUUHBMM3XFU","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":"715f4d8f3eb2e81580e0d523881eba690dbbe637457dbbb350b6946961b2c5f6","cross_cats_sorted":["math-ph","math.CO","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-10-29T12:05:40Z","title_canon_sha256":"9a1501c7044070d1fa8e3911e1b552d3c6788b43a778257eb8c29a91839cb6cb"},"schema_version":"1.0","source":{"id":"1510.08659","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08659","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08659v2","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08659","created_at":"2026-05-18T01:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"CJJGZ5FNBO2Y","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJJGZ5FNBO2YLBJG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJJGZ5FN","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:78af1f7f755c64ad5ca96be805f398af17cb28b081e7096f45137edba20ddf25","target":"graph","created_at":"2026-05-18T01:26:09Z","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 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)$","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","cross_cats":["math-ph","math.CO","math.MP","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-10-29T12:05:40Z","title":"Self-avoiding walks and amenability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08659","kind":"arxiv","version":2},"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:49abb09dc8366fa6499651196392263b3e35c2f727ebcf5dc73118c3e688fcb5","target":"record","created_at":"2026-05-18T01:26:09Z","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":"715f4d8f3eb2e81580e0d523881eba690dbbe637457dbbb350b6946961b2c5f6","cross_cats_sorted":["math-ph","math.CO","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-10-29T12:05:40Z","title_canon_sha256":"9a1501c7044070d1fa8e3911e1b552d3c6788b43a778257eb8c29a91839cb6cb"},"schema_version":"1.0","source":{"id":"1510.08659","kind":"arxiv","version":2}},"canonical_sha256":"12526cf4ad0bb5858526a50e1633772d22c876123517acaae0885dd5505f544a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12526cf4ad0bb5858526a50e1633772d22c876123517acaae0885dd5505f544a","first_computed_at":"2026-05-18T01:26:09.252245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:09.252245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VpOr6tSGVpjFwcDMxOvmwpyqp4ZpyNvLUXucTFE91AJqd8wflI/5k5MPEHvdaGr5FPDPy3Gs1vqnJ10Kwy8TDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:09.252776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08659","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49abb09dc8366fa6499651196392263b3e35c2f727ebcf5dc73118c3e688fcb5","sha256:78af1f7f755c64ad5ca96be805f398af17cb28b081e7096f45137edba20ddf25"],"state_sha256":"3c6ff07145e549b550364c84afc7c42c7362f2e681580d680661fc2e56e74727"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftgHgWHP21sn53ZSuZ6nKpLhelYJaRjhkfrzfYmQebavj+vUHL7QjnS650pkttV8L2OGQFY/Vvkd3dM8tLAeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:33:43.630473Z","bundle_sha256":"987b0f5bca5aede853734a94beee9f16d52454b18e3916fb969609bcbc425bd4"}}