{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WELRAX7YKFRP63QXB35XYG2SDY","short_pith_number":"pith:WELRAX7Y","schema_version":"1.0","canonical_sha256":"b117105ff85162ff6e170efb7c1b521e091791c10b26488d5da878bbe8c030ee","source":{"kind":"arxiv","id":"2606.26414","version":1},"attestation_state":"computed","paper":{"title":"Structural parameterizations of Geodetic Set on directed (acyclic) graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Beaudou Laurent, Foucaud Florent, Lorieau Lucas, Tale Prafullkumar","submitted_at":"2026-06-24T22:11:45Z","abstract_excerpt":"In DIRECTED GEODETIC SET, we are given a (directed) graph and seek a small solution set $S \\subseteq V(G)$ such that every vertex lies on a shortest directed path between two vertices in $S$.\n  It is known that the problem is W[2]-hard when parameterized by the solution size $k$, even on directed acyclic graphs (DAGs).\n  Our first result is a kernel of size $2^{O(vcn)}$ for DIRECTED GEODETIC SET on general digraphs, where $vcn$ denotes the vertex cover number of the underlying (undirected) graph. This implies an algorithm running in time $2^{O(vcn^2)} \\cdot n^{O(1)}$. Furthermore, we prove tha"},"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":"2606.26414","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-24T22:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"c19a9e79df4f5bde1d6afee49f14fe310e5ece4e77445736b78aa091be55b313","abstract_canon_sha256":"90479ecfc221a8cc0f839e976b1e9d103cf1165dc0a57af3b1e55d0f5ce33554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T00:15:40.319201Z","signature_b64":"X0NGifKKPEYRUnfgI//SAe7s8h1xLIu+KWLIbLaM4C/K+XKY6ZIpdvSznbJ8MA7Jb3B4+SxtNp28AFd/KZS8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b117105ff85162ff6e170efb7c1b521e091791c10b26488d5da878bbe8c030ee","last_reissued_at":"2026-06-26T00:15:40.318803Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T00:15:40.318803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural parameterizations of Geodetic Set on directed (acyclic) graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Beaudou Laurent, Foucaud Florent, Lorieau Lucas, Tale Prafullkumar","submitted_at":"2026-06-24T22:11:45Z","abstract_excerpt":"In DIRECTED GEODETIC SET, we are given a (directed) graph and seek a small solution set $S \\subseteq V(G)$ such that every vertex lies on a shortest directed path between two vertices in $S$.\n  It is known that the problem is W[2]-hard when parameterized by the solution size $k$, even on directed acyclic graphs (DAGs).\n  Our first result is a kernel of size $2^{O(vcn)}$ for DIRECTED GEODETIC SET on general digraphs, where $vcn$ denotes the vertex cover number of the underlying (undirected) graph. This implies an algorithm running in time $2^{O(vcn^2)} \\cdot n^{O(1)}$. Furthermore, we prove tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26414","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/2606.26414/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.26414","created_at":"2026-06-26T00:15:40.318858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26414v1","created_at":"2026-06-26T00:15:40.318858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26414","created_at":"2026-06-26T00:15:40.318858+00:00"},{"alias_kind":"pith_short_12","alias_value":"WELRAX7YKFRP","created_at":"2026-06-26T00:15:40.318858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WELRAX7YKFRP63QX","created_at":"2026-06-26T00:15:40.318858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WELRAX7Y","created_at":"2026-06-26T00:15:40.318858+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/WELRAX7YKFRP63QXB35XYG2SDY","json":"https://pith.science/pith/WELRAX7YKFRP63QXB35XYG2SDY.json","graph_json":"https://pith.science/api/pith-number/WELRAX7YKFRP63QXB35XYG2SDY/graph.json","events_json":"https://pith.science/api/pith-number/WELRAX7YKFRP63QXB35XYG2SDY/events.json","paper":"https://pith.science/paper/WELRAX7Y"},"agent_actions":{"view_html":"https://pith.science/pith/WELRAX7YKFRP63QXB35XYG2SDY","download_json":"https://pith.science/pith/WELRAX7YKFRP63QXB35XYG2SDY.json","view_paper":"https://pith.science/paper/WELRAX7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26414&json=true","fetch_graph":"https://pith.science/api/pith-number/WELRAX7YKFRP63QXB35XYG2SDY/graph.json","fetch_events":"https://pith.science/api/pith-number/WELRAX7YKFRP63QXB35XYG2SDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WELRAX7YKFRP63QXB35XYG2SDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WELRAX7YKFRP63QXB35XYG2SDY/action/storage_attestation","attest_author":"https://pith.science/pith/WELRAX7YKFRP63QXB35XYG2SDY/action/author_attestation","sign_citation":"https://pith.science/pith/WELRAX7YKFRP63QXB35XYG2SDY/action/citation_signature","submit_replication":"https://pith.science/pith/WELRAX7YKFRP63QXB35XYG2SDY/action/replication_record"}},"created_at":"2026-06-26T00:15:40.318858+00:00","updated_at":"2026-06-26T00:15:40.318858+00:00"}