{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5A7WTTHPXYFOFC3ELPGMBZDE7N","short_pith_number":"pith:5A7WTTHP","canonical_record":{"source":{"id":"2508.02006","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-04T02:50:59Z","cross_cats_sorted":[],"title_canon_sha256":"26998e2dbead3831bdb8b25d05f87be287c36283a82937f37887c8498c1de2bd","abstract_canon_sha256":"5146a3fc8392eab5f97566edd90ca6f3deb5877901f70d6c2c7ca5b3c554e122"},"schema_version":"1.0"},"canonical_sha256":"e83f69ccefbe0ae28b645bccc0e464fb7cd815f35cba786dd811423ff9dab086","source":{"kind":"arxiv","id":"2508.02006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.02006","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"arxiv_version","alias_value":"2508.02006v1","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02006","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"pith_short_12","alias_value":"5A7WTTHPXYFO","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"pith_short_16","alias_value":"5A7WTTHPXYFOFC3E","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"pith_short_8","alias_value":"5A7WTTHP","created_at":"2026-07-05T11:47:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5A7WTTHPXYFOFC3ELPGMBZDE7N","target":"record","payload":{"canonical_record":{"source":{"id":"2508.02006","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-04T02:50:59Z","cross_cats_sorted":[],"title_canon_sha256":"26998e2dbead3831bdb8b25d05f87be287c36283a82937f37887c8498c1de2bd","abstract_canon_sha256":"5146a3fc8392eab5f97566edd90ca6f3deb5877901f70d6c2c7ca5b3c554e122"},"schema_version":"1.0"},"canonical_sha256":"e83f69ccefbe0ae28b645bccc0e464fb7cd815f35cba786dd811423ff9dab086","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:49.431617Z","signature_b64":"W038coNMgui29oiXso54p20J/JCHoYZO1gw7fQEMMvp5x4joo8QNF+HT3z/2IBGC4EY68FiVJeXFaPI9qylODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83f69ccefbe0ae28b645bccc0e464fb7cd815f35cba786dd811423ff9dab086","last_reissued_at":"2026-07-05T11:47:49.431083Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:49.431083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.02006","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-05T11:47:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdT135ZrLueHVUflPR8WbG/8kL23KzHrHyFKCl6HM6/6O0nbx5J2RVEOPF/DyyN8UF7s6q9j0/wiUmOMDwFVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:04:34.244478Z"},"content_sha256":"8bea8b5287141987ffd62fdb4134aa04561049efead1c79cfda47fcfeacb3c5a","schema_version":"1.0","event_id":"sha256:8bea8b5287141987ffd62fdb4134aa04561049efead1c79cfda47fcfeacb3c5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5A7WTTHPXYFOFC3ELPGMBZDE7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact algorithms for quadratic optimization over roots of unity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ahmad Al-Sulami, Hamza Fawzi, Shengding Sun","submitted_at":"2025-08-04T02:50:59Z","abstract_excerpt":"We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the computation of ground states in statistical physics, among others. Our contributions in this paper are twofold. We first study the convergence of the sum-of-squares hierarchy and prove its convergence to the exact solution after only $\\lfloor n/2\\rfloor+1$ levels (as opposed to $n$ levels). Our proof follows and generalizes the techniques and results used for the bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02006","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/2508.02006/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-05T11:47:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Y82tx6BHAt1WVj6x8m70NKjbfMwmFQDisn+cyaj2jj5rwhj5Gzo70P5OaMTEkMwaX9FIR07Ql+26f3frZhFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:04:34.245004Z"},"content_sha256":"d6b9f1d2b12a6d07e48a51eda9695efd0d5c97fada6e0d7ef250029067305333","schema_version":"1.0","event_id":"sha256:d6b9f1d2b12a6d07e48a51eda9695efd0d5c97fada6e0d7ef250029067305333"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5A7WTTHPXYFOFC3ELPGMBZDE7N/bundle.json","state_url":"https://pith.science/pith/5A7WTTHPXYFOFC3ELPGMBZDE7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5A7WTTHPXYFOFC3ELPGMBZDE7N/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-07T21:04:34Z","links":{"resolver":"https://pith.science/pith/5A7WTTHPXYFOFC3ELPGMBZDE7N","bundle":"https://pith.science/pith/5A7WTTHPXYFOFC3ELPGMBZDE7N/bundle.json","state":"https://pith.science/pith/5A7WTTHPXYFOFC3ELPGMBZDE7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5A7WTTHPXYFOFC3ELPGMBZDE7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5A7WTTHPXYFOFC3ELPGMBZDE7N","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":"5146a3fc8392eab5f97566edd90ca6f3deb5877901f70d6c2c7ca5b3c554e122","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-04T02:50:59Z","title_canon_sha256":"26998e2dbead3831bdb8b25d05f87be287c36283a82937f37887c8498c1de2bd"},"schema_version":"1.0","source":{"id":"2508.02006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.02006","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"arxiv_version","alias_value":"2508.02006v1","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02006","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"pith_short_12","alias_value":"5A7WTTHPXYFO","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"pith_short_16","alias_value":"5A7WTTHPXYFOFC3E","created_at":"2026-07-05T11:47:49Z"},{"alias_kind":"pith_short_8","alias_value":"5A7WTTHP","created_at":"2026-07-05T11:47:49Z"}],"graph_snapshots":[{"event_id":"sha256:d6b9f1d2b12a6d07e48a51eda9695efd0d5c97fada6e0d7ef250029067305333","target":"graph","created_at":"2026-07-05T11:47:49Z","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/2508.02006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the computation of ground states in statistical physics, among others. Our contributions in this paper are twofold. We first study the convergence of the sum-of-squares hierarchy and prove its convergence to the exact solution after only $\\lfloor n/2\\rfloor+1$ levels (as opposed to $n$ levels). Our proof follows and generalizes the techniques and results used for the bi","authors_text":"Ahmad Al-Sulami, Hamza Fawzi, Shengding Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-04T02:50:59Z","title":"Exact algorithms for quadratic optimization over roots of unity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02006","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:8bea8b5287141987ffd62fdb4134aa04561049efead1c79cfda47fcfeacb3c5a","target":"record","created_at":"2026-07-05T11:47:49Z","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":"5146a3fc8392eab5f97566edd90ca6f3deb5877901f70d6c2c7ca5b3c554e122","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-04T02:50:59Z","title_canon_sha256":"26998e2dbead3831bdb8b25d05f87be287c36283a82937f37887c8498c1de2bd"},"schema_version":"1.0","source":{"id":"2508.02006","kind":"arxiv","version":1}},"canonical_sha256":"e83f69ccefbe0ae28b645bccc0e464fb7cd815f35cba786dd811423ff9dab086","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e83f69ccefbe0ae28b645bccc0e464fb7cd815f35cba786dd811423ff9dab086","first_computed_at":"2026-07-05T11:47:49.431083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:47:49.431083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W038coNMgui29oiXso54p20J/JCHoYZO1gw7fQEMMvp5x4joo8QNF+HT3z/2IBGC4EY68FiVJeXFaPI9qylODQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:47:49.431617Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.02006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bea8b5287141987ffd62fdb4134aa04561049efead1c79cfda47fcfeacb3c5a","sha256:d6b9f1d2b12a6d07e48a51eda9695efd0d5c97fada6e0d7ef250029067305333"],"state_sha256":"da806c85244ad0ee2e3a7d162e9c791ba84520eae7766a32e7a4a8763d231e1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDl3NRHM3k2Zz4rG7Dodj6t3zVhzN9wmH6i6zvUyA26oBZ9rzlEb/gNK2qEWPVEoi80D1givuFChy+h+ih2KBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T21:04:34.249357Z","bundle_sha256":"7fc2a26fab53f32e9c20bf9a6e0db985f1fe2879f78ac6247ccdf279e1b22b0b"}}