{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZQ4CUCA4F22Q2YX5CQ4WIS2RE2","short_pith_number":"pith:ZQ4CUCA4","schema_version":"1.0","canonical_sha256":"cc382a081c2eb50d62fd1439644b5126a65b77fcebf8335ec16ac86e55451930","source":{"kind":"arxiv","id":"2507.14127","version":2},"attestation_state":"computed","paper":{"title":"Quantum and classical algorithms for SOCP based on the multiplicative weights update method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander M. Dalzell, M. Isabel Franco Garrido, Sam McArdle","submitted_at":"2025-07-18T17:55:58Z","abstract_excerpt":"We give classical and quantum algorithms for approximately solving second-order cone programs (SOCPs) based on the multiplicative weights (MW) update method. Our approach follows the MW framework previously applied to semidefinite programs (SDPs), of which SOCP is a special case. We show that the additional structure of SOCPs can be exploited to give better runtime with SOCP-specific algorithms. For an SOCP with $m$ linear constraints over $n$ variables partitioned into $r \\leq n$ second-order cones, our quantum algorithm requires $\\widetilde{O}(\\sqrt{r}\\gamma^5 + \\sqrt{m}\\gamma^4)$ (coherent)"},"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":"2507.14127","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-18T17:55:58Z","cross_cats_sorted":[],"title_canon_sha256":"12b2a3eecd42064236793d05852e061d0eab3c22f2f5d53c56303c7e4ec8b241","abstract_canon_sha256":"547254b1c92076488ab47b39bf35f61e8d0af452e70002d24e6b7594402b1221"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:05.476103Z","signature_b64":"bJPTB9ALOXn2+B7UKe9KlLU/uTp5FLhdo2ePZ0wBNSrmsa4IGCcxL7AXeBcn5nyFE/k7FDfG7Yue87fzUS8ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc382a081c2eb50d62fd1439644b5126a65b77fcebf8335ec16ac86e55451930","last_reissued_at":"2026-07-05T11:53:05.475629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:05.475629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum and classical algorithms for SOCP based on the multiplicative weights update method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander M. Dalzell, M. Isabel Franco Garrido, Sam McArdle","submitted_at":"2025-07-18T17:55:58Z","abstract_excerpt":"We give classical and quantum algorithms for approximately solving second-order cone programs (SOCPs) based on the multiplicative weights (MW) update method. Our approach follows the MW framework previously applied to semidefinite programs (SDPs), of which SOCP is a special case. We show that the additional structure of SOCPs can be exploited to give better runtime with SOCP-specific algorithms. For an SOCP with $m$ linear constraints over $n$ variables partitioned into $r \\leq n$ second-order cones, our quantum algorithm requires $\\widetilde{O}(\\sqrt{r}\\gamma^5 + \\sqrt{m}\\gamma^4)$ (coherent)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14127","kind":"arxiv","version":2},"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/2507.14127/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.14127","created_at":"2026-07-05T11:53:05.475687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.14127v2","created_at":"2026-07-05T11:53:05.475687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14127","created_at":"2026-07-05T11:53:05.475687+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQ4CUCA4F22Q","created_at":"2026-07-05T11:53:05.475687+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQ4CUCA4F22Q2YX5","created_at":"2026-07-05T11:53:05.475687+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQ4CUCA4","created_at":"2026-07-05T11:53:05.475687+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18858","citing_title":"A semi-smooth Newton method for the nonlinear conic problem with generalized simplicial cones","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2","json":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2.json","graph_json":"https://pith.science/api/pith-number/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/graph.json","events_json":"https://pith.science/api/pith-number/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/events.json","paper":"https://pith.science/paper/ZQ4CUCA4"},"agent_actions":{"view_html":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2","download_json":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2.json","view_paper":"https://pith.science/paper/ZQ4CUCA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.14127&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/action/storage_attestation","attest_author":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/action/author_attestation","sign_citation":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/action/citation_signature","submit_replication":"https://pith.science/pith/ZQ4CUCA4F22Q2YX5CQ4WIS2RE2/action/replication_record"}},"created_at":"2026-07-05T11:53:05.475687+00:00","updated_at":"2026-07-05T11:53:05.475687+00:00"}