{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6PMX2C77JD5AXWKCVLCEHFKVSP","short_pith_number":"pith:6PMX2C77","schema_version":"1.0","canonical_sha256":"f3d97d0bff48fa0bd942aac443955593e6e7b4674e13e4a58e309e093bd71a7e","source":{"kind":"arxiv","id":"2511.02082","version":2},"attestation_state":"computed","paper":{"title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amitabh Basu, Marco Molinaro, Phillip Kerger","submitted_at":"2025-11-03T21:42:30Z","abstract_excerpt":"We establish new lower-bounds for the information complexity of mixed-integer convex optimization under two \"bit-wise\" oracles.\n  The first oracle provides bits of first-order information in the standard\n  coordinate model, and the second oracle answers whether the inner product of a specified vector with the gradient of the function at a point or\n  the normal vector of a separating hyperplane for the feasible region is\n  positive or non-positive, thus also providing one bit of first-order information. The new contribution is that under such oracles, the complexity is quadratic in the number o"},"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":"2511.02082","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-11-03T21:42:30Z","cross_cats_sorted":[],"title_canon_sha256":"c59aaee88944d3d1e0c3074aabcdef38507aea8f23c9773e4c5439cfb870df1d","abstract_canon_sha256":"5461609505a257476ce5b6096ff809459738f44fa5d3f0c9648f0df0aee94638"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T00:21:43.086689Z","signature_b64":"2itFX5+L7N5/PDr7OEob1/UsJmJ9nVRmDZHRQUmB0YYTEqkkYu623H1WczoeZu7SrfTy7kVmcfA6JnNCEL01Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3d97d0bff48fa0bd942aac443955593e6e7b4674e13e4a58e309e093bd71a7e","last_reissued_at":"2026-07-16T00:21:43.085778Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T00:21:43.085778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amitabh Basu, Marco Molinaro, Phillip Kerger","submitted_at":"2025-11-03T21:42:30Z","abstract_excerpt":"We establish new lower-bounds for the information complexity of mixed-integer convex optimization under two \"bit-wise\" oracles.\n  The first oracle provides bits of first-order information in the standard\n  coordinate model, and the second oracle answers whether the inner product of a specified vector with the gradient of the function at a point or\n  the normal vector of a separating hyperplane for the feasible region is\n  positive or non-positive, thus also providing one bit of first-order information. The new contribution is that under such oracles, the complexity is quadratic in the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.02082","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/2511.02082/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":"2511.02082","created_at":"2026-07-16T00:21:43.086194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.02082v2","created_at":"2026-07-16T00:21:43.086194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.02082","created_at":"2026-07-16T00:21:43.086194+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PMX2C77JD5A","created_at":"2026-07-16T00:21:43.086194+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PMX2C77JD5AXWKC","created_at":"2026-07-16T00:21:43.086194+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PMX2C77","created_at":"2026-07-16T00:21:43.086194+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.13335","citing_title":"Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP","json":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP.json","graph_json":"https://pith.science/api/pith-number/6PMX2C77JD5AXWKCVLCEHFKVSP/graph.json","events_json":"https://pith.science/api/pith-number/6PMX2C77JD5AXWKCVLCEHFKVSP/events.json","paper":"https://pith.science/paper/6PMX2C77"},"agent_actions":{"view_html":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP","download_json":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP.json","view_paper":"https://pith.science/paper/6PMX2C77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.02082&json=true","fetch_graph":"https://pith.science/api/pith-number/6PMX2C77JD5AXWKCVLCEHFKVSP/graph.json","fetch_events":"https://pith.science/api/pith-number/6PMX2C77JD5AXWKCVLCEHFKVSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP/action/storage_attestation","attest_author":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP/action/author_attestation","sign_citation":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP/action/citation_signature","submit_replication":"https://pith.science/pith/6PMX2C77JD5AXWKCVLCEHFKVSP/action/replication_record"}},"created_at":"2026-07-16T00:21:43.086194+00:00","updated_at":"2026-07-16T00:21:43.086194+00:00"}