{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NRVL3CJCWEWEL5OOX3GDMCHDWX","short_pith_number":"pith:NRVL3CJC","schema_version":"1.0","canonical_sha256":"6c6abd8922b12c45f5cebecc3608e3b5ed5021044c047bf5bb50e5cd9a97c66a","source":{"kind":"arxiv","id":"2004.11568","version":2},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Approximating Quantum Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","quant-ph"],"primary_cat":"cs.DS","authors_text":"Ryan L. Mann, Tyler Helmuth","submitted_at":"2020-04-24T07:21:43Z","abstract_excerpt":"We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Neto\\v{c}n\\'y and Redig and the cluster expansion approach to designing algorithms due to Helmuth, Perkins, and Regts. Similar results have previously been obtained by related methods, and our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs."},"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":"2004.11568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-24T07:21:43Z","cross_cats_sorted":["cs.CC","math.CO","quant-ph"],"title_canon_sha256":"21f5a0f2959303d44feb09ae2680d3d0f3cb89ed54db8ee02fa9cf636cdb14f0","abstract_canon_sha256":"f41c9a46c6db45b7ee5d4d65594470aceba966b88388b6f3e313cd06e00c9063"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:11:00.375522Z","signature_b64":"Z3vCQhnRMlzzOl60TxY/R4uFcEklqBuxEboL2sxEoqqSSKw8gGAzAXe811kro575oif+kyMXJGW8GBU5//+KCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c6abd8922b12c45f5cebecc3608e3b5ed5021044c047bf5bb50e5cd9a97c66a","last_reissued_at":"2026-07-05T02:11:00.375093Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:11:00.375093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Approximating Quantum Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","quant-ph"],"primary_cat":"cs.DS","authors_text":"Ryan L. Mann, Tyler Helmuth","submitted_at":"2020-04-24T07:21:43Z","abstract_excerpt":"We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Neto\\v{c}n\\'y and Redig and the cluster expansion approach to designing algorithms due to Helmuth, Perkins, and Regts. Similar results have previously been obtained by related methods, and our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.11568","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.11568/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.11568","created_at":"2026-07-05T02:11:00.375149+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.11568v2","created_at":"2026-07-05T02:11:00.375149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.11568","created_at":"2026-07-05T02:11:00.375149+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRVL3CJCWEWE","created_at":"2026-07-05T02:11:00.375149+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRVL3CJCWEWEL5OO","created_at":"2026-07-05T02:11:00.375149+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRVL3CJC","created_at":"2026-07-05T02:11:00.375149+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/NRVL3CJCWEWEL5OOX3GDMCHDWX","json":"https://pith.science/pith/NRVL3CJCWEWEL5OOX3GDMCHDWX.json","graph_json":"https://pith.science/api/pith-number/NRVL3CJCWEWEL5OOX3GDMCHDWX/graph.json","events_json":"https://pith.science/api/pith-number/NRVL3CJCWEWEL5OOX3GDMCHDWX/events.json","paper":"https://pith.science/paper/NRVL3CJC"},"agent_actions":{"view_html":"https://pith.science/pith/NRVL3CJCWEWEL5OOX3GDMCHDWX","download_json":"https://pith.science/pith/NRVL3CJCWEWEL5OOX3GDMCHDWX.json","view_paper":"https://pith.science/paper/NRVL3CJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.11568&json=true","fetch_graph":"https://pith.science/api/pith-number/NRVL3CJCWEWEL5OOX3GDMCHDWX/graph.json","fetch_events":"https://pith.science/api/pith-number/NRVL3CJCWEWEL5OOX3GDMCHDWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRVL3CJCWEWEL5OOX3GDMCHDWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRVL3CJCWEWEL5OOX3GDMCHDWX/action/storage_attestation","attest_author":"https://pith.science/pith/NRVL3CJCWEWEL5OOX3GDMCHDWX/action/author_attestation","sign_citation":"https://pith.science/pith/NRVL3CJCWEWEL5OOX3GDMCHDWX/action/citation_signature","submit_replication":"https://pith.science/pith/NRVL3CJCWEWEL5OOX3GDMCHDWX/action/replication_record"}},"created_at":"2026-07-05T02:11:00.375149+00:00","updated_at":"2026-07-05T02:11:00.375149+00:00"}