{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:A5WPDCNHDRW7HAE7D4N7IFCD7O","short_pith_number":"pith:A5WPDCNH","canonical_record":{"source":{"id":"1909.08846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-19T08:15:48Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"938ed5ff89714c1e82e5f3f9f6ee3003a9d6108f5964550856db691aba6bd3e2","abstract_canon_sha256":"59cb603de79caa86901e8ce2263b9bc93a04d2edf353b1bf4f0f900636739fc8"},"schema_version":"1.0"},"canonical_sha256":"076cf189a71c6df3809f1f1bf41443fbb8d368bd72a13c2bbd563660c2d02ee5","source":{"kind":"arxiv","id":"1909.08846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.08846","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1909.08846v1","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.08846","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"A5WPDCNHDRW7","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"A5WPDCNHDRW7HAE7","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"A5WPDCNH","created_at":"2026-07-05T00:05:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:A5WPDCNHDRW7HAE7D4N7IFCD7O","target":"record","payload":{"canonical_record":{"source":{"id":"1909.08846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-19T08:15:48Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"938ed5ff89714c1e82e5f3f9f6ee3003a9d6108f5964550856db691aba6bd3e2","abstract_canon_sha256":"59cb603de79caa86901e8ce2263b9bc93a04d2edf353b1bf4f0f900636739fc8"},"schema_version":"1.0"},"canonical_sha256":"076cf189a71c6df3809f1f1bf41443fbb8d368bd72a13c2bbd563660c2d02ee5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:05:38.292601Z","signature_b64":"wvOS8dvm9yEU4w3Mzyffn9PAPJyO8E2px1VEW1+SogUcCPoKCN4PenUlDGrpcBF/wCM2s4i3kOB7iXdfwP7tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"076cf189a71c6df3809f1f1bf41443fbb8d368bd72a13c2bbd563660c2d02ee5","last_reissued_at":"2026-07-05T00:05:38.292130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:05:38.292130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.08846","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AK6+HN0BMp/qoBtJQy0t+TKlNCAguEdocJS3u5vgm3aBAS6LPk7+9CWtrMU4XjKSJQ64cvY+xHikzFhiq4mUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:32:22.541779Z"},"content_sha256":"e7d5b66c6a92ecf16046c972aab7bdcec61d3537a8105b55e865f1ae2b0dfe39","schema_version":"1.0","event_id":"sha256:e7d5b66c6a92ecf16046c972aab7bdcec61d3537a8105b55e865f1ae2b0dfe39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:A5WPDCNHDRW7HAE7D4N7IFCD7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Ojas Parekh, Sevag Gharibian","submitted_at":"2019-09-19T08:15:48Z","abstract_excerpt":"Approximation algorithms for constraint satisfaction problems (CSPs) are a central direction of study in theoretical computer science. In this work, we study classical product state approximation algorithms for a physically motivated quantum generalization of Max-Cut, known as the quantum Heisenberg model. This model is notoriously difficult to solve exactly, even on bipartite graphs, in stark contrast to the classical setting of Max-Cut. Here we show, for any interaction graph, how to classically and efficiently obtain approximation ratios 0.649 (anti-ferromagnetic XY model) and 0.498 (anti-f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.08846","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/1909.08846/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXowuJFs/pnXXPiHE0gLHnJxHcvaICZHXjCOzIfiSuS5LYQxmaJmDoE0k5D70QOW7Mdn36LcbGsse46ev8V8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:32:22.542452Z"},"content_sha256":"b903bcb21f6c01e3c977627de95d5717bbe68c004b09c180bc01ced903ace43e","schema_version":"1.0","event_id":"sha256:b903bcb21f6c01e3c977627de95d5717bbe68c004b09c180bc01ced903ace43e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5WPDCNHDRW7HAE7D4N7IFCD7O/bundle.json","state_url":"https://pith.science/pith/A5WPDCNHDRW7HAE7D4N7IFCD7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5WPDCNHDRW7HAE7D4N7IFCD7O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T03:32:22Z","links":{"resolver":"https://pith.science/pith/A5WPDCNHDRW7HAE7D4N7IFCD7O","bundle":"https://pith.science/pith/A5WPDCNHDRW7HAE7D4N7IFCD7O/bundle.json","state":"https://pith.science/pith/A5WPDCNHDRW7HAE7D4N7IFCD7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5WPDCNHDRW7HAE7D4N7IFCD7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A5WPDCNHDRW7HAE7D4N7IFCD7O","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":"59cb603de79caa86901e8ce2263b9bc93a04d2edf353b1bf4f0f900636739fc8","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-19T08:15:48Z","title_canon_sha256":"938ed5ff89714c1e82e5f3f9f6ee3003a9d6108f5964550856db691aba6bd3e2"},"schema_version":"1.0","source":{"id":"1909.08846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.08846","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1909.08846v1","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.08846","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"A5WPDCNHDRW7","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"A5WPDCNHDRW7HAE7","created_at":"2026-07-05T00:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"A5WPDCNH","created_at":"2026-07-05T00:05:38Z"}],"graph_snapshots":[{"event_id":"sha256:b903bcb21f6c01e3c977627de95d5717bbe68c004b09c180bc01ced903ace43e","target":"graph","created_at":"2026-07-05T00:05:38Z","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/1909.08846/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximation algorithms for constraint satisfaction problems (CSPs) are a central direction of study in theoretical computer science. In this work, we study classical product state approximation algorithms for a physically motivated quantum generalization of Max-Cut, known as the quantum Heisenberg model. This model is notoriously difficult to solve exactly, even on bipartite graphs, in stark contrast to the classical setting of Max-Cut. Here we show, for any interaction graph, how to classically and efficiently obtain approximation ratios 0.649 (anti-ferromagnetic XY model) and 0.498 (anti-f","authors_text":"Ojas Parekh, Sevag Gharibian","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-19T08:15:48Z","title":"Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.08846","kind":"arxiv","version":1},"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:e7d5b66c6a92ecf16046c972aab7bdcec61d3537a8105b55e865f1ae2b0dfe39","target":"record","created_at":"2026-07-05T00:05:38Z","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":"59cb603de79caa86901e8ce2263b9bc93a04d2edf353b1bf4f0f900636739fc8","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-19T08:15:48Z","title_canon_sha256":"938ed5ff89714c1e82e5f3f9f6ee3003a9d6108f5964550856db691aba6bd3e2"},"schema_version":"1.0","source":{"id":"1909.08846","kind":"arxiv","version":1}},"canonical_sha256":"076cf189a71c6df3809f1f1bf41443fbb8d368bd72a13c2bbd563660c2d02ee5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"076cf189a71c6df3809f1f1bf41443fbb8d368bd72a13c2bbd563660c2d02ee5","first_computed_at":"2026-07-05T00:05:38.292130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:05:38.292130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wvOS8dvm9yEU4w3Mzyffn9PAPJyO8E2px1VEW1+SogUcCPoKCN4PenUlDGrpcBF/wCM2s4i3kOB7iXdfwP7tCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:05:38.292601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.08846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7d5b66c6a92ecf16046c972aab7bdcec61d3537a8105b55e865f1ae2b0dfe39","sha256:b903bcb21f6c01e3c977627de95d5717bbe68c004b09c180bc01ced903ace43e"],"state_sha256":"f301b4d7240871c4425cda7bb95e8d692b65327cfdef228a0dd88847c9baffc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tg+lQZjOHgyof15ji+At755AQNUt5mBuGlAqES+gKQjqJKbVrAW82TdR52jOgq04QxwvHtLhzvWACZv7fZxXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:32:22.547605Z","bundle_sha256":"accc42bcc1d2538dbdafb201d4b6169e16274cdfb25a29675842a157df223322"}}