{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4M6OQ4ZEWBSRXWHDOSBRAUP5K3","short_pith_number":"pith:4M6OQ4ZE","schema_version":"1.0","canonical_sha256":"e33ce87324b0651bd8e374831051fd56d2ce2dcf05b720d2efea93513fe54195","source":{"kind":"arxiv","id":"1801.10416","version":1},"attestation_state":"computed","paper":{"title":"Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Daniele Frigioni, Guido Proietti, Luca Forlizzi, Mattia D'Emidio, Stefano Leucci","submitted_at":"2018-01-31T12:02:04Z","abstract_excerpt":"Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices are partitioned into a set of $k$ clusters, a \\emph{clustered network design problem} on $G$ consists of solving a given network design optimization problem on $G$, subject to some additional constraint on its clusters.\n  In particular, we focus on the classic problem of designing a \\emph{single-source shortest-path tree}, and we analyze its computational hardness when in a feasible solution each cluster is required to form a subtree. We first study the \\emph{unweighted} case, and prove that the problem is \\np-hard. How"},"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":"1801.10416","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-01-31T12:02:04Z","cross_cats_sorted":["cs.CC","cs.NI"],"title_canon_sha256":"99bfaedf9d84ba9b1d57b3ea682ef64c59634e4fa7463698e9ba243823287862","abstract_canon_sha256":"27304c3b0c2aebae95317742fb7824c85d614abe598c7b8be0c42124fa5bc920"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:40.893445Z","signature_b64":"LQaSC75TDJcvZM9vBa7srCaXzKUbJDJDAhPF+RHh5yZ3S6GIMvWNb7UL3fWqy/WiizpCBlcIcB80+Hmq6WUEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e33ce87324b0651bd8e374831051fd56d2ce2dcf05b720d2efea93513fe54195","last_reissued_at":"2026-05-18T00:24:40.892770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:40.892770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Daniele Frigioni, Guido Proietti, Luca Forlizzi, Mattia D'Emidio, Stefano Leucci","submitted_at":"2018-01-31T12:02:04Z","abstract_excerpt":"Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices are partitioned into a set of $k$ clusters, a \\emph{clustered network design problem} on $G$ consists of solving a given network design optimization problem on $G$, subject to some additional constraint on its clusters.\n  In particular, we focus on the classic problem of designing a \\emph{single-source shortest-path tree}, and we analyze its computational hardness when in a feasible solution each cluster is required to form a subtree. We first study the \\emph{unweighted} case, and prove that the problem is \\np-hard. How"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10416","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":""},"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":"1801.10416","created_at":"2026-05-18T00:24:40.892873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10416v1","created_at":"2026-05-18T00:24:40.892873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10416","created_at":"2026-05-18T00:24:40.892873+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M6OQ4ZEWBSR","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M6OQ4ZEWBSRXWHD","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M6OQ4ZE","created_at":"2026-05-18T12:32:05.422762+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/4M6OQ4ZEWBSRXWHDOSBRAUP5K3","json":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3.json","graph_json":"https://pith.science/api/pith-number/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/graph.json","events_json":"https://pith.science/api/pith-number/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/events.json","paper":"https://pith.science/paper/4M6OQ4ZE"},"agent_actions":{"view_html":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3","download_json":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3.json","view_paper":"https://pith.science/paper/4M6OQ4ZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10416&json=true","fetch_graph":"https://pith.science/api/pith-number/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/graph.json","fetch_events":"https://pith.science/api/pith-number/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/action/storage_attestation","attest_author":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/action/author_attestation","sign_citation":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/action/citation_signature","submit_replication":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/action/replication_record"}},"created_at":"2026-05-18T00:24:40.892873+00:00","updated_at":"2026-05-18T00:24:40.892873+00:00"}