{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DCVVTNSZNUDAH5VCI6HGVXASOC","short_pith_number":"pith:DCVVTNSZ","schema_version":"1.0","canonical_sha256":"18ab59b6596d0603f6a2478e6adc1270ab32f20abb62c39b9b136a85976e58cd","source":{"kind":"arxiv","id":"2605.14994","version":1},"attestation_state":"computed","paper":{"title":"Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"quant-ph","authors_text":"Ainesh Bakshi, Anqi Li, Arpon Basu, Pravesh Kothari","submitted_at":"2026-05-14T15:56:29Z","abstract_excerpt":"We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level $k$ Kikuchi graph of any graph $G$ with $m$ edges is at most $m+k$. This confirms four recent conjectures of Apte, Parekh, and Sud.\n  As applications, we obtain that tensor products of one and two qubit product states achieve an approximation ratio of $5/8$ for Quantum Max Cut and $5/7$ for the XY Hamiltonian. Moreover, combining our bounds with the algorithms analyzed by Apte, Parekh, and Sud, yields efficient algorithms achieving an approximation ratio of $0.614$ for Quantum Max Cut and $0.674$ for the "},"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":"2605.14994","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T15:56:29Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"16293f12a7b2a2f17b7f95e5345c041196d58b03d9c7785ba86369e48dfeb4b9","abstract_canon_sha256":"74e35cbdf53422cc1e8b77147649e5cbfe2b28643844dd0437cb9d01a2ec6551"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:54.981334Z","signature_b64":"rJkkZ8dh8hikpTwUA+tcc0vKbjepelHRh+8TXV519YdKCO7VazIOT0nQ17buHfhWqNvFHW8rvMy+S0SMVwtUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18ab59b6596d0603f6a2478e6adc1270ab32f20abb62c39b9b136a85976e58cd","last_reissued_at":"2026-05-17T23:38:54.980621Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:54.980621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"quant-ph","authors_text":"Ainesh Bakshi, Anqi Li, Arpon Basu, Pravesh Kothari","submitted_at":"2026-05-14T15:56:29Z","abstract_excerpt":"We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level $k$ Kikuchi graph of any graph $G$ with $m$ edges is at most $m+k$. This confirms four recent conjectures of Apte, Parekh, and Sud.\n  As applications, we obtain that tensor products of one and two qubit product states achieve an approximation ratio of $5/8$ for Quantum Max Cut and $5/7$ for the XY Hamiltonian. Moreover, combining our bounds with the algorithms analyzed by Apte, Parekh, and Sud, yields efficient algorithms achieving an approximation ratio of $0.614$ for Quantum Max Cut and $0.674$ for the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14994","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":""},"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":"2605.14994","created_at":"2026-05-17T23:38:54.980731+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14994v1","created_at":"2026-05-17T23:38:54.980731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14994","created_at":"2026-05-17T23:38:54.980731+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCVVTNSZNUDA","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCVVTNSZNUDAH5VC","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCVVTNSZ","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC","json":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC.json","graph_json":"https://pith.science/api/pith-number/DCVVTNSZNUDAH5VCI6HGVXASOC/graph.json","events_json":"https://pith.science/api/pith-number/DCVVTNSZNUDAH5VCI6HGVXASOC/events.json","paper":"https://pith.science/paper/DCVVTNSZ"},"agent_actions":{"view_html":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC","download_json":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC.json","view_paper":"https://pith.science/paper/DCVVTNSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14994&json=true","fetch_graph":"https://pith.science/api/pith-number/DCVVTNSZNUDAH5VCI6HGVXASOC/graph.json","fetch_events":"https://pith.science/api/pith-number/DCVVTNSZNUDAH5VCI6HGVXASOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC/action/storage_attestation","attest_author":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC/action/author_attestation","sign_citation":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC/action/citation_signature","submit_replication":"https://pith.science/pith/DCVVTNSZNUDAH5VCI6HGVXASOC/action/replication_record"}},"created_at":"2026-05-17T23:38:54.980731+00:00","updated_at":"2026-05-17T23:38:54.980731+00:00"}