{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ESM6UZ274GI3UNOCOZOWZJFTQP","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":"e8d0e2c5e9dbaf533665ea0adb461861fd2e8864adfa0b4e86e9a4202f74368a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T12:10:17Z","title_canon_sha256":"1928240f7ec9c6c93793e49860ab72e13dc8c3cd3001df8f52bfecbb56f1c8d8"},"schema_version":"1.0","source":{"id":"2509.01413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.01413","created_at":"2026-07-05T12:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"2509.01413v1","created_at":"2026-07-05T12:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01413","created_at":"2026-07-05T12:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"ESM6UZ274GI3","created_at":"2026-07-05T12:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"ESM6UZ274GI3UNOC","created_at":"2026-07-05T12:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"ESM6UZ27","created_at":"2026-07-05T12:03:00Z"}],"graph_snapshots":[{"event_id":"sha256:06d50ed6d5fb7634f40312646f891547a465580df5269cb67da0dae9eeaeef11","target":"graph","created_at":"2026-07-05T12:03:00Z","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/2509.01413/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G = (V,E)$, a set $T$ of vertex pairs, and an integer $k$, Hitting Geodesic Intervals asks whether there is a set $S \\subseteq V$ of size at most $k$ such that for each terminal pair $\\{u,v\\} \\in T$, the set $S$ intersects at least one shortest $u$-$v$ path. Aravind and Saxena [WALCOM 2024] introduced this problem and showed several parameterized complexity results. In this paper, we extend the known results in both negative and positive directions and present sharp complexity contrasts with respect to structural graph parameters.\n  We first show that the problem is NP-complete ","authors_text":"Hayato Takaike, Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Yuto Okada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T12:10:17Z","title":"Hitting Geodesic Intervals in Structurally Restricted Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01413","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:3fe3f3eada3bd5b603d59e3b5deedd29895f7a448027196a88e8809b5b730a03","target":"record","created_at":"2026-07-05T12:03:00Z","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":"e8d0e2c5e9dbaf533665ea0adb461861fd2e8864adfa0b4e86e9a4202f74368a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T12:10:17Z","title_canon_sha256":"1928240f7ec9c6c93793e49860ab72e13dc8c3cd3001df8f52bfecbb56f1c8d8"},"schema_version":"1.0","source":{"id":"2509.01413","kind":"arxiv","version":1}},"canonical_sha256":"2499ea675fe191ba35c2765d6ca4b383d8d864b6b1da73897de370412bb6f0be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2499ea675fe191ba35c2765d6ca4b383d8d864b6b1da73897de370412bb6f0be","first_computed_at":"2026-07-05T12:03:00.476155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:03:00.476155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Of8ryjKLOtLhGQVtQZXRInKcpKuXKAo360BlIAmW9lSMeP5hhkKkOeDYeD1z+lr3okfvJ8dJO+iPPISaejkkDA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:03:00.476574Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.01413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fe3f3eada3bd5b603d59e3b5deedd29895f7a448027196a88e8809b5b730a03","sha256:06d50ed6d5fb7634f40312646f891547a465580df5269cb67da0dae9eeaeef11"],"state_sha256":"80bcf4b85e0f125de86acd440a8a7834eefde3d1ff799bae4c5c301a12478e73"}