{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZLG6YSJGBRYHF3W2SJTTEUZ25N","short_pith_number":"pith:ZLG6YSJG","canonical_record":{"source":{"id":"2504.11120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-15T12:08:07Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fec6eb1fee51b7f787782db705ff148557d43fd73ad4f5aa175a523f4ca79fff","abstract_canon_sha256":"fd32d524450edbe60f61ef781526cecd04d8307ef1f99a5457e1b9d9ffdc4a97"},"schema_version":"1.0"},"canonical_sha256":"cacdec49260c7072eeda926732533aeb7c1deb8440464b5c342492e2383b72a2","source":{"kind":"arxiv","id":"2504.11120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.11120","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.11120v1","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11120","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZLG6YSJGBRYH","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"pith_short_16","alias_value":"ZLG6YSJGBRYHF3W2","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"pith_short_8","alias_value":"ZLG6YSJG","created_at":"2026-07-05T10:49:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZLG6YSJGBRYHF3W2SJTTEUZ25N","target":"record","payload":{"canonical_record":{"source":{"id":"2504.11120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-15T12:08:07Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fec6eb1fee51b7f787782db705ff148557d43fd73ad4f5aa175a523f4ca79fff","abstract_canon_sha256":"fd32d524450edbe60f61ef781526cecd04d8307ef1f99a5457e1b9d9ffdc4a97"},"schema_version":"1.0"},"canonical_sha256":"cacdec49260c7072eeda926732533aeb7c1deb8440464b5c342492e2383b72a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:29.401750Z","signature_b64":"1in1UcU1Qnx8e8U+9aQBVT8dmK49Co91Z+pZl9sOJRrjZwnGj+egGOSyRbXhrR9KAPG8i8rfEsxoK6ZiDn69Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cacdec49260c7072eeda926732533aeb7c1deb8440464b5c342492e2383b72a2","last_reissued_at":"2026-07-05T10:49:29.401267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:29.401267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.11120","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-05T10:49:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3MsAYVzIkqyOt/TxLgXMWHqGUKam8i5U9kWVy3ushaKFxnZM3pGbMhvzkggp7rwcp0DBz9az2ar7oOEeGGmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:11:10.861471Z"},"content_sha256":"fc97c80901cb67e8e138586e34c9fe564898f72ab1fc0b8f752743455c14ca6c","schema_version":"1.0","event_id":"sha256:fc97c80901cb67e8e138586e34c9fe564898f72ab1fc0b8f752743455c14ca6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZLG6YSJGBRYHF3W2SJTTEUZ25N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Lennart Sinjorgo, Renata Sotirov, Sander Gribling","submitted_at":"2025-04-15T12:08:07Z","abstract_excerpt":"We study polynomial-time approximation algorithms for the Quantum Max-Cut (QMC) problem. Given an edge-weighted graph $G$ on n vertices, the QMC problem is to determine the largest eigenvalue of a particular $2^n \\times 2^n$ matrix that corresponds to $G$. We provide a sharpened analysis of the currently best-known QMC approximation algorithm for general graphs. This algorithm achieves an approximation ratio of $0.599$, which our analysis improves to $0.603$. Additionally, we propose two new approximation algorithms for the QMC problem on triangle-free and bipartite graphs, that achieve approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11120","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/2504.11120/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-05T10:49:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bB90/P23c2TjVqKKIbRM270aHFTfKGTXI+EePzE52WdZWNSfWEyAbmRcEjYtz2TdETxKfojJm3Oeffps4CGhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:11:10.862010Z"},"content_sha256":"623d12c8969d0298185c804abb0c6ffd5d43b1aed2eb217d5422a4a99da394aa","schema_version":"1.0","event_id":"sha256:623d12c8969d0298185c804abb0c6ffd5d43b1aed2eb217d5422a4a99da394aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLG6YSJGBRYHF3W2SJTTEUZ25N/bundle.json","state_url":"https://pith.science/pith/ZLG6YSJGBRYHF3W2SJTTEUZ25N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLG6YSJGBRYHF3W2SJTTEUZ25N/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-22T19:11:10Z","links":{"resolver":"https://pith.science/pith/ZLG6YSJGBRYHF3W2SJTTEUZ25N","bundle":"https://pith.science/pith/ZLG6YSJGBRYHF3W2SJTTEUZ25N/bundle.json","state":"https://pith.science/pith/ZLG6YSJGBRYHF3W2SJTTEUZ25N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLG6YSJGBRYHF3W2SJTTEUZ25N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZLG6YSJGBRYHF3W2SJTTEUZ25N","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":"fd32d524450edbe60f61ef781526cecd04d8307ef1f99a5457e1b9d9ffdc4a97","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-15T12:08:07Z","title_canon_sha256":"fec6eb1fee51b7f787782db705ff148557d43fd73ad4f5aa175a523f4ca79fff"},"schema_version":"1.0","source":{"id":"2504.11120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.11120","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.11120v1","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11120","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZLG6YSJGBRYH","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"pith_short_16","alias_value":"ZLG6YSJGBRYHF3W2","created_at":"2026-07-05T10:49:29Z"},{"alias_kind":"pith_short_8","alias_value":"ZLG6YSJG","created_at":"2026-07-05T10:49:29Z"}],"graph_snapshots":[{"event_id":"sha256:623d12c8969d0298185c804abb0c6ffd5d43b1aed2eb217d5422a4a99da394aa","target":"graph","created_at":"2026-07-05T10:49:29Z","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/2504.11120/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study polynomial-time approximation algorithms for the Quantum Max-Cut (QMC) problem. Given an edge-weighted graph $G$ on n vertices, the QMC problem is to determine the largest eigenvalue of a particular $2^n \\times 2^n$ matrix that corresponds to $G$. We provide a sharpened analysis of the currently best-known QMC approximation algorithm for general graphs. This algorithm achieves an approximation ratio of $0.599$, which our analysis improves to $0.603$. Additionally, we propose two new approximation algorithms for the QMC problem on triangle-free and bipartite graphs, that achieve approx","authors_text":"Lennart Sinjorgo, Renata Sotirov, Sander Gribling","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-15T12:08:07Z","title":"Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11120","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:fc97c80901cb67e8e138586e34c9fe564898f72ab1fc0b8f752743455c14ca6c","target":"record","created_at":"2026-07-05T10:49:29Z","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":"fd32d524450edbe60f61ef781526cecd04d8307ef1f99a5457e1b9d9ffdc4a97","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-15T12:08:07Z","title_canon_sha256":"fec6eb1fee51b7f787782db705ff148557d43fd73ad4f5aa175a523f4ca79fff"},"schema_version":"1.0","source":{"id":"2504.11120","kind":"arxiv","version":1}},"canonical_sha256":"cacdec49260c7072eeda926732533aeb7c1deb8440464b5c342492e2383b72a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cacdec49260c7072eeda926732533aeb7c1deb8440464b5c342492e2383b72a2","first_computed_at":"2026-07-05T10:49:29.401267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:29.401267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1in1UcU1Qnx8e8U+9aQBVT8dmK49Co91Z+pZl9sOJRrjZwnGj+egGOSyRbXhrR9KAPG8i8rfEsxoK6ZiDn69Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:29.401750Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.11120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc97c80901cb67e8e138586e34c9fe564898f72ab1fc0b8f752743455c14ca6c","sha256:623d12c8969d0298185c804abb0c6ffd5d43b1aed2eb217d5422a4a99da394aa"],"state_sha256":"a3a49c029c10abe57623e2c27c417f672a5240bfeafc23ab0beaea75968ca54d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hu1Qz8OO87TaF6Skg3ATvWQnvNiX0IybHwNmj9N+aUvqI1+hUy8yTUfChda7PT2dSa63QMyhmzzly/+oNePHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T19:11:10.867657Z","bundle_sha256":"68b9b92bf9d6225773f4f964c37ed3cf157b313517bf015e58500244cb88addc"}}