{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ESM6UZ274GI3UNOCOZOWZJFTQP","short_pith_number":"pith:ESM6UZ27","canonical_record":{"source":{"id":"2509.01413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T12:10:17Z","cross_cats_sorted":[],"title_canon_sha256":"1928240f7ec9c6c93793e49860ab72e13dc8c3cd3001df8f52bfecbb56f1c8d8","abstract_canon_sha256":"e8d0e2c5e9dbaf533665ea0adb461861fd2e8864adfa0b4e86e9a4202f74368a"},"schema_version":"1.0"},"canonical_sha256":"2499ea675fe191ba35c2765d6ca4b383d8d864b6b1da73897de370412bb6f0be","source":{"kind":"arxiv","id":"2509.01413","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ESM6UZ274GI3UNOCOZOWZJFTQP","target":"record","payload":{"canonical_record":{"source":{"id":"2509.01413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T12:10:17Z","cross_cats_sorted":[],"title_canon_sha256":"1928240f7ec9c6c93793e49860ab72e13dc8c3cd3001df8f52bfecbb56f1c8d8","abstract_canon_sha256":"e8d0e2c5e9dbaf533665ea0adb461861fd2e8864adfa0b4e86e9a4202f74368a"},"schema_version":"1.0"},"canonical_sha256":"2499ea675fe191ba35c2765d6ca4b383d8d864b6b1da73897de370412bb6f0be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:00.476574Z","signature_b64":"Of8ryjKLOtLhGQVtQZXRInKcpKuXKAo360BlIAmW9lSMeP5hhkKkOeDYeD1z+lr3okfvJ8dJO+iPPISaejkkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2499ea675fe191ba35c2765d6ca4b383d8d864b6b1da73897de370412bb6f0be","last_reissued_at":"2026-07-05T12:03:00.476155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:00.476155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.01413","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-05T12:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GpoHP4ctVykJrUh34tmqZwrdhM8bG3Rn1Hop3KNF8P4Ud0SUhKRi9WHVGfaLFoSQNzrjqEuOB3gp1kWcbVqNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:09:30.302043Z"},"content_sha256":"3fe3f3eada3bd5b603d59e3b5deedd29895f7a448027196a88e8809b5b730a03","schema_version":"1.0","event_id":"sha256:3fe3f3eada3bd5b603d59e3b5deedd29895f7a448027196a88e8809b5b730a03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ESM6UZ274GI3UNOCOZOWZJFTQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hitting Geodesic Intervals in Structurally Restricted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hayato Takaike, Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Yuto Okada","submitted_at":"2025-09-01T12:10:17Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01413","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/2509.01413/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-05T12:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaoFQlgm7+7vce9rWGl0yBYXPUzbUf2oOEqhWLuWEn5dBGbynNcyWtQNEE5oGVV1V/xbfw8p7hkBdH0tB3KTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:09:30.303110Z"},"content_sha256":"06d50ed6d5fb7634f40312646f891547a465580df5269cb67da0dae9eeaeef11","schema_version":"1.0","event_id":"sha256:06d50ed6d5fb7634f40312646f891547a465580df5269cb67da0dae9eeaeef11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESM6UZ274GI3UNOCOZOWZJFTQP/bundle.json","state_url":"https://pith.science/pith/ESM6UZ274GI3UNOCOZOWZJFTQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESM6UZ274GI3UNOCOZOWZJFTQP/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-06T09:09:30Z","links":{"resolver":"https://pith.science/pith/ESM6UZ274GI3UNOCOZOWZJFTQP","bundle":"https://pith.science/pith/ESM6UZ274GI3UNOCOZOWZJFTQP/bundle.json","state":"https://pith.science/pith/ESM6UZ274GI3UNOCOZOWZJFTQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESM6UZ274GI3UNOCOZOWZJFTQP/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mq2+rjRp7109fM35Bjh8cQOjNF9mD4j3MUIF7kNxS6oqO86bS7Snff3Uy9aegY7ZO3q1rKgGrHQH/W3E9+vmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:09:30.314197Z","bundle_sha256":"703faa1c9e8f1c375d4f040f3ffeb4f43db4f49d89d0e7c2c674c0545c5cecc4"}}