{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EL3IL3PAO24A22JBW6EH5G2TLR","short_pith_number":"pith:EL3IL3PA","canonical_record":{"source":{"id":"2602.20376","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-23T21:29:47Z","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"title_canon_sha256":"d9c464ba78e355080098e8a733250d2a037c5ffaf7e50651270a990082721757","abstract_canon_sha256":"151371a6b09259d031671e202fb209da4e8fdaecdcffee7a1b992514a8d79d6f"},"schema_version":"1.0"},"canonical_sha256":"22f685ede076b80d6921b7887e9b535c6c8cc88fe308dab21c6740abdbe0b26f","source":{"kind":"arxiv","id":"2602.20376","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.20376","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"2602.20376v3","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.20376","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"EL3IL3PAO24A","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"pith_short_16","alias_value":"EL3IL3PAO24A22JB","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"pith_short_8","alias_value":"EL3IL3PA","created_at":"2026-07-21T01:20:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EL3IL3PAO24A22JBW6EH5G2TLR","target":"record","payload":{"canonical_record":{"source":{"id":"2602.20376","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-23T21:29:47Z","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"title_canon_sha256":"d9c464ba78e355080098e8a733250d2a037c5ffaf7e50651270a990082721757","abstract_canon_sha256":"151371a6b09259d031671e202fb209da4e8fdaecdcffee7a1b992514a8d79d6f"},"schema_version":"1.0"},"canonical_sha256":"22f685ede076b80d6921b7887e9b535c6c8cc88fe308dab21c6740abdbe0b26f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:20:44.445909Z","signature_b64":"97arMYivE1qcJRsBt7rcye2cFbPZh5TbYnn6b3qDzWi8dIyNIXy7AjHYgb8dC4a7dycp4+AJBM8f8ses3W4MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22f685ede076b80d6921b7887e9b535c6c8cc88fe308dab21c6740abdbe0b26f","last_reissued_at":"2026-07-21T01:20:44.444882Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:20:44.444882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.20376","source_version":3,"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-21T01:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anukgksLMCitRz3zcn22UnWQ9WwwCZtGb7z798Md0bEDmi3IfvwSql1cQIGLvxxVO3wz+nNYufKtbyR6ASQkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:04:53.397118Z"},"content_sha256":"47315233c67fffc7aba569ccb3e32f8802aed1804773078a139ceab1d241335f","schema_version":"1.0","event_id":"sha256:47315233c67fffc7aba569ccb3e32f8802aed1804773078a139ceab1d241335f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EL3IL3PAO24A22JBW6EH5G2TLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Low-rank structure in the Max-3-Cut objective guarantees that a set of O(n^{2r-1}) candidates contains the exact maximizer.","cross_cats":["cs.LG","math.OC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Anastasios Kyrillidis, Barbara Su, Fangshuo Liao, Jianqiang Li, Ria Stevens, Thanasis Hadjidimoulas","submitted_at":"2026-02-23T21:29:47Z","abstract_excerpt":"We study the problem of maximizing a complex-valued quadratic form over the $K^{\\text{th}}$ roots of unity. We show that when the objective matrix $\\mathbf{Q}^\\star \\in \\mathbb{C}^{n \\times n}$ of the quadratic has rank $r$, the global maximizer belongs to a candidate set of size $O(rn^{2r-1})$. This set can be constructed deterministically in $O(rn^{2r+1})$ time by enumerating the vertices of a hyperplane arrangement in $\\mathbb{R}^{2r}.$ The algorithm is embarrassingly parallel; with~$P$ processors, the time complexity drops to $O(r n^{2r+1}/P)$. For approximately low-rank settings, where th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that this candidate set is guaranteed to include the exact maximizer when K=3 (corresponding to Max-3-Cut) and the objective is low-rank, and provide approximation guarantees when the objective is a perturbation of a low-rank matrix.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The objective matrix either has low rank or admits a useful low-rank approximation; the complex-valued quadratic formulation exactly captures the Max-3-Cut objective without additional modeling error.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An enumeration algorithm over O(n^{2r-1}) candidates guarantees the exact maximizer for low-rank Max-3-Cut and approximation bounds for near-low-rank objectives.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Low-rank structure in the Max-3-Cut objective guarantees that a set of O(n^{2r-1}) candidates contains the exact maximizer.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"499c945e9e2c5b2e5c3f95c5b7e1536baad725db20376c661b343b8039ffefd9"},"source":{"id":"2602.20376","kind":"arxiv","version":3},"verdict":{"id":"f96dc503-4bfc-47ad-b648-1e775a19bd0d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T19:41:43.121613Z","strongest_claim":"We prove that this candidate set is guaranteed to include the exact maximizer when K=3 (corresponding to Max-3-Cut) and the objective is low-rank, and provide approximation guarantees when the objective is a perturbation of a low-rank matrix.","one_line_summary":"An enumeration algorithm over O(n^{2r-1}) candidates guarantees the exact maximizer for low-rank Max-3-Cut and approximation bounds for near-low-rank objectives.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The objective matrix either has low rank or admits a useful low-rank approximation; the complex-valued quadratic formulation exactly captures the Max-3-Cut objective without additional modeling error.","pith_extraction_headline":"Low-rank structure in the Max-3-Cut objective guarantees that a set of O(n^{2r-1}) candidates contains the exact maximizer."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.20376/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":2,"snapshot_sha256":"33efeb2c2e160af664ab4958bdf11a27de527957fd5f0ba755c53d1157abb013"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"f96dc503-4bfc-47ad-b648-1e775a19bd0d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-21T01:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPqXwwWyFSQtzxfnfjr1yZgVwgpjP17OJZon7WyMhTGW/JvUC/u5Ts+/qHS31ME1ufup1LWP9twbz3npWT6jBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:04:53.397741Z"},"content_sha256":"f408a11c001774dd8cc44dfa55442daa4330bf669d9282d73401abd8a07f556d","schema_version":"1.0","event_id":"sha256:f408a11c001774dd8cc44dfa55442daa4330bf669d9282d73401abd8a07f556d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EL3IL3PAO24A22JBW6EH5G2TLR/bundle.json","state_url":"https://pith.science/pith/EL3IL3PAO24A22JBW6EH5G2TLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EL3IL3PAO24A22JBW6EH5G2TLR/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-04T12:04:53Z","links":{"resolver":"https://pith.science/pith/EL3IL3PAO24A22JBW6EH5G2TLR","bundle":"https://pith.science/pith/EL3IL3PAO24A22JBW6EH5G2TLR/bundle.json","state":"https://pith.science/pith/EL3IL3PAO24A22JBW6EH5G2TLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EL3IL3PAO24A22JBW6EH5G2TLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EL3IL3PAO24A22JBW6EH5G2TLR","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":"151371a6b09259d031671e202fb209da4e8fdaecdcffee7a1b992514a8d79d6f","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-23T21:29:47Z","title_canon_sha256":"d9c464ba78e355080098e8a733250d2a037c5ffaf7e50651270a990082721757"},"schema_version":"1.0","source":{"id":"2602.20376","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.20376","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"2602.20376v3","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.20376","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"EL3IL3PAO24A","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"pith_short_16","alias_value":"EL3IL3PAO24A22JB","created_at":"2026-07-21T01:20:44Z"},{"alias_kind":"pith_short_8","alias_value":"EL3IL3PA","created_at":"2026-07-21T01:20:44Z"}],"graph_snapshots":[{"event_id":"sha256:f408a11c001774dd8cc44dfa55442daa4330bf669d9282d73401abd8a07f556d","target":"graph","created_at":"2026-07-21T01:20:44Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that this candidate set is guaranteed to include the exact maximizer when K=3 (corresponding to Max-3-Cut) and the objective is low-rank, and provide approximation guarantees when the objective is a perturbation of a low-rank matrix."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The objective matrix either has low rank or admits a useful low-rank approximation; the complex-valued quadratic formulation exactly captures the Max-3-Cut objective without additional modeling error."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An enumeration algorithm over O(n^{2r-1}) candidates guarantees the exact maximizer for low-rank Max-3-Cut and approximation bounds for near-low-rank objectives."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Low-rank structure in the Max-3-Cut objective guarantees that a set of O(n^{2r-1}) candidates contains the exact maximizer."}],"snapshot_sha256":"499c945e9e2c5b2e5c3f95c5b7e1536baad725db20376c661b343b8039ffefd9"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"33efeb2c2e160af664ab4958bdf11a27de527957fd5f0ba755c53d1157abb013"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.20376/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of maximizing a complex-valued quadratic form over the $K^{\\text{th}}$ roots of unity. We show that when the objective matrix $\\mathbf{Q}^\\star \\in \\mathbb{C}^{n \\times n}$ of the quadratic has rank $r$, the global maximizer belongs to a candidate set of size $O(rn^{2r-1})$. This set can be constructed deterministically in $O(rn^{2r+1})$ time by enumerating the vertices of a hyperplane arrangement in $\\mathbb{R}^{2r}.$ The algorithm is embarrassingly parallel; with~$P$ processors, the time complexity drops to $O(r n^{2r+1}/P)$. For approximately low-rank settings, where th","authors_text":"Anastasios Kyrillidis, Barbara Su, Fangshuo Liao, Jianqiang Li, Ria Stevens, Thanasis Hadjidimoulas","cross_cats":["cs.LG","math.OC","quant-ph"],"headline":"Low-rank structure in the Max-3-Cut objective guarantees that a set of O(n^{2r-1}) candidates contains the exact maximizer.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-23T21:29:47Z","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.20376","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-15T19:41:43.121613Z","id":"f96dc503-4bfc-47ad-b648-1e775a19bd0d","model_set":{"reader":"grok-4.3"},"one_line_summary":"An enumeration algorithm over O(n^{2r-1}) candidates guarantees the exact maximizer for low-rank Max-3-Cut and approximation bounds for near-low-rank objectives.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Low-rank structure in the Max-3-Cut objective guarantees that a set of O(n^{2r-1}) candidates contains the exact maximizer.","strongest_claim":"We prove that this candidate set is guaranteed to include the exact maximizer when K=3 (corresponding to Max-3-Cut) and the objective is low-rank, and provide approximation guarantees when the objective is a perturbation of a low-rank matrix.","weakest_assumption":"The objective matrix either has low rank or admits a useful low-rank approximation; the complex-valued quadratic formulation exactly captures the Max-3-Cut objective without additional modeling error."}},"verdict_id":"f96dc503-4bfc-47ad-b648-1e775a19bd0d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:47315233c67fffc7aba569ccb3e32f8802aed1804773078a139ceab1d241335f","target":"record","created_at":"2026-07-21T01:20:44Z","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":"151371a6b09259d031671e202fb209da4e8fdaecdcffee7a1b992514a8d79d6f","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-23T21:29:47Z","title_canon_sha256":"d9c464ba78e355080098e8a733250d2a037c5ffaf7e50651270a990082721757"},"schema_version":"1.0","source":{"id":"2602.20376","kind":"arxiv","version":3}},"canonical_sha256":"22f685ede076b80d6921b7887e9b535c6c8cc88fe308dab21c6740abdbe0b26f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22f685ede076b80d6921b7887e9b535c6c8cc88fe308dab21c6740abdbe0b26f","first_computed_at":"2026-07-21T01:20:44.444882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:20:44.444882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"97arMYivE1qcJRsBt7rcye2cFbPZh5TbYnn6b3qDzWi8dIyNIXy7AjHYgb8dC4a7dycp4+AJBM8f8ses3W4MAg==","signature_status":"signed_v1","signed_at":"2026-07-21T01:20:44.445909Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.20376","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47315233c67fffc7aba569ccb3e32f8802aed1804773078a139ceab1d241335f","sha256:f408a11c001774dd8cc44dfa55442daa4330bf669d9282d73401abd8a07f556d"],"state_sha256":"6c907bf97bc1199c2377b795a5fa49df152147a2dfda2c5981dd67f22388565b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqGlu6KcobI/ouHyWA7Bl3yMbb0rNCSnG1jQuvO3sbNDrpwWotMujcGwuEzBDBAGWrfEtjGaik3Gp4PgbLsFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:04:53.401324Z","bundle_sha256":"b1f2f02bdef500582338a8f7ba2fb4f9c28c4ed352bf6cb280be503717cb0ba3"}}