{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DHKZB3Z7ZXDUWENSXGFKGRINZO","short_pith_number":"pith:DHKZB3Z7","schema_version":"1.0","canonical_sha256":"19d590ef3fcdc74b11b2b98aa3450dcb92e1dfa3b89a696d466b9c2e0c4c921c","source":{"kind":"arxiv","id":"2508.21327","version":1},"attestation_state":"computed","paper":{"title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Mrinalkanti Ghosh","submitted_at":"2025-08-29T05:02:07Z","abstract_excerpt":"This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems.\n  - We show a dichotomy of approximability of constraint satisfaction problems (CSPs) by linear programming (LP) relaxations: for every CSP, the approximation obtained by a basic LP relaxation, is no weaker than the approximation obtained using relaxations given by super-constant levels of the Sherali-Adams hierarchy on instances of size $n$.\n  - For the problem of approximating the absolute maximum of an n-variate degree-d homogen"},"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":"2508.21327","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-29T05:02:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b7cbc9dfd9ebfea366a5541e5d0a773bae4d3410ddba6d280288c47c78ce0665","abstract_canon_sha256":"5a1aaf5eea6031f9f37073870643bbd1b9faea20ac9fbe384b65f7e705fa4f38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:32.730995Z","signature_b64":"CVz2+vio9InQ+/g4h6wky7lftA+AG0sa6bVlsgCEJ25BHF68yFyyy5E1R3HBZNm5pcXanuvpwtZONCFC05dxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19d590ef3fcdc74b11b2b98aa3450dcb92e1dfa3b89a696d466b9c2e0c4c921c","last_reissued_at":"2026-07-05T12:01:32.730494Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:32.730494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Mrinalkanti Ghosh","submitted_at":"2025-08-29T05:02:07Z","abstract_excerpt":"This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems.\n  - We show a dichotomy of approximability of constraint satisfaction problems (CSPs) by linear programming (LP) relaxations: for every CSP, the approximation obtained by a basic LP relaxation, is no weaker than the approximation obtained using relaxations given by super-constant levels of the Sherali-Adams hierarchy on instances of size $n$.\n  - For the problem of approximating the absolute maximum of an n-variate degree-d homogen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21327","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.21327/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":"2508.21327","created_at":"2026-07-05T12:01:32.730560+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.21327v1","created_at":"2026-07-05T12:01:32.730560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21327","created_at":"2026-07-05T12:01:32.730560+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHKZB3Z7ZXDU","created_at":"2026-07-05T12:01:32.730560+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHKZB3Z7ZXDUWENS","created_at":"2026-07-05T12:01:32.730560+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHKZB3Z7","created_at":"2026-07-05T12:01:32.730560+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/DHKZB3Z7ZXDUWENSXGFKGRINZO","json":"https://pith.science/pith/DHKZB3Z7ZXDUWENSXGFKGRINZO.json","graph_json":"https://pith.science/api/pith-number/DHKZB3Z7ZXDUWENSXGFKGRINZO/graph.json","events_json":"https://pith.science/api/pith-number/DHKZB3Z7ZXDUWENSXGFKGRINZO/events.json","paper":"https://pith.science/paper/DHKZB3Z7"},"agent_actions":{"view_html":"https://pith.science/pith/DHKZB3Z7ZXDUWENSXGFKGRINZO","download_json":"https://pith.science/pith/DHKZB3Z7ZXDUWENSXGFKGRINZO.json","view_paper":"https://pith.science/paper/DHKZB3Z7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.21327&json=true","fetch_graph":"https://pith.science/api/pith-number/DHKZB3Z7ZXDUWENSXGFKGRINZO/graph.json","fetch_events":"https://pith.science/api/pith-number/DHKZB3Z7ZXDUWENSXGFKGRINZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHKZB3Z7ZXDUWENSXGFKGRINZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHKZB3Z7ZXDUWENSXGFKGRINZO/action/storage_attestation","attest_author":"https://pith.science/pith/DHKZB3Z7ZXDUWENSXGFKGRINZO/action/author_attestation","sign_citation":"https://pith.science/pith/DHKZB3Z7ZXDUWENSXGFKGRINZO/action/citation_signature","submit_replication":"https://pith.science/pith/DHKZB3Z7ZXDUWENSXGFKGRINZO/action/replication_record"}},"created_at":"2026-07-05T12:01:32.730560+00:00","updated_at":"2026-07-05T12:01:32.730560+00:00"}