{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KBWEPAEROWNLWIKO4R2IDEVG2T","short_pith_number":"pith:KBWEPAER","schema_version":"1.0","canonical_sha256":"506c478091759abb214ee4748192a6d4ce11bc854588f220eb5aaa4e2292734a","source":{"kind":"arxiv","id":"1307.7132","version":2},"attestation_state":"computed","paper":{"title":"Extendable self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Alexander E. Holroyd, Geoffrey R. Grimmett, Yuval Peres","submitted_at":"2013-07-26T19:33:32Z","abstract_excerpt":"The connective constant mu of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be extended forwards (respectively, backwards) to a singly infinite self-avoiding walk. It is called doubly extendable if it may be extended in both directions simultaneously to a doubly infinite self-avoiding walk. We prove that the connective constants for forward, backward, and doubly extendable self-avoiding walks, denoted respectively by mu^F, mu^B, mu^FB, exist "},"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":"1307.7132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-26T19:33:32Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"efc3a51defa522cb1963803ad1b64650d9aa14bdc6c330522825f24e1f5a2e19","abstract_canon_sha256":"0544587e38ae37a69e3b6bb9e3bbfb355acc3662eb4554526d5fbebbfbc3fe18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:19.602961Z","signature_b64":"5yVeHyNXyQM42Izytgt9j955w7vO39tD9DqtT8T2qg4idnznRXNcfhxnb6aRY77EntMmnfVGz6TRG3yjg24rAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506c478091759abb214ee4748192a6d4ce11bc854588f220eb5aaa4e2292734a","last_reissued_at":"2026-05-18T00:02:19.602598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:19.602598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extendable self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Alexander E. Holroyd, Geoffrey R. Grimmett, Yuval Peres","submitted_at":"2013-07-26T19:33:32Z","abstract_excerpt":"The connective constant mu of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be extended forwards (respectively, backwards) to a singly infinite self-avoiding walk. It is called doubly extendable if it may be extended in both directions simultaneously to a doubly infinite self-avoiding walk. We prove that the connective constants for forward, backward, and doubly extendable self-avoiding walks, denoted respectively by mu^F, mu^B, mu^FB, exist "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7132","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":"1307.7132","created_at":"2026-05-18T00:02:19.602661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7132v2","created_at":"2026-05-18T00:02:19.602661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7132","created_at":"2026-05-18T00:02:19.602661+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBWEPAEROWNL","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBWEPAEROWNLWIKO","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBWEPAER","created_at":"2026-05-18T12:27:49.015174+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/KBWEPAEROWNLWIKO4R2IDEVG2T","json":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T.json","graph_json":"https://pith.science/api/pith-number/KBWEPAEROWNLWIKO4R2IDEVG2T/graph.json","events_json":"https://pith.science/api/pith-number/KBWEPAEROWNLWIKO4R2IDEVG2T/events.json","paper":"https://pith.science/paper/KBWEPAER"},"agent_actions":{"view_html":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T","download_json":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T.json","view_paper":"https://pith.science/paper/KBWEPAER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7132&json=true","fetch_graph":"https://pith.science/api/pith-number/KBWEPAEROWNLWIKO4R2IDEVG2T/graph.json","fetch_events":"https://pith.science/api/pith-number/KBWEPAEROWNLWIKO4R2IDEVG2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/action/storage_attestation","attest_author":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/action/author_attestation","sign_citation":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/action/citation_signature","submit_replication":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/action/replication_record"}},"created_at":"2026-05-18T00:02:19.602661+00:00","updated_at":"2026-05-18T00:02:19.602661+00:00"}