{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GT27VGXY2CCCHM333XW3ZISWXS","short_pith_number":"pith:GT27VGXY","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"},"canonical_sha256":"34f5fa9af8d08423b37bddedbca256bcacf849f9729244987a97317ac0f189eb","source":{"kind":"arxiv","id":"2404.08178","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GT27VGXY2CCCHM333XW3ZISWXS","target":"record","payload":{"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"},"canonical_sha256":"34f5fa9af8d08423b37bddedbca256bcacf849f9729244987a97317ac0f189eb","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"},"source_kind":"arxiv","source_id":"2404.08178","source_version":1,"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-05T08:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0J7diHd3SqFn4nf8azsmNSF24Ld8/swhTcQuTe5rv2t8mIYIITVXDcCxU54ubBA5D9fNZz89DU6vqtU0IpOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:30:52.629224Z"},"content_sha256":"2baef0400819e2f29e06226422e398c1489c4ccbaad5896b5dabddebd2706b21","schema_version":"1.0","event_id":"sha256:2baef0400819e2f29e06226422e398c1489c4ccbaad5896b5dabddebd2706b21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GT27VGXY2CCCHM333XW3ZISWXS","target":"graph","payload":{"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"},"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-05T08:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8r4P0YaUbtJvrQArB3nZHQlW3B1/N2krebOK7Zzutyxu1dql7CB5PMPybe2rdwB31ExfQcy5M0LMwkbFZIWhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:30:52.629870Z"},"content_sha256":"df7959041f87d5f141e7580281d464cbaf2f88f2c35293ecf1e4ea3e81ebd2f4","schema_version":"1.0","event_id":"sha256:df7959041f87d5f141e7580281d464cbaf2f88f2c35293ecf1e4ea3e81ebd2f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/bundle.json","state_url":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GT27VGXY2CCCHM333XW3ZISWXS/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-08-12T03:30:52Z","links":{"resolver":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS","bundle":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/bundle.json","state":"https://pith.science/pith/GT27VGXY2CCCHM333XW3ZISWXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GT27VGXY2CCCHM333XW3ZISWXS/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VS29EIApz8YEXMTzpKPI2B6gA1BmIDDUdGVjztPAj6UA0kg4RXsdlPArHDKRM4iLHrCweaNejYqsOYgtb9T1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T03:30:52.643991Z","bundle_sha256":"dc5553a3a019f4a8637d634e5be5ed7b4bd7f1dfd98afc8cdc3eb25c4451970a"}}