{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QZQPUXXHYNC3S2IZAZXRMFDVTC","short_pith_number":"pith:QZQPUXXH","schema_version":"1.0","canonical_sha256":"8660fa5ee7c345b96919066f16147598a4fe611f5c743a9c0e1b79e1c2d3c1f8","source":{"kind":"arxiv","id":"1005.1444","version":1},"attestation_state":"computed","paper":{"title":"Efficient implementation of the pivot algorithm for self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","physics.chem-ph","physics.comp-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Nathan Clisby","submitted_at":"2010-05-10T04:15:40Z","abstract_excerpt":"The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated. We explicitly describe the data structures and algorithms used, and provide a heuristic argument that the mean time per attempted pivot for $N$-step self-avoiding walks is $O(1)$ for the square and simple cubic lattices. Numerical experiments conducted for self-avoiding walks with up to 268 million steps are consistent with $o(\\log N)$ behavior for the square lattice and $O(\\log N)$ behavior for the s"},"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":"1005.1444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-05-10T04:15:40Z","cross_cats_sorted":["math-ph","math.MP","physics.chem-ph","physics.comp-ph"],"title_canon_sha256":"ef2788ad44c70a5a0144c8938ccb0a069cf2f254f96eb9881fff9593c7d8b4ae","abstract_canon_sha256":"cfe9251afeaf7fb805dc08267511eaa2507c14395b78f1e08e1998daef0d27fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:12.273827Z","signature_b64":"fCKjQ74m82zFW2zsawHQSK0PzM+0mp7Y0JjJWQGXum6pbER+1U+2ZFLeS01W6bNwObu6afg4tTOP74qJKsyOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8660fa5ee7c345b96919066f16147598a4fe611f5c743a9c0e1b79e1c2d3c1f8","last_reissued_at":"2026-05-18T01:03:12.273264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:12.273264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient implementation of the pivot algorithm for self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","physics.chem-ph","physics.comp-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Nathan Clisby","submitted_at":"2010-05-10T04:15:40Z","abstract_excerpt":"The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated. We explicitly describe the data structures and algorithms used, and provide a heuristic argument that the mean time per attempted pivot for $N$-step self-avoiding walks is $O(1)$ for the square and simple cubic lattices. Numerical experiments conducted for self-avoiding walks with up to 268 million steps are consistent with $o(\\log N)$ behavior for the square lattice and $O(\\log N)$ behavior for the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1444","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":"1005.1444","created_at":"2026-05-18T01:03:12.273369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1444v1","created_at":"2026-05-18T01:03:12.273369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1444","created_at":"2026-05-18T01:03:12.273369+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZQPUXXHYNC3","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZQPUXXHYNC3S2IZ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZQPUXXH","created_at":"2026-05-18T12:26:13.927090+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/QZQPUXXHYNC3S2IZAZXRMFDVTC","json":"https://pith.science/pith/QZQPUXXHYNC3S2IZAZXRMFDVTC.json","graph_json":"https://pith.science/api/pith-number/QZQPUXXHYNC3S2IZAZXRMFDVTC/graph.json","events_json":"https://pith.science/api/pith-number/QZQPUXXHYNC3S2IZAZXRMFDVTC/events.json","paper":"https://pith.science/paper/QZQPUXXH"},"agent_actions":{"view_html":"https://pith.science/pith/QZQPUXXHYNC3S2IZAZXRMFDVTC","download_json":"https://pith.science/pith/QZQPUXXHYNC3S2IZAZXRMFDVTC.json","view_paper":"https://pith.science/paper/QZQPUXXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1444&json=true","fetch_graph":"https://pith.science/api/pith-number/QZQPUXXHYNC3S2IZAZXRMFDVTC/graph.json","fetch_events":"https://pith.science/api/pith-number/QZQPUXXHYNC3S2IZAZXRMFDVTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZQPUXXHYNC3S2IZAZXRMFDVTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZQPUXXHYNC3S2IZAZXRMFDVTC/action/storage_attestation","attest_author":"https://pith.science/pith/QZQPUXXHYNC3S2IZAZXRMFDVTC/action/author_attestation","sign_citation":"https://pith.science/pith/QZQPUXXHYNC3S2IZAZXRMFDVTC/action/citation_signature","submit_replication":"https://pith.science/pith/QZQPUXXHYNC3S2IZAZXRMFDVTC/action/replication_record"}},"created_at":"2026-05-18T01:03:12.273369+00:00","updated_at":"2026-05-18T01:03:12.273369+00:00"}