{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3CNLSX6HDFAMZUTHTP2AMHZFIY","short_pith_number":"pith:3CNLSX6H","canonical_record":{"source":{"id":"1504.05286","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-21T03:20:13Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"2dc705cffa3bd4b41426de9856226f4800c1e0579ea8d545e25355f3024d43a5","abstract_canon_sha256":"62f63d857d69594b9b5f07771a13358a0d151a61b6c1faa16ace6647decb32b8"},"schema_version":"1.0"},"canonical_sha256":"d89ab95fc71940ccd2679bf4061f25462ee4c844082728c3661e31e4e16a704e","source":{"kind":"arxiv","id":"1504.05286","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05286","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05286v5","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05286","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"3CNLSX6HDFAM","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3CNLSX6HDFAMZUTH","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3CNLSX6H","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3CNLSX6HDFAMZUTHTP2AMHZFIY","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05286","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-21T03:20:13Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"2dc705cffa3bd4b41426de9856226f4800c1e0579ea8d545e25355f3024d43a5","abstract_canon_sha256":"62f63d857d69594b9b5f07771a13358a0d151a61b6c1faa16ace6647decb32b8"},"schema_version":"1.0"},"canonical_sha256":"d89ab95fc71940ccd2679bf4061f25462ee4c844082728c3661e31e4e16a704e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:07.606942Z","signature_b64":"/2sj6C/6DlkCjldEnQ1K31sfQ1+uSihfeuZGzB9ojbMrMsSay7ljBfBzkMU0dfm6Zw9GvQlMMksd94B9arQVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d89ab95fc71940ccd2679bf4061f25462ee4c844082728c3661e31e4e16a704e","last_reissued_at":"2026-05-18T00:51:07.606444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:07.606444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05286","source_version":5,"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:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTi7qkQiV0U5PRGrCknogyg4FHXN9ocb5VTUu9Q/S6twPFVOC/vPMTcgbWR0ZRFyi9VswQZeGEBvVaftvzW/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:41:44.139258Z"},"content_sha256":"3ae98dcf0714e08acf3ab89b23dba3ccc5f18fdd59da684af12661b5818f1f85","schema_version":"1.0","event_id":"sha256:3ae98dcf0714e08acf3ab89b23dba3ccc5f18fdd59da684af12661b5818f1f85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3CNLSX6HDFAMZUTHTP2AMHZFIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On self-avoiding polygons and walks: counting, joining and closing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Alan Hammond","submitted_at":"2015-04-21T03:20:13Z","abstract_excerpt":"For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons in Z^d up to translation. Then the probability under the uniform law W_n on self-avoiding walks Gamma of any given odd length n beginning at the origin that Gamma closes -- i.e., that Gamma's endpoint is a neighbour of the origin -- is given by W_n ( Gamma closes ) = 2(n+1) p_{n+1}/c_n. The polygon and walk cardinalities share a common exponential growth: li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05286","kind":"arxiv","version":5},"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:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5o0b81UTYKagq2d92xHCbrk7amwHHz9V3e9QuiQhbgHcPQfvTIfvTTebTN/19ZuEFEpTbmka9vevpuzw+jU7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:41:44.139630Z"},"content_sha256":"4855b7080390742268c281811c5b5516e255dca22093817607958f51e9275b36","schema_version":"1.0","event_id":"sha256:4855b7080390742268c281811c5b5516e255dca22093817607958f51e9275b36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CNLSX6HDFAMZUTHTP2AMHZFIY/bundle.json","state_url":"https://pith.science/pith/3CNLSX6HDFAMZUTHTP2AMHZFIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CNLSX6HDFAMZUTHTP2AMHZFIY/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-20T03:41:44Z","links":{"resolver":"https://pith.science/pith/3CNLSX6HDFAMZUTHTP2AMHZFIY","bundle":"https://pith.science/pith/3CNLSX6HDFAMZUTHTP2AMHZFIY/bundle.json","state":"https://pith.science/pith/3CNLSX6HDFAMZUTHTP2AMHZFIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CNLSX6HDFAMZUTHTP2AMHZFIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3CNLSX6HDFAMZUTHTP2AMHZFIY","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":"62f63d857d69594b9b5f07771a13358a0d151a61b6c1faa16ace6647decb32b8","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-21T03:20:13Z","title_canon_sha256":"2dc705cffa3bd4b41426de9856226f4800c1e0579ea8d545e25355f3024d43a5"},"schema_version":"1.0","source":{"id":"1504.05286","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05286","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05286v5","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05286","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"3CNLSX6HDFAM","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3CNLSX6HDFAMZUTH","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3CNLSX6H","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:4855b7080390742268c281811c5b5516e255dca22093817607958f51e9275b36","target":"graph","created_at":"2026-05-18T00:51:07Z","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 at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons in Z^d up to translation. Then the probability under the uniform law W_n on self-avoiding walks Gamma of any given odd length n beginning at the origin that Gamma closes -- i.e., that Gamma's endpoint is a neighbour of the origin -- is given by W_n ( Gamma closes ) = 2(n+1) p_{n+1}/c_n. The polygon and walk cardinalities share a common exponential growth: li","authors_text":"Alan Hammond","cross_cats":["math-ph","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-21T03:20:13Z","title":"On self-avoiding polygons and walks: counting, joining and closing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05286","kind":"arxiv","version":5},"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:3ae98dcf0714e08acf3ab89b23dba3ccc5f18fdd59da684af12661b5818f1f85","target":"record","created_at":"2026-05-18T00:51:07Z","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":"62f63d857d69594b9b5f07771a13358a0d151a61b6c1faa16ace6647decb32b8","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-21T03:20:13Z","title_canon_sha256":"2dc705cffa3bd4b41426de9856226f4800c1e0579ea8d545e25355f3024d43a5"},"schema_version":"1.0","source":{"id":"1504.05286","kind":"arxiv","version":5}},"canonical_sha256":"d89ab95fc71940ccd2679bf4061f25462ee4c844082728c3661e31e4e16a704e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d89ab95fc71940ccd2679bf4061f25462ee4c844082728c3661e31e4e16a704e","first_computed_at":"2026-05-18T00:51:07.606444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:07.606444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2sj6C/6DlkCjldEnQ1K31sfQ1+uSihfeuZGzB9ojbMrMsSay7ljBfBzkMU0dfm6Zw9GvQlMMksd94B9arQVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:07.606942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05286","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae98dcf0714e08acf3ab89b23dba3ccc5f18fdd59da684af12661b5818f1f85","sha256:4855b7080390742268c281811c5b5516e255dca22093817607958f51e9275b36"],"state_sha256":"45a41723e5ef122c6f0be9da77efa693fd4c9d3cd55ab9d6428439c0c76310ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJaoVpSp+gKw+GaoOQWRjoscrlY4ezBO1Ka0uRumVYHk4a5jU8BwoR2VBmhTzC3pwDvwvvdHrnZ0T8jWyH9+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:41:44.141793Z","bundle_sha256":"c036f33fe9e32a34833c1f6c14411114fd78ded9527a0204bcf2fd2a79532f79"}}