{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QPDVJPJ5YZNVVFH3VAHV3BJ5B7","short_pith_number":"pith:QPDVJPJ5","canonical_record":{"source":{"id":"2504.17862","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T18:06:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fa52af051af6d5c14494179926e407da5d4262375ad65cba26319ed8f98b9290","abstract_canon_sha256":"06e9ecf2e96cccd113ee041772132e2dd07ad71dcb5b01500d94703e92ddc5e5"},"schema_version":"1.0"},"canonical_sha256":"83c754bd3dc65b5a94fba80f5d853d0fc370e5c7184a0c87c1e13a4ca396f0e5","source":{"kind":"arxiv","id":"2504.17862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.17862","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"2504.17862v1","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17862","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"QPDVJPJ5YZNV","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"pith_short_16","alias_value":"QPDVJPJ5YZNVVFH3","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"pith_short_8","alias_value":"QPDVJPJ5","created_at":"2026-07-05T10:53:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QPDVJPJ5YZNVVFH3VAHV3BJ5B7","target":"record","payload":{"canonical_record":{"source":{"id":"2504.17862","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T18:06:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fa52af051af6d5c14494179926e407da5d4262375ad65cba26319ed8f98b9290","abstract_canon_sha256":"06e9ecf2e96cccd113ee041772132e2dd07ad71dcb5b01500d94703e92ddc5e5"},"schema_version":"1.0"},"canonical_sha256":"83c754bd3dc65b5a94fba80f5d853d0fc370e5c7184a0c87c1e13a4ca396f0e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:57.285386Z","signature_b64":"dkD0xWQ/uLi89I1Jucx6oplI1StHs/ZZDlQO1ARFRqg8PgCi9MAGstW8TiS/U1RD3AT6LkkQMZnag3qE6QNsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83c754bd3dc65b5a94fba80f5d853d0fc370e5c7184a0c87c1e13a4ca396f0e5","last_reissued_at":"2026-07-05T10:53:57.284877Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:57.284877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.17862","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-05T10:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ii5/rl8YT4vGCtCUaMgXil7sYN+Pt8lXUV99NiBtqqt3Z2XqxILhUnkwDX4DkRLOqAP7DSw2ANNKeX3kik7nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:56:28.796922Z"},"content_sha256":"96726b4360103e6ec7dbc06dd9e2732f5a6eeb954be4c0269062c52bd64087a8","schema_version":"1.0","event_id":"sha256:96726b4360103e6ec7dbc06dd9e2732f5a6eeb954be4c0269062c52bd64087a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QPDVJPJ5YZNVVFH3VAHV3BJ5B7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Prafullkumar Tale","submitted_at":"2025-04-24T18:06:20Z","abstract_excerpt":"In the \\textsc{Geodetic Set} problem, the input consists of a graph $G$ and a positive integer $k$. The goal is to determine whether there exists a subset $S$ of vertices of size $k$ such that every vertex in the graph is included in a shortest path between two vertices in $S$. Kellerhals and Koana [IPEC 2020; J. Graph Algorithms Appl 2022] proved that the problem is $\\W[1]$-hard when parameterized by the pathwidth and the feedback vertex set number of the input graph. They posed the question of whether the problem admits an $\\XP$ algorithm when parameterized by the combination of these two pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17862","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/2504.17862/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-05T10:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLnEa89DMeDDOiIFtzBe6elCujjdCP0shlkdByKBoOIJQhurySoY/uocdwaLNmSzgyg+2Hm+GpQ1U3fwRe0kBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:56:28.805536Z"},"content_sha256":"043261eae12983b1464a180d80b9cafd3cecf73998a4a745fb2f68c2e361b571","schema_version":"1.0","event_id":"sha256:043261eae12983b1464a180d80b9cafd3cecf73998a4a745fb2f68c2e361b571"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPDVJPJ5YZNVVFH3VAHV3BJ5B7/bundle.json","state_url":"https://pith.science/pith/QPDVJPJ5YZNVVFH3VAHV3BJ5B7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPDVJPJ5YZNVVFH3VAHV3BJ5B7/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-14T19:56:28Z","links":{"resolver":"https://pith.science/pith/QPDVJPJ5YZNVVFH3VAHV3BJ5B7","bundle":"https://pith.science/pith/QPDVJPJ5YZNVVFH3VAHV3BJ5B7/bundle.json","state":"https://pith.science/pith/QPDVJPJ5YZNVVFH3VAHV3BJ5B7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPDVJPJ5YZNVVFH3VAHV3BJ5B7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QPDVJPJ5YZNVVFH3VAHV3BJ5B7","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":"06e9ecf2e96cccd113ee041772132e2dd07ad71dcb5b01500d94703e92ddc5e5","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T18:06:20Z","title_canon_sha256":"fa52af051af6d5c14494179926e407da5d4262375ad65cba26319ed8f98b9290"},"schema_version":"1.0","source":{"id":"2504.17862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.17862","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"2504.17862v1","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17862","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"QPDVJPJ5YZNV","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"pith_short_16","alias_value":"QPDVJPJ5YZNVVFH3","created_at":"2026-07-05T10:53:57Z"},{"alias_kind":"pith_short_8","alias_value":"QPDVJPJ5","created_at":"2026-07-05T10:53:57Z"}],"graph_snapshots":[{"event_id":"sha256:043261eae12983b1464a180d80b9cafd3cecf73998a4a745fb2f68c2e361b571","target":"graph","created_at":"2026-07-05T10:53:57Z","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/2504.17862/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the \\textsc{Geodetic Set} problem, the input consists of a graph $G$ and a positive integer $k$. The goal is to determine whether there exists a subset $S$ of vertices of size $k$ such that every vertex in the graph is included in a shortest path between two vertices in $S$. Kellerhals and Koana [IPEC 2020; J. Graph Algorithms Appl 2022] proved that the problem is $\\W[1]$-hard when parameterized by the pathwidth and the feedback vertex set number of the input graph. They posed the question of whether the problem admits an $\\XP$ algorithm when parameterized by the combination of these two pa","authors_text":"Prafullkumar Tale","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T18:06:20Z","title":"Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17862","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:96726b4360103e6ec7dbc06dd9e2732f5a6eeb954be4c0269062c52bd64087a8","target":"record","created_at":"2026-07-05T10:53:57Z","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":"06e9ecf2e96cccd113ee041772132e2dd07ad71dcb5b01500d94703e92ddc5e5","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T18:06:20Z","title_canon_sha256":"fa52af051af6d5c14494179926e407da5d4262375ad65cba26319ed8f98b9290"},"schema_version":"1.0","source":{"id":"2504.17862","kind":"arxiv","version":1}},"canonical_sha256":"83c754bd3dc65b5a94fba80f5d853d0fc370e5c7184a0c87c1e13a4ca396f0e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83c754bd3dc65b5a94fba80f5d853d0fc370e5c7184a0c87c1e13a4ca396f0e5","first_computed_at":"2026-07-05T10:53:57.284877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:57.284877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dkD0xWQ/uLi89I1Jucx6oplI1StHs/ZZDlQO1ARFRqg8PgCi9MAGstW8TiS/U1RD3AT6LkkQMZnag3qE6QNsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:57.285386Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.17862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96726b4360103e6ec7dbc06dd9e2732f5a6eeb954be4c0269062c52bd64087a8","sha256:043261eae12983b1464a180d80b9cafd3cecf73998a4a745fb2f68c2e361b571"],"state_sha256":"da623977a8b78c063e49f86dd3b95c43cee0b65fe6f4ec64624ba7638e6b6fea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Ka3ExZMuRHq7MF3xIgNvH0g63qkLS/9dBgbSsk9Z7eu5RMNwcVzPiiydzM6jjsqp9LQYzjXfY6t8ic867muDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T19:56:28.854764Z","bundle_sha256":"928bf27ff411208db420ad60adb3ae3e6a72f23d3c3e3feec98ef6430fe15793"}}