{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GT27VGXY2CCCHM333XW3ZISWXS","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":"b31ebc3c9c58c5f12d9fff54892432ef5425639b7e830dae708fbf8ca4c018ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-12T00:57:53Z","title_canon_sha256":"112c77d67737f3b1f0eb9e87988d9a95c0838986418cd083ddd190132969fb46"},"schema_version":"1.0","source":{"id":"2404.08178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.08178","created_at":"2026-07-05T08:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"2404.08178v1","created_at":"2026-07-05T08:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08178","created_at":"2026-07-05T08:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"GT27VGXY2CCC","created_at":"2026-07-05T08:07:18Z"},{"alias_kind":"pith_short_16","alias_value":"GT27VGXY2CCCHM33","created_at":"2026-07-05T08:07:18Z"},{"alias_kind":"pith_short_8","alias_value":"GT27VGXY","created_at":"2026-07-05T08:07:18Z"}],"graph_snapshots":[{"event_id":"sha256:df7959041f87d5f141e7580281d464cbaf2f88f2c35293ecf1e4ea3e81ebd2f4","target":"graph","created_at":"2026-07-05T08:07:18Z","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/2404.08178/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aaresh Bhathena, Andr\\'es G\\'omez, Salar Fattahi, Simge K\\\"u\\c{c}\\\"ukyavuz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-12T00:57:53Z","title":"A Parametric Approach for Solving Convex Quadratic Optimization with Indicators Over Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08178","kind":"arxiv","version":1},"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:2baef0400819e2f29e06226422e398c1489c4ccbaad5896b5dabddebd2706b21","target":"record","created_at":"2026-07-05T08:07:18Z","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":"b31ebc3c9c58c5f12d9fff54892432ef5425639b7e830dae708fbf8ca4c018ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-12T00:57:53Z","title_canon_sha256":"112c77d67737f3b1f0eb9e87988d9a95c0838986418cd083ddd190132969fb46"},"schema_version":"1.0","source":{"id":"2404.08178","kind":"arxiv","version":1}},"canonical_sha256":"34f5fa9af8d08423b37bddedbca256bcacf849f9729244987a97317ac0f189eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34f5fa9af8d08423b37bddedbca256bcacf849f9729244987a97317ac0f189eb","first_computed_at":"2026-07-05T08:07:18.904869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:18.904869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LztJDu7ZstDMTA6kmJHhESY71liU9T1n+SXH47fWQHUFyAvKCspJ3PZzvo7AhgLfW4WEpzYwLdRHu45OI7lFAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:18.905309Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.08178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2baef0400819e2f29e06226422e398c1489c4ccbaad5896b5dabddebd2706b21","sha256:df7959041f87d5f141e7580281d464cbaf2f88f2c35293ecf1e4ea3e81ebd2f4"],"state_sha256":"d018542d67ec5982bdea26ffeba6791d59f3f849db740c744eb7628c713f6494"}