{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4RFQJBWCRPKZTP5SEANVU5UMOU","short_pith_number":"pith:4RFQJBWC","schema_version":"1.0","canonical_sha256":"e44b0486c28bd599bfb2201b5a768c7539a1d495178475c174a91788892b17e7","source":{"kind":"arxiv","id":"1612.05602","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-time classical simulation of quantum ferromagnets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","cs.CC"],"primary_cat":"quant-ph","authors_text":"David Gosset, Sergey Bravyi","submitted_at":"2016-12-16T19:23:49Z","abstract_excerpt":"We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error E using a classical randomized algorithm with runtime polynomial in 1/E, system size, and inverse temperature. As a consequence we obtain a polynomial time algorithm which approximates the free energy or ground energy to a given additive error. We first show how to approximate the pa"},"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":"1612.05602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-16T19:23:49Z","cross_cats_sorted":["cond-mat.str-el","cs.CC"],"title_canon_sha256":"84f10f7a15ab426f0feea0d4e95a6597674b6e6e8fe103caf154b3bb8f8f39e8","abstract_canon_sha256":"94b0fe1993f569d6ced11cb117c6aaaa9111f4496d7f1f8bf0fea5139fe0595e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:24.167280Z","signature_b64":"vKypxNG2jeNL/MqJsusRiaTB+bqxRJhI6y89GUx7FTEWg9tfvfxbrVIPENP92oAczUfXI9Y6oEzjTjEF7a+hCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e44b0486c28bd599bfb2201b5a768c7539a1d495178475c174a91788892b17e7","last_reissued_at":"2026-05-18T00:35:24.166677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:24.166677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time classical simulation of quantum ferromagnets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","cs.CC"],"primary_cat":"quant-ph","authors_text":"David Gosset, Sergey Bravyi","submitted_at":"2016-12-16T19:23:49Z","abstract_excerpt":"We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error E using a classical randomized algorithm with runtime polynomial in 1/E, system size, and inverse temperature. As a consequence we obtain a polynomial time algorithm which approximates the free energy or ground energy to a given additive error. We first show how to approximate the pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05602","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":"1612.05602","created_at":"2026-05-18T00:35:24.166763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05602v1","created_at":"2026-05-18T00:35:24.166763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05602","created_at":"2026-05-18T00:35:24.166763+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RFQJBWCRPKZ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RFQJBWCRPKZTP5S","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RFQJBWC","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.14244","citing_title":"The Complexity of Local Stoquastic Hamiltonians on 2D Lattices","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU","json":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU.json","graph_json":"https://pith.science/api/pith-number/4RFQJBWCRPKZTP5SEANVU5UMOU/graph.json","events_json":"https://pith.science/api/pith-number/4RFQJBWCRPKZTP5SEANVU5UMOU/events.json","paper":"https://pith.science/paper/4RFQJBWC"},"agent_actions":{"view_html":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU","download_json":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU.json","view_paper":"https://pith.science/paper/4RFQJBWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05602&json=true","fetch_graph":"https://pith.science/api/pith-number/4RFQJBWCRPKZTP5SEANVU5UMOU/graph.json","fetch_events":"https://pith.science/api/pith-number/4RFQJBWCRPKZTP5SEANVU5UMOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU/action/storage_attestation","attest_author":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU/action/author_attestation","sign_citation":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU/action/citation_signature","submit_replication":"https://pith.science/pith/4RFQJBWCRPKZTP5SEANVU5UMOU/action/replication_record"}},"created_at":"2026-05-18T00:35:24.166763+00:00","updated_at":"2026-05-18T00:35:24.166763+00:00"}