{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YZWLQHH5DJF35VGFCGJLTRWEEB","short_pith_number":"pith:YZWLQHH5","schema_version":"1.0","canonical_sha256":"c66cb81cfd1a4bbed4c51192b9c6c420499381b2971d3bed7597741823df62c5","source":{"kind":"arxiv","id":"1305.6981","version":3},"attestation_state":"computed","paper":{"title":"Linear-scaling and parallelizable algorithms for stochastic quantum chemistry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","physics.chem-ph"],"primary_cat":"physics.comp-ph","authors_text":"Ali Alavi, George H. Booth, Simon D. Smart","submitted_at":"2013-05-30T00:19:11Z","abstract_excerpt":"For many decades, quantum chemical method development has been dominated by algorithms which involve increasingly complex series of tensor contractions over one-electron orbital spaces. Procedures for their derivation and implementation have evolved to require the minimum amount of logic and rely heavily on computationally efficient library-based matrix algebra and optimized paging schemes. In this regard, the recent development of exact stochastic quantum chemical algorithms to reduce computational scaling and memory overhead requires a contrasting algorithmic philosophy, but one which when i"},"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":"1305.6981","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2013-05-30T00:19:11Z","cross_cats_sorted":["cond-mat.str-el","physics.chem-ph"],"title_canon_sha256":"190d0057dd8ac074538bcba3eeec5b8227ec84704398c24613cac299ac0b49a0","abstract_canon_sha256":"1a40d0b857a52991cf16948445da3365a095f7363fff8e165722a5eeb9b28d2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:47.557657Z","signature_b64":"hg5ZEa51evPQrEXyVF1jemL9cf6R/8FLojuie+3JuFMW4j+WqjNVD08YVgs9UTSFXYkDZoHRCIJl9kWsyBS4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c66cb81cfd1a4bbed4c51192b9c6c420499381b2971d3bed7597741823df62c5","last_reissued_at":"2026-05-18T02:40:47.557030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:47.557030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-scaling and parallelizable algorithms for stochastic quantum chemistry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","physics.chem-ph"],"primary_cat":"physics.comp-ph","authors_text":"Ali Alavi, George H. Booth, Simon D. Smart","submitted_at":"2013-05-30T00:19:11Z","abstract_excerpt":"For many decades, quantum chemical method development has been dominated by algorithms which involve increasingly complex series of tensor contractions over one-electron orbital spaces. Procedures for their derivation and implementation have evolved to require the minimum amount of logic and rely heavily on computationally efficient library-based matrix algebra and optimized paging schemes. In this regard, the recent development of exact stochastic quantum chemical algorithms to reduce computational scaling and memory overhead requires a contrasting algorithmic philosophy, but one which when i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6981","kind":"arxiv","version":3},"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":"1305.6981","created_at":"2026-05-18T02:40:47.557146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6981v3","created_at":"2026-05-18T02:40:47.557146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6981","created_at":"2026-05-18T02:40:47.557146+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZWLQHH5DJF3","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZWLQHH5DJF35VGF","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZWLQHH5","created_at":"2026-05-18T12:28:09.283467+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/YZWLQHH5DJF35VGFCGJLTRWEEB","json":"https://pith.science/pith/YZWLQHH5DJF35VGFCGJLTRWEEB.json","graph_json":"https://pith.science/api/pith-number/YZWLQHH5DJF35VGFCGJLTRWEEB/graph.json","events_json":"https://pith.science/api/pith-number/YZWLQHH5DJF35VGFCGJLTRWEEB/events.json","paper":"https://pith.science/paper/YZWLQHH5"},"agent_actions":{"view_html":"https://pith.science/pith/YZWLQHH5DJF35VGFCGJLTRWEEB","download_json":"https://pith.science/pith/YZWLQHH5DJF35VGFCGJLTRWEEB.json","view_paper":"https://pith.science/paper/YZWLQHH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6981&json=true","fetch_graph":"https://pith.science/api/pith-number/YZWLQHH5DJF35VGFCGJLTRWEEB/graph.json","fetch_events":"https://pith.science/api/pith-number/YZWLQHH5DJF35VGFCGJLTRWEEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZWLQHH5DJF35VGFCGJLTRWEEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZWLQHH5DJF35VGFCGJLTRWEEB/action/storage_attestation","attest_author":"https://pith.science/pith/YZWLQHH5DJF35VGFCGJLTRWEEB/action/author_attestation","sign_citation":"https://pith.science/pith/YZWLQHH5DJF35VGFCGJLTRWEEB/action/citation_signature","submit_replication":"https://pith.science/pith/YZWLQHH5DJF35VGFCGJLTRWEEB/action/replication_record"}},"created_at":"2026-05-18T02:40:47.557146+00:00","updated_at":"2026-05-18T02:40:47.557146+00:00"}