{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5HH2PA2NWOA7OUSQVYZ4GFXZHJ","short_pith_number":"pith:5HH2PA2N","canonical_record":{"source":{"id":"1309.6709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2013-09-26T02:11:18Z","cross_cats_sorted":["cond-mat.stat-mech","math.MP"],"title_canon_sha256":"811ce3e04cbbf85b26ee0be0c3d360ca6e6abbcc8e9a222ade8d8df0bf350df6","abstract_canon_sha256":"ba913d4fed4f4b7e90bdb718fabc94299086b9351df8b6fccc311b8bf3a75fd8"},"schema_version":"1.0"},"canonical_sha256":"e9cfa7834db381f75250ae33c316f93a7cacb855cb46afee211852e4ea2a0102","source":{"kind":"arxiv","id":"1309.6709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6709","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6709v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6709","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"5HH2PA2NWOA7","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5HH2PA2NWOA7OUSQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5HH2PA2N","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5HH2PA2NWOA7OUSQVYZ4GFXZHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2013-09-26T02:11:18Z","cross_cats_sorted":["cond-mat.stat-mech","math.MP"],"title_canon_sha256":"811ce3e04cbbf85b26ee0be0c3d360ca6e6abbcc8e9a222ade8d8df0bf350df6","abstract_canon_sha256":"ba913d4fed4f4b7e90bdb718fabc94299086b9351df8b6fccc311b8bf3a75fd8"},"schema_version":"1.0"},"canonical_sha256":"e9cfa7834db381f75250ae33c316f93a7cacb855cb46afee211852e4ea2a0102","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.762289Z","signature_b64":"HhkMg+hqP+309aqB+aF/AdAYOpRaj0+GRMZSMSS5QSY+xqPFwCzK5ze2PNxFViao+pATlWwNhnkZ8ME4aAeOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9cfa7834db381f75250ae33c316f93a7cacb855cb46afee211852e4ea2a0102","last_reissued_at":"2026-05-18T03:12:10.761497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.761497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6709","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifrvwv0RudrDdIfxH1aERM1w4uN4c9hb/ZWKVp1IeNnK98dn1voMAgDPunVHeCquSlPzyjzx05tU5B6rT4S3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:14:56.724954Z"},"content_sha256":"372c0896a687993034cf0ac25a8f50afdd0d04eb02baebb945d1fca53d848b55","schema_version":"1.0","event_id":"sha256:372c0896a687993034cf0ac25a8f50afdd0d04eb02baebb945d1fca53d848b55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5HH2PA2NWOA7OUSQVYZ4GFXZHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new transfer-matrix algorithm for exact enumerations: self-avoiding walks on the square lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.MP"],"primary_cat":"math-ph","authors_text":"Iwan Jensen","submitted_at":"2013-09-26T02:11:18Z","abstract_excerpt":"We recently published [J. Phys A: Math. Theor. {\\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of self-avoiding walks on the square lattice. A detailed comparison with our previous best algorithm shows very significant improvement in the running time of the new algorithm. The new algorithm is used to extend the enumeration of self-avoiding walks to length 79 from the previous record of 71 and for metric properties, such as the average end-to-end distance,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6709","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTc6L/L14GapG7a7j8jtmu3Vxwz+RbWMOdZit3frYMRqb7STZtZIcRNt8/m61PVCssSlW2EkXEoa62lwU55OBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:14:56.725296Z"},"content_sha256":"bcc5dc16c2985e5b8c28062f4b0a5d20d8ceada321c6e9c229aa04d48e6b661a","schema_version":"1.0","event_id":"sha256:bcc5dc16c2985e5b8c28062f4b0a5d20d8ceada321c6e9c229aa04d48e6b661a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/bundle.json","state_url":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/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-02T07:14:56Z","links":{"resolver":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ","bundle":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/bundle.json","state":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5HH2PA2NWOA7OUSQVYZ4GFXZHJ","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":"ba913d4fed4f4b7e90bdb718fabc94299086b9351df8b6fccc311b8bf3a75fd8","cross_cats_sorted":["cond-mat.stat-mech","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2013-09-26T02:11:18Z","title_canon_sha256":"811ce3e04cbbf85b26ee0be0c3d360ca6e6abbcc8e9a222ade8d8df0bf350df6"},"schema_version":"1.0","source":{"id":"1309.6709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6709","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6709v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6709","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"5HH2PA2NWOA7","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5HH2PA2NWOA7OUSQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5HH2PA2N","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:bcc5dc16c2985e5b8c28062f4b0a5d20d8ceada321c6e9c229aa04d48e6b661a","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"We recently published [J. Phys A: Math. Theor. {\\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of self-avoiding walks on the square lattice. A detailed comparison with our previous best algorithm shows very significant improvement in the running time of the new algorithm. The new algorithm is used to extend the enumeration of self-avoiding walks to length 79 from the previous record of 71 and for metric properties, such as the average end-to-end distance,","authors_text":"Iwan Jensen","cross_cats":["cond-mat.stat-mech","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2013-09-26T02:11:18Z","title":"A new transfer-matrix algorithm for exact enumerations: self-avoiding walks on the square lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6709","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:372c0896a687993034cf0ac25a8f50afdd0d04eb02baebb945d1fca53d848b55","target":"record","created_at":"2026-05-18T03:12:10Z","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":"ba913d4fed4f4b7e90bdb718fabc94299086b9351df8b6fccc311b8bf3a75fd8","cross_cats_sorted":["cond-mat.stat-mech","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2013-09-26T02:11:18Z","title_canon_sha256":"811ce3e04cbbf85b26ee0be0c3d360ca6e6abbcc8e9a222ade8d8df0bf350df6"},"schema_version":"1.0","source":{"id":"1309.6709","kind":"arxiv","version":1}},"canonical_sha256":"e9cfa7834db381f75250ae33c316f93a7cacb855cb46afee211852e4ea2a0102","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9cfa7834db381f75250ae33c316f93a7cacb855cb46afee211852e4ea2a0102","first_computed_at":"2026-05-18T03:12:10.761497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.761497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HhkMg+hqP+309aqB+aF/AdAYOpRaj0+GRMZSMSS5QSY+xqPFwCzK5ze2PNxFViao+pATlWwNhnkZ8ME4aAeOAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.762289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:372c0896a687993034cf0ac25a8f50afdd0d04eb02baebb945d1fca53d848b55","sha256:bcc5dc16c2985e5b8c28062f4b0a5d20d8ceada321c6e9c229aa04d48e6b661a"],"state_sha256":"789ab4bbb447ef1a2ea2edce3dc326631d079a10574f94d44659e3990fc2fce5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCyQ4wQddXit6tJSc8VQdKNbAWFgppS7COi/RcT8eJvHVK95Cc5OKrHNzLAFRgNDK0VqaH4X3Li4zIM+qy91DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:14:56.727307Z","bundle_sha256":"33d3b096f4d640a273d29f7c930ab6e3f1b513532082f0913496e88fb087dbf9"}}