{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5HH2PA2NWOA7OUSQVYZ4GFXZHJ","short_pith_number":"pith:5HH2PA2N","schema_version":"1.0","canonical_sha256":"e9cfa7834db381f75250ae33c316f93a7cacb855cb46afee211852e4ea2a0102","source":{"kind":"arxiv","id":"1309.6709","version":1},"attestation_state":"computed","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.6709","created_at":"2026-05-18T03:12:10.761634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6709v1","created_at":"2026-05-18T03:12:10.761634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6709","created_at":"2026-05-18T03:12:10.761634+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HH2PA2NWOA7","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HH2PA2NWOA7OUSQ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HH2PA2N","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ","json":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ.json","graph_json":"https://pith.science/api/pith-number/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/graph.json","events_json":"https://pith.science/api/pith-number/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/events.json","paper":"https://pith.science/paper/5HH2PA2N"},"agent_actions":{"view_html":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ","download_json":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ.json","view_paper":"https://pith.science/paper/5HH2PA2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6709&json=true","fetch_graph":"https://pith.science/api/pith-number/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/action/storage_attestation","attest_author":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/action/author_attestation","sign_citation":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/action/citation_signature","submit_replication":"https://pith.science/pith/5HH2PA2NWOA7OUSQVYZ4GFXZHJ/action/replication_record"}},"created_at":"2026-05-18T03:12:10.761634+00:00","updated_at":"2026-05-18T03:12:10.761634+00:00"}