{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NRVL3CJCWEWEL5OOX3GDMCHDWX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f41c9a46c6db45b7ee5d4d65594470aceba966b88388b6f3e313cd06e00c9063","cross_cats_sorted":["cs.CC","math.CO","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-24T07:21:43Z","title_canon_sha256":"21f5a0f2959303d44feb09ae2680d3d0f3cb89ed54db8ee02fa9cf636cdb14f0"},"schema_version":"1.0","source":{"id":"2004.11568","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.11568","created_at":"2026-07-05T02:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"2004.11568v2","created_at":"2026-07-05T02:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.11568","created_at":"2026-07-05T02:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"NRVL3CJCWEWE","created_at":"2026-07-05T02:11:00Z"},{"alias_kind":"pith_short_16","alias_value":"NRVL3CJCWEWEL5OO","created_at":"2026-07-05T02:11:00Z"},{"alias_kind":"pith_short_8","alias_value":"NRVL3CJC","created_at":"2026-07-05T02:11:00Z"}],"graph_snapshots":[{"event_id":"sha256:4b53d279261bfe34d94a4c5690899d38ffcde40ca67df4bb35678cf60bedcab2","target":"graph","created_at":"2026-07-05T02:11:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.11568/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Ryan L. Mann, Tyler Helmuth","cross_cats":["cs.CC","math.CO","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-24T07:21:43Z","title":"Efficient Algorithms for Approximating Quantum Partition Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.11568","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d2341abd387c75df0bac46e33c5a6c5fcefd0da71f51d8bbabb30921a8784c79","target":"record","created_at":"2026-07-05T02:11:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f41c9a46c6db45b7ee5d4d65594470aceba966b88388b6f3e313cd06e00c9063","cross_cats_sorted":["cs.CC","math.CO","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-24T07:21:43Z","title_canon_sha256":"21f5a0f2959303d44feb09ae2680d3d0f3cb89ed54db8ee02fa9cf636cdb14f0"},"schema_version":"1.0","source":{"id":"2004.11568","kind":"arxiv","version":2}},"canonical_sha256":"6c6abd8922b12c45f5cebecc3608e3b5ed5021044c047bf5bb50e5cd9a97c66a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c6abd8922b12c45f5cebecc3608e3b5ed5021044c047bf5bb50e5cd9a97c66a","first_computed_at":"2026-07-05T02:11:00.375093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:11:00.375093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z3vCQhnRMlzzOl60TxY/R4uFcEklqBuxEboL2sxEoqqSSKw8gGAzAXe811kro575oif+kyMXJGW8GBU5//+KCw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:11:00.375522Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.11568","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2341abd387c75df0bac46e33c5a6c5fcefd0da71f51d8bbabb30921a8784c79","sha256:4b53d279261bfe34d94a4c5690899d38ffcde40ca67df4bb35678cf60bedcab2"],"state_sha256":"d5cf7adbdd47b1ce5d54839d9b814c3d36ea4c6c5e8218c7f742a06b4040dcf9"}