{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GT27VGXY2CCCHM333XW3ZISWXS","short_pith_number":"pith:GT27VGXY","schema_version":"1.0","canonical_sha256":"34f5fa9af8d08423b37bddedbca256bcacf849f9729244987a97317ac0f189eb","source":{"kind":"arxiv","id":"2404.08178","version":1},"attestation_state":"computed","paper":{"title":"A Parametric Approach for Solving Convex Quadratic Optimization with Indicators Over Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aaresh Bhathena, Andr\\'es G\\'omez, Salar Fattahi, Simge K\\\"u\\c{c}\\\"ukyavuz","submitted_at":"2024-04-12T00:57:53Z","abstract_excerpt":"This paper investigates convex quadratic optimization problems involving $n$ indicator variables, each associated with a continuous variable, particularly focusing on scenarios where the matrix $Q$ defining the quadratic term is positive definite and its sparsity pattern corresponds to the adjacency matrix of a tree graph. We introduce a graph-based dynamic programming algorithm that solves this problem in time and memory complexity of $\\mathcal{O}(n^2)$. Central to our algorithm is a precise parametric characterization of the cost function across various nodes of the graph corresponding to di"},"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":"2404.08178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-12T00:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"112c77d67737f3b1f0eb9e87988d9a95c0838986418cd083ddd190132969fb46","abstract_canon_sha256":"b31ebc3c9c58c5f12d9fff54892432ef5425639b7e830dae708fbf8ca4c018ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:18.905309Z","signature_b64":"LztJDu7ZstDMTA6kmJHhESY71liU9T1n+SXH47fWQHUFyAvKCspJ3PZzvo7AhgLfW4WEpzYwLdRHu45OI7lFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34f5fa9af8d08423b37bddedbca256bcacf849f9729244987a97317ac0f189eb","last_reissued_at":"2026-07-05T08:07:18.904869Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:18.904869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parametric Approach for Solving Convex Quadratic Optimization with Indicators Over Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aaresh Bhathena, Andr\\'es G\\'omez, Salar Fattahi, Simge K\\\"u\\c{c}\\\"ukyavuz","submitted_at":"2024-04-12T00:57:53Z","abstract_excerpt":"This paper investigates convex quadratic optimization problems involving $n$ indicator variables, each associated with a continuous variable, particularly focusing on scenarios where the matrix $Q$ defining the quadratic term is positive definite and its sparsity pattern corresponds to the adjacency matrix of a tree graph. We introduce a graph-based dynamic programming algorithm that solves this problem in time and memory complexity of $\\mathcal{O}(n^2)$. Central to our algorithm is a precise parametric characterization of the cost function across various nodes of the graph corresponding to di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08178","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/2404.08178/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":"2404.08178","created_at":"2026-07-05T08:07:18.904924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.08178v1","created_at":"2026-07-05T08:07:18.904924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08178","created_at":"2026-07-05T08:07:18.904924+00:00"},{"alias_kind":"pith_short_12","alias_value":"GT27VGXY2CCC","created_at":"2026-07-05T08:07:18.904924+00:00"},{"alias_kind":"pith_short_16","alias_value":"GT27VGXY2CCCHM33","created_at":"2026-07-05T08:07:18.904924+00:00"},{"alias_kind":"pith_short_8","alias_value":"GT27VGXY","created_at":"2026-07-05T08:07:18.904924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17178","citing_title":"Convexification of Multi-period Quadratic Programs with Indicators","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS","json":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS.json","graph_json":"https://pith.science/api/pith-number/GT27VGXY2CCCHM333XW3ZISWXS/graph.json","events_json":"https://pith.science/api/pith-number/GT27VGXY2CCCHM333XW3ZISWXS/events.json","paper":"https://pith.science/paper/GT27VGXY"},"agent_actions":{"view_html":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS","download_json":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS.json","view_paper":"https://pith.science/paper/GT27VGXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.08178&json=true","fetch_graph":"https://pith.science/api/pith-number/GT27VGXY2CCCHM333XW3ZISWXS/graph.json","fetch_events":"https://pith.science/api/pith-number/GT27VGXY2CCCHM333XW3ZISWXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/action/storage_attestation","attest_author":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/action/author_attestation","sign_citation":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/action/citation_signature","submit_replication":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/action/replication_record"}},"created_at":"2026-07-05T08:07:18.904924+00:00","updated_at":"2026-07-05T08:07:18.904924+00:00"}