{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JSJ6PCRC5MLTKT4ZFIBOS252NZ","short_pith_number":"pith:JSJ6PCRC","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"},"canonical_sha256":"4c93e78a22eb17354f992a02e96bba6e63c506c6e0af2a59de2440a50237dd43","source":{"kind":"arxiv","id":"2301.00306","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.00306","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"2301.00306v4","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00306","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"JSJ6PCRC5MLT","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"pith_short_16","alias_value":"JSJ6PCRC5MLTKT4Z","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"pith_short_8","alias_value":"JSJ6PCRC","created_at":"2026-07-05T11:58:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JSJ6PCRC5MLTKT4ZFIBOS252NZ","target":"record","payload":{"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"},"canonical_sha256":"4c93e78a22eb17354f992a02e96bba6e63c506c6e0af2a59de2440a50237dd43","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"},"source_kind":"arxiv","source_id":"2301.00306","source_version":4,"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:58:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4st9f06JyDN6uEDSZ01f/rKA0XfS+mjyy71Uh3jRzWgyfb5hrvvGdInSYwacVn9FA20E/2DTeJKTx8PDV7Z1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:38:57.097530Z"},"content_sha256":"34fef7d1b5d347164b506a524886261c9958f21ec2d3a73d04ba976fa7d8a960","schema_version":"1.0","event_id":"sha256:34fef7d1b5d347164b506a524886261c9958f21ec2d3a73d04ba976fa7d8a960"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JSJ6PCRC5MLTKT4ZFIBOS252NZ","target":"graph","payload":{"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"},"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:58:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENV3+/A/0Xs/Gr9zq+3DxJFyFXBAQKsDm/YOU137UC/emqRt71rkycMLB9gDmQNWODeBtJpE4Jz9cdKhtHTvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:38:57.097913Z"},"content_sha256":"45f2e2a26980a7286864f7dd9cce9085e8db599815e03fc36621bc9c26f9dd10","schema_version":"1.0","event_id":"sha256:45f2e2a26980a7286864f7dd9cce9085e8db599815e03fc36621bc9c26f9dd10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/bundle.json","state_url":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/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-07-06T17:38:57Z","links":{"resolver":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ","bundle":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/bundle.json","state":"https://pith.science/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSJ6PCRC5MLTKT4ZFIBOS252NZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JSJ6PCRC5MLTKT4ZFIBOS252NZ","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":"03b0b1f277842d65e1dc67205e5b40f9f3767668e8845c4b1d8c7d16541e2013","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-31T23:16:12Z","title_canon_sha256":"5930a53826fed3042dd08e1ac43c4098554f978545271b5fec1818b2b601af34"},"schema_version":"1.0","source":{"id":"2301.00306","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.00306","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"2301.00306v4","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00306","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"JSJ6PCRC5MLT","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"pith_short_16","alias_value":"JSJ6PCRC5MLTKT4Z","created_at":"2026-07-05T11:58:15Z"},{"alias_kind":"pith_short_8","alias_value":"JSJ6PCRC","created_at":"2026-07-05T11:58:15Z"}],"graph_snapshots":[{"event_id":"sha256:45f2e2a26980a7286864f7dd9cce9085e8db599815e03fc36621bc9c26f9dd10","target":"graph","created_at":"2026-07-05T11:58:15Z","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/2301.00306/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Deepjyoti Deka, Harsha Nagarajan, Rohit Kannan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-31T23:16:12Z","title":"Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.00306","kind":"arxiv","version":4},"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:34fef7d1b5d347164b506a524886261c9958f21ec2d3a73d04ba976fa7d8a960","target":"record","created_at":"2026-07-05T11:58:15Z","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":"03b0b1f277842d65e1dc67205e5b40f9f3767668e8845c4b1d8c7d16541e2013","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-31T23:16:12Z","title_canon_sha256":"5930a53826fed3042dd08e1ac43c4098554f978545271b5fec1818b2b601af34"},"schema_version":"1.0","source":{"id":"2301.00306","kind":"arxiv","version":4}},"canonical_sha256":"4c93e78a22eb17354f992a02e96bba6e63c506c6e0af2a59de2440a50237dd43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c93e78a22eb17354f992a02e96bba6e63c506c6e0af2a59de2440a50237dd43","first_computed_at":"2026-07-05T11:58:15.684927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:15.684927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZAzuEJIyRjfyAxtmw8PgWFmU00CznQ8ezyZZGWuFhY5hh8QwUEsX3wI0/SLSP9a9S8pVcZbM9/I6CDfE5en4CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:15.685396Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.00306","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34fef7d1b5d347164b506a524886261c9958f21ec2d3a73d04ba976fa7d8a960","sha256:45f2e2a26980a7286864f7dd9cce9085e8db599815e03fc36621bc9c26f9dd10"],"state_sha256":"d9a62a897fd184d9ea2d5f89aa514ceef2bd884d8beab1966cd21995199a62cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QLjH71OTLpjKVxuCAXsYcKRH+P1nb+T91UbCtmI3XuMiTT7t1p0Pe14PuK+GGx61jHbETfm71WA9yAaQiPIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:38:57.099898Z","bundle_sha256":"fb96187f54fdf0bddd2f04d5865d460e2439a67128f9079afe5ab4d55b7721d4"}}