{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CIRISDW5AE6K4LBFIW3B66I7H6","short_pith_number":"pith:CIRISDW5","canonical_record":{"source":{"id":"1808.09597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-29T01:24:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1c9c669341492d0d16af7032ef2cf77ffc3d9a90d471b666e17703fecc3ab54b","abstract_canon_sha256":"1930192e6f2dc78407ba6ff478d5aa58f213c8274907e06c161e12b40470862c"},"schema_version":"1.0"},"canonical_sha256":"1222890edd013cae2c2545b61f791f3fb347c9fd9a3a11267ce1117bdf21c11d","source":{"kind":"arxiv","id":"1808.09597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09597","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09597v1","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09597","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"CIRISDW5AE6K","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CIRISDW5AE6K4LBF","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CIRISDW5","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CIRISDW5AE6K4LBFIW3B66I7H6","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-29T01:24:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1c9c669341492d0d16af7032ef2cf77ffc3d9a90d471b666e17703fecc3ab54b","abstract_canon_sha256":"1930192e6f2dc78407ba6ff478d5aa58f213c8274907e06c161e12b40470862c"},"schema_version":"1.0"},"canonical_sha256":"1222890edd013cae2c2545b61f791f3fb347c9fd9a3a11267ce1117bdf21c11d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:55.066743Z","signature_b64":"t+Js92n198whHdN+7+voq8WQRpDZE1UKVm0p/YeOR2cGPdh6ysv0rYE0nKLUTyt8G0apjZ/ioTO7hR51pSEtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1222890edd013cae2c2545b61f791f3fb347c9fd9a3a11267ce1117bdf21c11d","last_reissued_at":"2026-05-18T00:06:55.066192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:55.066192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09597","source_version":1,"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:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOfFXqZQrQ8LpUeG6kYHizROgITZu+je5E8Cs4PdYF+xvmmX6WnEt9VA+0/W6XeZlSgTUhXGwM6MA7P+RDWoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:42:32.675785Z"},"content_sha256":"75e8ab83d8fa959a53d9eae6be908611d2bd34c11f2206b803f4ce02a690ed35","schema_version":"1.0","event_id":"sha256:75e8ab83d8fa959a53d9eae6be908611d2bd34c11f2206b803f4ce02a690ed35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CIRISDW5AE6K4LBFIW3B66I7H6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On self-avoiding polygons and walks: the snake method via pattern fluctuation","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-29T01:24:32Z","abstract_excerpt":"For $d \\geq 2$ and $n \\in \\mathbb{N}$, let $\\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour 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^{-1/2 + o(1)}$ in any dimension $d \\geq 2$. The method of proof is a reworking of that in [4], which found a closing probability upper bound of $n^{-1/4 + o(1)}$. A key element of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09597","kind":"arxiv","version":1},"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:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAq5ruY/hC+9WlOBaBlcXo1QJGlqpLDtxLi5SxUeH/UGZA3ws7DnQfcw6NgyDzWvNbJj/2xrYOfcx7MG/v7BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:42:32.676147Z"},"content_sha256":"875402f3c8a8a40ec630ab598dabd67df155e96bdc428d450b12e81435dc71cd","schema_version":"1.0","event_id":"sha256:875402f3c8a8a40ec630ab598dabd67df155e96bdc428d450b12e81435dc71cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIRISDW5AE6K4LBFIW3B66I7H6/bundle.json","state_url":"https://pith.science/pith/CIRISDW5AE6K4LBFIW3B66I7H6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIRISDW5AE6K4LBFIW3B66I7H6/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-20T08:42:32Z","links":{"resolver":"https://pith.science/pith/CIRISDW5AE6K4LBFIW3B66I7H6","bundle":"https://pith.science/pith/CIRISDW5AE6K4LBFIW3B66I7H6/bundle.json","state":"https://pith.science/pith/CIRISDW5AE6K4LBFIW3B66I7H6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIRISDW5AE6K4LBFIW3B66I7H6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CIRISDW5AE6K4LBFIW3B66I7H6","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":"1930192e6f2dc78407ba6ff478d5aa58f213c8274907e06c161e12b40470862c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-29T01:24:32Z","title_canon_sha256":"1c9c669341492d0d16af7032ef2cf77ffc3d9a90d471b666e17703fecc3ab54b"},"schema_version":"1.0","source":{"id":"1808.09597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09597","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09597v1","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09597","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"CIRISDW5AE6K","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CIRISDW5AE6K4LBF","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CIRISDW5","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:875402f3c8a8a40ec630ab598dabd67df155e96bdc428d450b12e81435dc71cd","target":"graph","created_at":"2026-05-18T00:06:55Z","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 of length $n$ beginning at the origin in the nearest-neighbour 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^{-1/2 + o(1)}$ in any dimension $d \\geq 2$. The method of proof is a reworking of that in [4], which found a closing probability upper bound of $n^{-1/4 + o(1)}$. A key element of the","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-29T01:24:32Z","title":"On self-avoiding polygons and walks: the snake method via pattern fluctuation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09597","kind":"arxiv","version":1},"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:75e8ab83d8fa959a53d9eae6be908611d2bd34c11f2206b803f4ce02a690ed35","target":"record","created_at":"2026-05-18T00:06:55Z","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":"1930192e6f2dc78407ba6ff478d5aa58f213c8274907e06c161e12b40470862c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-29T01:24:32Z","title_canon_sha256":"1c9c669341492d0d16af7032ef2cf77ffc3d9a90d471b666e17703fecc3ab54b"},"schema_version":"1.0","source":{"id":"1808.09597","kind":"arxiv","version":1}},"canonical_sha256":"1222890edd013cae2c2545b61f791f3fb347c9fd9a3a11267ce1117bdf21c11d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1222890edd013cae2c2545b61f791f3fb347c9fd9a3a11267ce1117bdf21c11d","first_computed_at":"2026-05-18T00:06:55.066192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:55.066192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t+Js92n198whHdN+7+voq8WQRpDZE1UKVm0p/YeOR2cGPdh6ysv0rYE0nKLUTyt8G0apjZ/ioTO7hR51pSEtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:55.066743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75e8ab83d8fa959a53d9eae6be908611d2bd34c11f2206b803f4ce02a690ed35","sha256:875402f3c8a8a40ec630ab598dabd67df155e96bdc428d450b12e81435dc71cd"],"state_sha256":"5f57a0a131bb9010f5cd81440f4b7e483266b0dd3a3c0dcd73d15146b82beea7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgaz+5wKI7UH2FpzRuJHdT7mZ7jLaMbODH73Zip9s1qGTeDIbIisoEht8pAWYjmXQWZa1fG981VrHan2SqQUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:42:32.678419Z","bundle_sha256":"9ef3326e6779f81e740843a08dfb3db77ed1007f5ba022b214303b0ffadcd4b5"}}