{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MC43TTDMSXAV3TN6MNNHZD3SPD","short_pith_number":"pith:MC43TTDM","schema_version":"1.0","canonical_sha256":"60b9b9cc6c95c15dcdbe635a7c8f7278c753228353b704199e1e37a8be574b6f","source":{"kind":"arxiv","id":"2003.14394","version":1},"attestation_state":"computed","paper":{"title":"Beyond product state approximations for a quantum analogue of Max Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, David Gosset, Karen Morenz","submitted_at":"2020-03-31T17:41:13Z","abstract_excerpt":"We consider a computational problem where the goal is to approximate the maximum eigenvalue of a two-local Hamiltonian that describes Heisenberg interactions between qubits located at the vertices of a graph. Previous work has shed light on this problem's approximability by product states. For any instance of this problem the maximum energy attained by a product state is lower bounded by the Max Cut of the graph and upper bounded by the standard Goemans-Williamson semidefinite programming relaxation of it. Gharibian and Parekh described an efficient classical approximation algorithm for this p"},"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":"2003.14394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-31T17:41:13Z","cross_cats_sorted":[],"title_canon_sha256":"cf7f943b799f81a881a2e419a81f599cf45cb436a9909f6023ce50db5e4e16ee","abstract_canon_sha256":"55c8fe8edf0f65f6314587323c1a2297dc040b37da95e9a3307dd70934806749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:05.058941Z","signature_b64":"yCzrH8dRGK/cHMj0I9i6MMiAb2cVEtG7jvXvzrQQ8AedugV3ao7uBPfWBlGbWXhomJSbgVjENB2jIfmr6WxhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60b9b9cc6c95c15dcdbe635a7c8f7278c753228353b704199e1e37a8be574b6f","last_reissued_at":"2026-07-05T01:09:05.058524Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:05.058524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond product state approximations for a quantum analogue of Max Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, David Gosset, Karen Morenz","submitted_at":"2020-03-31T17:41:13Z","abstract_excerpt":"We consider a computational problem where the goal is to approximate the maximum eigenvalue of a two-local Hamiltonian that describes Heisenberg interactions between qubits located at the vertices of a graph. Previous work has shed light on this problem's approximability by product states. For any instance of this problem the maximum energy attained by a product state is lower bounded by the Max Cut of the graph and upper bounded by the standard Goemans-Williamson semidefinite programming relaxation of it. Gharibian and Parekh described an efficient classical approximation algorithm for this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.14394","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.14394/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":"2003.14394","created_at":"2026-07-05T01:09:05.058577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.14394v1","created_at":"2026-07-05T01:09:05.058577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.14394","created_at":"2026-07-05T01:09:05.058577+00:00"},{"alias_kind":"pith_short_12","alias_value":"MC43TTDMSXAV","created_at":"2026-07-05T01:09:05.058577+00:00"},{"alias_kind":"pith_short_16","alias_value":"MC43TTDMSXAV3TN6","created_at":"2026-07-05T01:09:05.058577+00:00"},{"alias_kind":"pith_short_8","alias_value":"MC43TTDM","created_at":"2026-07-05T01:09:05.058577+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09728","citing_title":"Quantum Cut Sparsifiers","ref_index":102,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04940","citing_title":"Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02211","citing_title":"Many Hamiltonians Are Sparsifiable","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD","json":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD.json","graph_json":"https://pith.science/api/pith-number/MC43TTDMSXAV3TN6MNNHZD3SPD/graph.json","events_json":"https://pith.science/api/pith-number/MC43TTDMSXAV3TN6MNNHZD3SPD/events.json","paper":"https://pith.science/paper/MC43TTDM"},"agent_actions":{"view_html":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD","download_json":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD.json","view_paper":"https://pith.science/paper/MC43TTDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.14394&json=true","fetch_graph":"https://pith.science/api/pith-number/MC43TTDMSXAV3TN6MNNHZD3SPD/graph.json","fetch_events":"https://pith.science/api/pith-number/MC43TTDMSXAV3TN6MNNHZD3SPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD/action/storage_attestation","attest_author":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD/action/author_attestation","sign_citation":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD/action/citation_signature","submit_replication":"https://pith.science/pith/MC43TTDMSXAV3TN6MNNHZD3SPD/action/replication_record"}},"created_at":"2026-07-05T01:09:05.058577+00:00","updated_at":"2026-07-05T01:09:05.058577+00:00"}