{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KDD4WIUZ26LA34S5S2YGOO5IXN","short_pith_number":"pith:KDD4WIUZ","schema_version":"1.0","canonical_sha256":"50c7cb2299d7960df25d96b0673ba8bb5a987fac2d0c4e01332c1554e6437d9d","source":{"kind":"arxiv","id":"1602.01671","version":2},"attestation_state":"computed","paper":{"title":"Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Hao Hu, Xiaosong Chen, Youjin Deng","submitted_at":"2016-02-04T13:42:15Z","abstract_excerpt":"We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of the Berretti-Sokal algorithm, which is a variant of the Metropolis-Hastings method. The gained efficiency increases with the spatial dimension (D), from approximately $10$ times in 2D to approximately $40$ times in 5D. We simulate the SAW on a 5D hypercubic lattice with periodic boundary conditions, for a system with a linear size up to $L=128$, and confirm "},"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":"1602.01671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-02-04T13:42:15Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"c283a4113827aa6e7ef8ca0dcd6ee298bd1edffd14f7ece05f25e0ce381df3e4","abstract_canon_sha256":"89c807fa3dc4f75445ba764c47372ff50083a0cf755876f0e845504b2731c4e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:40.421671Z","signature_b64":"3Un63vJ2ccqa9mF7nFsofh4fXg3S83ESCIjd3rSDvpenb5zoAshXRRZ2xtDk0QkprDNIrG061dTHeL1EjjmeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50c7cb2299d7960df25d96b0673ba8bb5a987fac2d0c4e01332c1554e6437d9d","last_reissued_at":"2026-05-18T00:53:40.421195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:40.421195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Hao Hu, Xiaosong Chen, Youjin Deng","submitted_at":"2016-02-04T13:42:15Z","abstract_excerpt":"We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of the Berretti-Sokal algorithm, which is a variant of the Metropolis-Hastings method. The gained efficiency increases with the spatial dimension (D), from approximately $10$ times in 2D to approximately $40$ times in 5D. We simulate the SAW on a 5D hypercubic lattice with periodic boundary conditions, for a system with a linear size up to $L=128$, and confirm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01671","kind":"arxiv","version":2},"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":"1602.01671","created_at":"2026-05-18T00:53:40.421268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01671v2","created_at":"2026-05-18T00:53:40.421268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01671","created_at":"2026-05-18T00:53:40.421268+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDD4WIUZ26LA","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDD4WIUZ26LA34S5","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDD4WIUZ","created_at":"2026-05-18T12:30:25.849896+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/KDD4WIUZ26LA34S5S2YGOO5IXN","json":"https://pith.science/pith/KDD4WIUZ26LA34S5S2YGOO5IXN.json","graph_json":"https://pith.science/api/pith-number/KDD4WIUZ26LA34S5S2YGOO5IXN/graph.json","events_json":"https://pith.science/api/pith-number/KDD4WIUZ26LA34S5S2YGOO5IXN/events.json","paper":"https://pith.science/paper/KDD4WIUZ"},"agent_actions":{"view_html":"https://pith.science/pith/KDD4WIUZ26LA34S5S2YGOO5IXN","download_json":"https://pith.science/pith/KDD4WIUZ26LA34S5S2YGOO5IXN.json","view_paper":"https://pith.science/paper/KDD4WIUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01671&json=true","fetch_graph":"https://pith.science/api/pith-number/KDD4WIUZ26LA34S5S2YGOO5IXN/graph.json","fetch_events":"https://pith.science/api/pith-number/KDD4WIUZ26LA34S5S2YGOO5IXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDD4WIUZ26LA34S5S2YGOO5IXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDD4WIUZ26LA34S5S2YGOO5IXN/action/storage_attestation","attest_author":"https://pith.science/pith/KDD4WIUZ26LA34S5S2YGOO5IXN/action/author_attestation","sign_citation":"https://pith.science/pith/KDD4WIUZ26LA34S5S2YGOO5IXN/action/citation_signature","submit_replication":"https://pith.science/pith/KDD4WIUZ26LA34S5S2YGOO5IXN/action/replication_record"}},"created_at":"2026-05-18T00:53:40.421268+00:00","updated_at":"2026-05-18T00:53:40.421268+00:00"}