{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KBWEPAEROWNLWIKO4R2IDEVG2T","short_pith_number":"pith:KBWEPAER","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"},"canonical_sha256":"506c478091759abb214ee4748192a6d4ce11bc854588f220eb5aaa4e2292734a","source":{"kind":"arxiv","id":"1307.7132","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7132","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7132v2","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7132","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"KBWEPAEROWNL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KBWEPAEROWNLWIKO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KBWEPAER","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KBWEPAEROWNLWIKO4R2IDEVG2T","target":"record","payload":{"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"},"canonical_sha256":"506c478091759abb214ee4748192a6d4ce11bc854588f220eb5aaa4e2292734a","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"},"source_kind":"arxiv","source_id":"1307.7132","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-18T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igJtq8lqGs8rLfQNvYKQHjTHcK7GjF53x8IHQhjN1Y71/i+jkZBb5j0+Daz6tp9K2GK3CKZ/fe2IdOd6EsTEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:40:07.878985Z"},"content_sha256":"23713fc553bd17f15b611d4c501713eea36fc1777f5dfdbe28b346ef5c1397ce","schema_version":"1.0","event_id":"sha256:23713fc553bd17f15b611d4c501713eea36fc1777f5dfdbe28b346ef5c1397ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KBWEPAEROWNLWIKO4R2IDEVG2T","target":"graph","payload":{"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"},"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-18T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqyzOuzpx0AQymGoaEDCVeU390dICjTXm3++bMIVVk1QoIv1ZhBVlrrpZnDATuwiSsRZukhbTIlwHd8fCMbeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:40:07.879399Z"},"content_sha256":"df832911eab805cf677f555fbd06a367a3d30ee92219b7e2dc9edf5aa7a83635","schema_version":"1.0","event_id":"sha256:df832911eab805cf677f555fbd06a367a3d30ee92219b7e2dc9edf5aa7a83635"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/bundle.json","state_url":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/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-28T16:40:07Z","links":{"resolver":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T","bundle":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/bundle.json","state":"https://pith.science/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBWEPAEROWNLWIKO4R2IDEVG2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KBWEPAEROWNLWIKO4R2IDEVG2T","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":"0544587e38ae37a69e3b6bb9e3bbfb355acc3662eb4554526d5fbebbfbc3fe18","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-26T19:33:32Z","title_canon_sha256":"efc3a51defa522cb1963803ad1b64650d9aa14bdc6c330522825f24e1f5a2e19"},"schema_version":"1.0","source":{"id":"1307.7132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7132","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7132v2","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7132","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"KBWEPAEROWNL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KBWEPAEROWNLWIKO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KBWEPAER","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:df832911eab805cf677f555fbd06a367a3d30ee92219b7e2dc9edf5aa7a83635","target":"graph","created_at":"2026-05-18T00:02:19Z","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 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 ","authors_text":"Alexander E. Holroyd, Geoffrey R. Grimmett, Yuval Peres","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-26T19:33:32Z","title":"Extendable self-avoiding walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7132","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:23713fc553bd17f15b611d4c501713eea36fc1777f5dfdbe28b346ef5c1397ce","target":"record","created_at":"2026-05-18T00:02:19Z","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":"0544587e38ae37a69e3b6bb9e3bbfb355acc3662eb4554526d5fbebbfbc3fe18","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-26T19:33:32Z","title_canon_sha256":"efc3a51defa522cb1963803ad1b64650d9aa14bdc6c330522825f24e1f5a2e19"},"schema_version":"1.0","source":{"id":"1307.7132","kind":"arxiv","version":2}},"canonical_sha256":"506c478091759abb214ee4748192a6d4ce11bc854588f220eb5aaa4e2292734a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"506c478091759abb214ee4748192a6d4ce11bc854588f220eb5aaa4e2292734a","first_computed_at":"2026-05-18T00:02:19.602598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:19.602598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5yVeHyNXyQM42Izytgt9j955w7vO39tD9DqtT8T2qg4idnznRXNcfhxnb6aRY77EntMmnfVGz6TRG3yjg24rAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:19.602961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23713fc553bd17f15b611d4c501713eea36fc1777f5dfdbe28b346ef5c1397ce","sha256:df832911eab805cf677f555fbd06a367a3d30ee92219b7e2dc9edf5aa7a83635"],"state_sha256":"a354f9f7b3fa05e1ab9d5b1e41e7e10fa633a0fa56da927807a99f0c0ef41dec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rn1FmkAxXY0poGpTfMCG+k/krMKeWzmiWUB7MPbdqDDwTKjmolo+AuiD8HgS9Vl86XELJhQZ6wGJpoUTCjMvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:40:07.882218Z","bundle_sha256":"a45f60ed214bbe7d14ba4b0bef54c1414de60aee538b7da01d7a1bde134ec79d"}}