{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NBHJJRYY4GSCMHW4QBF7ZOVZBQ","short_pith_number":"pith:NBHJJRYY","canonical_record":{"source":{"id":"1808.10500","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-30T19:59:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0e1b5d252ad39caddf7d07c667f09b816a7376f7b4a19141c9b2293dec8933d3","abstract_canon_sha256":"57407ab9eda45f8518a93c60e6257ce032a8f0dfa306a319df60b3693042e0bf"},"schema_version":"1.0"},"canonical_sha256":"684e94c718e1a4261edc804bfcbab90c0f65ac9055c33441cfcca83f77a0b376","source":{"kind":"arxiv","id":"1808.10500","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10500","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10500v3","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10500","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"NBHJJRYY4GSC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NBHJJRYY4GSCMHW4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NBHJJRYY","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NBHJJRYY4GSCMHW4QBF7ZOVZBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10500","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-30T19:59:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0e1b5d252ad39caddf7d07c667f09b816a7376f7b4a19141c9b2293dec8933d3","abstract_canon_sha256":"57407ab9eda45f8518a93c60e6257ce032a8f0dfa306a319df60b3693042e0bf"},"schema_version":"1.0"},"canonical_sha256":"684e94c718e1a4261edc804bfcbab90c0f65ac9055c33441cfcca83f77a0b376","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:12.925228Z","signature_b64":"sGQM6DltiZBLsVbjGel34FH7zx1+/7cGTqwVcOEzJIApmNWf72CeulVag/8JCw8bo4CZZDGZFpypQk1/sG23DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"684e94c718e1a4261edc804bfcbab90c0f65ac9055c33441cfcca83f77a0b376","last_reissued_at":"2026-05-18T00:00:12.924655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:12.924655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10500","source_version":3,"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:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d34DmQ/CYe+OvSKqCTBLcwjeu2QhxmjRflHAlka5hI5ASTT6Tc5PyywxumcArjohwlpBN68bRqvUeHuSMA7rBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:07:48.437955Z"},"content_sha256":"8670b16d4dc871cb425054c04bea4f774329e5b2490166ffdae389dc5c3eba94","schema_version":"1.0","event_id":"sha256:8670b16d4dc871cb425054c04bea4f774329e5b2490166ffdae389dc5c3eba94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NBHJJRYY4GSCMHW4QBF7ZOVZBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On self-avoiding polygons and walks: the snake method via polygon joining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alan Hammond","submitted_at":"2018-08-30T19:59:53Z","abstract_excerpt":"For $d \\geq 2$ and $n \\in \\mathbb{N}$, let $\\mathsf{W}_n$ denote the uniform law on self-avoiding walks beginning at the origin in the integer lattice $\\mathbb{Z}^d$, and write $\\Gamma$ for a $\\mathsf{W}_n$-distributed walk. We show that the closing probability $\\mathsf{W}_n \\big( \\vert \\vert \\Gamma_n \\vert \\vert = 1 \\big)$ that $\\Gamma$'s endpoint neighbours the origin is at most $n^{-4/7 + o(1)}$ for a positive density set of odd $n$ in dimension $d = 2$. This result is proved using the snake method, a technique for proving closing probability upper bounds, which originated in [3] and was ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10500","kind":"arxiv","version":3},"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:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heA3PDsoDjOALSHOcCYv2gGqT1Zt7LNfbssT/Rp0fYjN3Y2yhwAfwVdqQDzDDv9dbDnys+FOs8EJwZyFdK2JCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:07:48.438306Z"},"content_sha256":"698fe97cb5c58970741d462c989012063e58cd571b94494aaffc42a335eb73f8","schema_version":"1.0","event_id":"sha256:698fe97cb5c58970741d462c989012063e58cd571b94494aaffc42a335eb73f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBHJJRYY4GSCMHW4QBF7ZOVZBQ/bundle.json","state_url":"https://pith.science/pith/NBHJJRYY4GSCMHW4QBF7ZOVZBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBHJJRYY4GSCMHW4QBF7ZOVZBQ/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-06-20T06:07:48Z","links":{"resolver":"https://pith.science/pith/NBHJJRYY4GSCMHW4QBF7ZOVZBQ","bundle":"https://pith.science/pith/NBHJJRYY4GSCMHW4QBF7ZOVZBQ/bundle.json","state":"https://pith.science/pith/NBHJJRYY4GSCMHW4QBF7ZOVZBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBHJJRYY4GSCMHW4QBF7ZOVZBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NBHJJRYY4GSCMHW4QBF7ZOVZBQ","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":"57407ab9eda45f8518a93c60e6257ce032a8f0dfa306a319df60b3693042e0bf","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-30T19:59:53Z","title_canon_sha256":"0e1b5d252ad39caddf7d07c667f09b816a7376f7b4a19141c9b2293dec8933d3"},"schema_version":"1.0","source":{"id":"1808.10500","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10500","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10500v3","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10500","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"NBHJJRYY4GSC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NBHJJRYY4GSCMHW4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NBHJJRYY","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:698fe97cb5c58970741d462c989012063e58cd571b94494aaffc42a335eb73f8","target":"graph","created_at":"2026-05-18T00:00:12Z","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":"For $d \\geq 2$ and $n \\in \\mathbb{N}$, let $\\mathsf{W}_n$ denote the uniform law on self-avoiding walks beginning at the origin in the integer lattice $\\mathbb{Z}^d$, and write $\\Gamma$ for a $\\mathsf{W}_n$-distributed walk. We show that the closing probability $\\mathsf{W}_n \\big( \\vert \\vert \\Gamma_n \\vert \\vert = 1 \\big)$ that $\\Gamma$'s endpoint neighbours the origin is at most $n^{-4/7 + o(1)}$ for a positive density set of odd $n$ in dimension $d = 2$. This result is proved using the snake method, a technique for proving closing probability upper bounds, which originated in [3] and was ma","authors_text":"Alan Hammond","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-30T19:59:53Z","title":"On self-avoiding polygons and walks: the snake method via polygon joining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10500","kind":"arxiv","version":3},"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:8670b16d4dc871cb425054c04bea4f774329e5b2490166ffdae389dc5c3eba94","target":"record","created_at":"2026-05-18T00:00:12Z","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":"57407ab9eda45f8518a93c60e6257ce032a8f0dfa306a319df60b3693042e0bf","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-30T19:59:53Z","title_canon_sha256":"0e1b5d252ad39caddf7d07c667f09b816a7376f7b4a19141c9b2293dec8933d3"},"schema_version":"1.0","source":{"id":"1808.10500","kind":"arxiv","version":3}},"canonical_sha256":"684e94c718e1a4261edc804bfcbab90c0f65ac9055c33441cfcca83f77a0b376","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"684e94c718e1a4261edc804bfcbab90c0f65ac9055c33441cfcca83f77a0b376","first_computed_at":"2026-05-18T00:00:12.924655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:12.924655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sGQM6DltiZBLsVbjGel34FH7zx1+/7cGTqwVcOEzJIApmNWf72CeulVag/8JCw8bo4CZZDGZFpypQk1/sG23DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:12.925228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10500","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8670b16d4dc871cb425054c04bea4f774329e5b2490166ffdae389dc5c3eba94","sha256:698fe97cb5c58970741d462c989012063e58cd571b94494aaffc42a335eb73f8"],"state_sha256":"dea170cc555c16697ce9b3efd2ffc2bab6a4326ba1bc42d48a533a10ff524350"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wACPPnhvWvV52pEjusO2xfQXDM8kYDzIRpHuC3LosJiJ8KI8zSJ/6wWv1D5Zvlwv/32zci1Z0qv7aeFoY95XBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:07:48.440247Z","bundle_sha256":"12f499511a0ad886e6211aab4a458cc3a88c12ee21545ec6c9a9c3569d1eb510"}}