{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JSJ6PCRC5MLTKT4ZFIBOS252NZ","short_pith_number":"pith:JSJ6PCRC","schema_version":"1.0","canonical_sha256":"4c93e78a22eb17354f992a02e96bba6e63c506c6e0af2a59de2440a50237dd43","source":{"kind":"arxiv","id":"2301.00306","version":4},"attestation_state":"computed","paper":{"title":"Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Deepjyoti Deka, Harsha Nagarajan, Rohit Kannan","submitted_at":"2022-12-31T23:16:12Z","abstract_excerpt":"We learn optimal instance-specific heuristics for the global minimization of nonconvex quadratically-constrained quadratic programs (QCQPs). Specifically, we consider partitioning-based convex mixed-integer programming relaxations for nonconvex QCQPs and propose the novel problem of strong partitioning to optimally partition variable domains without sacrificing global optimality. Since solving this max-min strong partitioning problem exactly can be very challenging, we design a local optimization method that leverages generalized gradients of the value function of its inner-minimization proble"},"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":"2301.00306","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-31T23:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"5930a53826fed3042dd08e1ac43c4098554f978545271b5fec1818b2b601af34","abstract_canon_sha256":"03b0b1f277842d65e1dc67205e5b40f9f3767668e8845c4b1d8c7d16541e2013"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:15.685396Z","signature_b64":"ZAzuEJIyRjfyAxtmw8PgWFmU00CznQ8ezyZZGWuFhY5hh8QwUEsX3wI0/SLSP9a9S8pVcZbM9/I6CDfE5en4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c93e78a22eb17354f992a02e96bba6e63c506c6e0af2a59de2440a50237dd43","last_reissued_at":"2026-07-05T11:58:15.684927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:15.684927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Deepjyoti Deka, Harsha Nagarajan, Rohit Kannan","submitted_at":"2022-12-31T23:16:12Z","abstract_excerpt":"We learn optimal instance-specific heuristics for the global minimization of nonconvex quadratically-constrained quadratic programs (QCQPs). Specifically, we consider partitioning-based convex mixed-integer programming relaxations for nonconvex QCQPs and propose the novel problem of strong partitioning to optimally partition variable domains without sacrificing global optimality. Since solving this max-min strong partitioning problem exactly can be very challenging, we design a local optimization method that leverages generalized gradients of the value function of its inner-minimization proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.00306","kind":"arxiv","version":4},"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/2301.00306/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":"2301.00306","created_at":"2026-07-05T11:58:15.684985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.00306v4","created_at":"2026-07-05T11:58:15.684985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00306","created_at":"2026-07-05T11:58:15.684985+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSJ6PCRC5MLT","created_at":"2026-07-05T11:58:15.684985+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSJ6PCRC5MLTKT4Z","created_at":"2026-07-05T11:58:15.684985+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSJ6PCRC","created_at":"2026-07-05T11:58:15.684985+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21483","citing_title":"A note on the convergence guarantees of RLT-based algorithms for polynomial optimization","ref_index":89,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ","json":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ.json","graph_json":"https://pith.science/api/pith-number/JSJ6PCRC5MLTKT4ZFIBOS252NZ/graph.json","events_json":"https://pith.science/api/pith-number/JSJ6PCRC5MLTKT4ZFIBOS252NZ/events.json","paper":"https://pith.science/paper/JSJ6PCRC"},"agent_actions":{"view_html":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ","download_json":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ.json","view_paper":"https://pith.science/paper/JSJ6PCRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.00306&json=true","fetch_graph":"https://pith.science/api/pith-number/JSJ6PCRC5MLTKT4ZFIBOS252NZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JSJ6PCRC5MLTKT4ZFIBOS252NZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/action/storage_attestation","attest_author":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/action/author_attestation","sign_citation":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/action/citation_signature","submit_replication":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/action/replication_record"}},"created_at":"2026-07-05T11:58:15.684985+00:00","updated_at":"2026-07-05T11:58:15.684985+00:00"}