{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4M6OQ4ZEWBSRXWHDOSBRAUP5K3","short_pith_number":"pith:4M6OQ4ZE","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"},"canonical_sha256":"e33ce87324b0651bd8e374831051fd56d2ce2dcf05b720d2efea93513fe54195","source":{"kind":"arxiv","id":"1801.10416","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10416","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10416v1","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10416","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"4M6OQ4ZEWBSR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4M6OQ4ZEWBSRXWHD","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4M6OQ4ZE","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4M6OQ4ZEWBSRXWHDOSBRAUP5K3","target":"record","payload":{"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"},"canonical_sha256":"e33ce87324b0651bd8e374831051fd56d2ce2dcf05b720d2efea93513fe54195","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"},"source_kind":"arxiv","source_id":"1801.10416","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-05-18T00:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nf3MdB98EJrtmWyKxTvunIEseFxTAvdmoNeChtg7lGTdBCO+sgA+kIpF2OyiMrMRI+Gk6jWFeuygnS8bx12MDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:42:54.940369Z"},"content_sha256":"5136ef6dfbfb6d11a7daaf8e71c8c1cf417af8934f3ed51b813ce170c951197f","schema_version":"1.0","event_id":"sha256:5136ef6dfbfb6d11a7daaf8e71c8c1cf417af8934f3ed51b813ce170c951197f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4M6OQ4ZEWBSRXWHDOSBRAUP5K3","target":"graph","payload":{"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"},"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-05-18T00:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70LA6BsSnd6oIbvbbCZtZOSaq3OZrDZmbPaI+T5QhQrQWeARBtgFhODC85nj01b6sGVXjFmCzdqnsC+YqZSyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:42:54.940764Z"},"content_sha256":"6d5baa5aaf7e04dcfd1abff2e4b2df285298fcbeb0b3f0c5e86b28b2225f2035","schema_version":"1.0","event_id":"sha256:6d5baa5aaf7e04dcfd1abff2e4b2df285298fcbeb0b3f0c5e86b28b2225f2035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/bundle.json","state_url":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/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-06-02T21:42:54Z","links":{"resolver":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3","bundle":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/bundle.json","state":"https://pith.science/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4M6OQ4ZEWBSRXWHDOSBRAUP5K3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4M6OQ4ZEWBSRXWHDOSBRAUP5K3","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":"27304c3b0c2aebae95317742fb7824c85d614abe598c7b8be0c42124fa5bc920","cross_cats_sorted":["cs.CC","cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-01-31T12:02:04Z","title_canon_sha256":"99bfaedf9d84ba9b1d57b3ea682ef64c59634e4fa7463698e9ba243823287862"},"schema_version":"1.0","source":{"id":"1801.10416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10416","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10416v1","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10416","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"4M6OQ4ZEWBSR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4M6OQ4ZEWBSRXWHD","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4M6OQ4ZE","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:6d5baa5aaf7e04dcfd1abff2e4b2df285298fcbeb0b3f0c5e86b28b2225f2035","target":"graph","created_at":"2026-05-18T00:24:40Z","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"},"paper":{"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","authors_text":"Daniele Frigioni, Guido Proietti, Luca Forlizzi, Mattia D'Emidio, Stefano Leucci","cross_cats":["cs.CC","cs.NI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-01-31T12:02:04Z","title":"Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10416","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:5136ef6dfbfb6d11a7daaf8e71c8c1cf417af8934f3ed51b813ce170c951197f","target":"record","created_at":"2026-05-18T00:24:40Z","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":"27304c3b0c2aebae95317742fb7824c85d614abe598c7b8be0c42124fa5bc920","cross_cats_sorted":["cs.CC","cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-01-31T12:02:04Z","title_canon_sha256":"99bfaedf9d84ba9b1d57b3ea682ef64c59634e4fa7463698e9ba243823287862"},"schema_version":"1.0","source":{"id":"1801.10416","kind":"arxiv","version":1}},"canonical_sha256":"e33ce87324b0651bd8e374831051fd56d2ce2dcf05b720d2efea93513fe54195","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e33ce87324b0651bd8e374831051fd56d2ce2dcf05b720d2efea93513fe54195","first_computed_at":"2026-05-18T00:24:40.892770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:40.892770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LQaSC75TDJcvZM9vBa7srCaXzKUbJDJDAhPF+RHh5yZ3S6GIMvWNb7UL3fWqy/WiizpCBlcIcB80+Hmq6WUEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:40.893445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.10416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5136ef6dfbfb6d11a7daaf8e71c8c1cf417af8934f3ed51b813ce170c951197f","sha256:6d5baa5aaf7e04dcfd1abff2e4b2df285298fcbeb0b3f0c5e86b28b2225f2035"],"state_sha256":"af9cf1bba9cca743ad2811b281a075a675a1246676e3757b38bed881c78c4147"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5KGU+RVAzoq4Cf2nQy6dfKFtAfc95b7l5Pk+NgAV/MDjX+IN2a7b3Rx64zsGCWxLROVfmYvIWHHsOpJP8G8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:42:54.942760Z","bundle_sha256":"6e59397eae1a6d9b451a77ac3ec191d358f46ca0b816f81d8eb06c702c6b5c90"}}