{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MLJM6BMX43ZRUG73UH4F5N46FF","short_pith_number":"pith:MLJM6BMX","canonical_record":{"source":{"id":"2605.13474","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-13T12:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"84f2e7a7c55a91845073b1320c0cd1f244d593cb5aae052bfcff9cf5bd4157c4","abstract_canon_sha256":"a8e7a092ec68f566e8856adc387f1be5034d7b184814c38db08151c6834f17fe"},"schema_version":"1.0"},"canonical_sha256":"62d2cf0597e6f31a1bfba1f85eb79e296a718c9677abb9e81672ee70155bc37f","source":{"kind":"arxiv","id":"2605.13474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13474","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13474v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13474","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"MLJM6BMX43ZR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MLJM6BMX43ZRUG73","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MLJM6BMX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MLJM6BMX43ZRUG73UH4F5N46FF","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13474","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-13T12:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"84f2e7a7c55a91845073b1320c0cd1f244d593cb5aae052bfcff9cf5bd4157c4","abstract_canon_sha256":"a8e7a092ec68f566e8856adc387f1be5034d7b184814c38db08151c6834f17fe"},"schema_version":"1.0"},"canonical_sha256":"62d2cf0597e6f31a1bfba1f85eb79e296a718c9677abb9e81672ee70155bc37f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:41.508664Z","signature_b64":"ccxo2xlkCzV0Qu3EtKpNXByOOlSR7td0/JwGtSftFpZg4kS3SS9AKHhzZCtcLcJLt/2UnmZ8kx2w3dyV5cWgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62d2cf0597e6f31a1bfba1f85eb79e296a718c9677abb9e81672ee70155bc37f","last_reissued_at":"2026-05-18T02:44:41.508100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:41.508100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13474","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-18T02:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3as/YnT+i13MGkj0epITC99DJq8TYtWjY5HMfDl/1RN8hGbayEmzQLjoX9PTFZBwmGVhL7gCy7yf6d8SbhxQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:01:10.702149Z"},"content_sha256":"6fb9b4286569ebe41329d250489b4a377a23efdbe7ceaba94437337dcf37e240","schema_version":"1.0","event_id":"sha256:6fb9b4286569ebe41329d250489b4a377a23efdbe7ceaba94437337dcf37e240"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MLJM6BMX43ZRUG73UH4F5N46FF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Minimum-($k,\\rho$)-Shortcut Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The minimum (k,ρ)-shortcut problem is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs.","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Leonhardt, Conrad Schecker, Julian Christoph Brinkmann, Tatiana Rocha Avila","submitted_at":"2026-05-13T12:59:40Z","abstract_excerpt":"We consider the Minimum-$(k,\\rho)$-$\\mathrm{Shortcut}$ problem ($\\min(k,\\rho)\\text{-}\\mathrm{Shortcut}$), where the goal is to find the smallest set of shortcut edges such that every vertex in a given graph can reach its $\\rho$ closest vertices using paths of at most $k$ edges. This is a fundamental graph optimization problem used to accelerate parallel shortest path algorithms.\n  It is well-known that the problem is trivially solvable for the cases $k=1$ and $k\\geq\\rho$. While recent work by Leonhardt, Meyer, and Penschuck (ESA 2024) showed that in undirected graphs $\\min(k,\\rho)\\text{-}\\math"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a simpler and more direct reduction from the Hitting Set problem which establishes that min(k,ρ)-Shortcut is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The constructed reduction from Hitting Set instances to shortcut instances is polynomial-time computable and correctly preserves yes/no answers.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The Minimum-(k,ρ)-Shortcut problem is NP-hard for k≥2 and ρ≥k+2 in directed and undirected graphs, while undirected graphs with ρ=k+1 are solvable in polynomial time.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The minimum (k,ρ)-shortcut problem is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1ad621fb960803ae732d7255b2b39d171d1664803d5e5a4d9a74ef2c4606b07c"},"source":{"id":"2605.13474","kind":"arxiv","version":1},"verdict":{"id":"7cbfe22a-d94f-459e-a795-a7e22c9c92eb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:25:24.753965Z","strongest_claim":"We present a simpler and more direct reduction from the Hitting Set problem which establishes that min(k,ρ)-Shortcut is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs.","one_line_summary":"The Minimum-(k,ρ)-Shortcut problem is NP-hard for k≥2 and ρ≥k+2 in directed and undirected graphs, while undirected graphs with ρ=k+1 are solvable in polynomial time.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The constructed reduction from Hitting Set instances to shortcut instances is polynomial-time computable and correctly preserves yes/no answers.","pith_extraction_headline":"The minimum (k,ρ)-shortcut problem is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs."},"references":{"count":19,"sample":[{"doi":"","year":2003,"title":"2003 , url =","work_id":"a41c2cb3-4021-4193-ab24-7ce4f9df62cc","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"2024 , doi =","work_id":"bfb9204f-16dc-48d3-bcb8-13ce5e5de21b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/0890-5401(90)90043-h","year":1990,"title":"The Monadic Second-Order Logic of Graphs","work_id":"69e8ab4c-158e-499e-8f23-ebc09d518761","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2003,"title":"2003 , doi =","work_id":"360be629-9503-44d9-b930-2a794a6ea8c9","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Berndt and Sun Kim and Alexandru Zaharescu , title =","work_id":"ec284562-dc13-4a7a-9a2c-4b49eef9610c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":19,"snapshot_sha256":"e459083ee19430afee34b6fe036ea2a374aa8a43efff1f3117237d6b9b034a42","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":"7cbfe22a-d94f-459e-a795-a7e22c9c92eb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6nCV12u6ZM3vlIzYwp9CsXhH5XP0Zk8g4HqEW0b/rCPnczceWrIiykBXniV1DefYa8ITYrtFcG4axeH9gcKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:01:10.703182Z"},"content_sha256":"0921792f3b0b789faf5b75ca9955fc2dd2c9749934bd8f48bfbd40d4493e87fa","schema_version":"1.0","event_id":"sha256:0921792f3b0b789faf5b75ca9955fc2dd2c9749934bd8f48bfbd40d4493e87fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLJM6BMX43ZRUG73UH4F5N46FF/bundle.json","state_url":"https://pith.science/pith/MLJM6BMX43ZRUG73UH4F5N46FF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLJM6BMX43ZRUG73UH4F5N46FF/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-06T19:01:10Z","links":{"resolver":"https://pith.science/pith/MLJM6BMX43ZRUG73UH4F5N46FF","bundle":"https://pith.science/pith/MLJM6BMX43ZRUG73UH4F5N46FF/bundle.json","state":"https://pith.science/pith/MLJM6BMX43ZRUG73UH4F5N46FF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLJM6BMX43ZRUG73UH4F5N46FF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MLJM6BMX43ZRUG73UH4F5N46FF","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":"a8e7a092ec68f566e8856adc387f1be5034d7b184814c38db08151c6834f17fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-13T12:59:40Z","title_canon_sha256":"84f2e7a7c55a91845073b1320c0cd1f244d593cb5aae052bfcff9cf5bd4157c4"},"schema_version":"1.0","source":{"id":"2605.13474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13474","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13474v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13474","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"MLJM6BMX43ZR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MLJM6BMX43ZRUG73","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MLJM6BMX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0921792f3b0b789faf5b75ca9955fc2dd2c9749934bd8f48bfbd40d4493e87fa","target":"graph","created_at":"2026-05-18T02:44:41Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We present a simpler and more direct reduction from the Hitting Set problem which establishes that min(k,ρ)-Shortcut is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The constructed reduction from Hitting Set instances to shortcut instances is polynomial-time computable and correctly preserves yes/no answers."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The Minimum-(k,ρ)-Shortcut problem is NP-hard for k≥2 and ρ≥k+2 in directed and undirected graphs, while undirected graphs with ρ=k+1 are solvable in polynomial time."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The minimum (k,ρ)-shortcut problem is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs."}],"snapshot_sha256":"1ad621fb960803ae732d7255b2b39d171d1664803d5e5a4d9a74ef2c4606b07c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the Minimum-$(k,\\rho)$-$\\mathrm{Shortcut}$ problem ($\\min(k,\\rho)\\text{-}\\mathrm{Shortcut}$), where the goal is to find the smallest set of shortcut edges such that every vertex in a given graph can reach its $\\rho$ closest vertices using paths of at most $k$ edges. This is a fundamental graph optimization problem used to accelerate parallel shortest path algorithms.\n  It is well-known that the problem is trivially solvable for the cases $k=1$ and $k\\geq\\rho$. While recent work by Leonhardt, Meyer, and Penschuck (ESA 2024) showed that in undirected graphs $\\min(k,\\rho)\\text{-}\\math","authors_text":"Alexander Leonhardt, Conrad Schecker, Julian Christoph Brinkmann, Tatiana Rocha Avila","cross_cats":[],"headline":"The minimum (k,ρ)-shortcut problem is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-13T12:59:40Z","title":"On the Complexity of the Minimum-($k,\\rho$)-Shortcut Problem"},"references":{"count":19,"internal_anchors":0,"resolved_work":19,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"2003 , url =","work_id":"a41c2cb3-4021-4193-ab24-7ce4f9df62cc","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"2024 , doi =","work_id":"bfb9204f-16dc-48d3-bcb8-13ce5e5de21b","year":2024},{"cited_arxiv_id":"","doi":"10.1016/0890-5401(90)90043-h","is_internal_anchor":false,"ref_index":3,"title":"The Monadic Second-Order Logic of Graphs","work_id":"69e8ab4c-158e-499e-8f23-ebc09d518761","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"2003 , doi =","work_id":"360be629-9503-44d9-b930-2a794a6ea8c9","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Berndt and Sun Kim and Alexandru Zaharescu , title =","work_id":"ec284562-dc13-4a7a-9a2c-4b49eef9610c","year":2018}],"snapshot_sha256":"e459083ee19430afee34b6fe036ea2a374aa8a43efff1f3117237d6b9b034a42"},"source":{"id":"2605.13474","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:25:24.753965Z","id":"7cbfe22a-d94f-459e-a795-a7e22c9c92eb","model_set":{"reader":"grok-4.3"},"one_line_summary":"The Minimum-(k,ρ)-Shortcut problem is NP-hard for k≥2 and ρ≥k+2 in directed and undirected graphs, while undirected graphs with ρ=k+1 are solvable in polynomial time.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The minimum (k,ρ)-shortcut problem is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs.","strongest_claim":"We present a simpler and more direct reduction from the Hitting Set problem which establishes that min(k,ρ)-Shortcut is NP-hard for k≥2 and ρ≥k+2 in both directed and undirected graphs.","weakest_assumption":"The constructed reduction from Hitting Set instances to shortcut instances is polynomial-time computable and correctly preserves yes/no answers."}},"verdict_id":"7cbfe22a-d94f-459e-a795-a7e22c9c92eb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6fb9b4286569ebe41329d250489b4a377a23efdbe7ceaba94437337dcf37e240","target":"record","created_at":"2026-05-18T02:44:41Z","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":"a8e7a092ec68f566e8856adc387f1be5034d7b184814c38db08151c6834f17fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-13T12:59:40Z","title_canon_sha256":"84f2e7a7c55a91845073b1320c0cd1f244d593cb5aae052bfcff9cf5bd4157c4"},"schema_version":"1.0","source":{"id":"2605.13474","kind":"arxiv","version":1}},"canonical_sha256":"62d2cf0597e6f31a1bfba1f85eb79e296a718c9677abb9e81672ee70155bc37f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62d2cf0597e6f31a1bfba1f85eb79e296a718c9677abb9e81672ee70155bc37f","first_computed_at":"2026-05-18T02:44:41.508100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:41.508100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ccxo2xlkCzV0Qu3EtKpNXByOOlSR7td0/JwGtSftFpZg4kS3SS9AKHhzZCtcLcJLt/2UnmZ8kx2w3dyV5cWgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:41.508664Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fb9b4286569ebe41329d250489b4a377a23efdbe7ceaba94437337dcf37e240","sha256:0921792f3b0b789faf5b75ca9955fc2dd2c9749934bd8f48bfbd40d4493e87fa"],"state_sha256":"592d940c1f5ff5a3cc49b6181bf0fcc4ae468ff5a55370ef1b11d9ce82e299f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6a9bzqYjhko3AxCsI4s70oD4gwWJEIcjRnJ/3ax64Rid6AnwjnIK8Rsrm0inwRGVA9R5dSs7ppXmyLaO1wYNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:01:10.708036Z","bundle_sha256":"f47e04d17e690d7ae39eeef71d3f84a5e09c42d85aad3d645bcb1fe8c686e2eb"}}