{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ANWQKL4QLVOKMBCYIEJOTKFAUN","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":"414c8b73410d6d5f21bcc14def7ff1511944d7436bdb8e52ffb504895f9f9551","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-10T05:53:02Z","title_canon_sha256":"e662ea17b9049304742528d2a722ff6e92f05d46e53763d9a766a5a55a9ac0cc"},"schema_version":"1.0","source":{"id":"1708.03081","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03081","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03081v2","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03081","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"ANWQKL4QLVOK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ANWQKL4QLVOKMBCY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ANWQKL4Q","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:ac3f8407f9b8bb694e1db592564d540719bb0d6c37863ce234df243944770782","target":"graph","created_at":"2026-05-18T00:04:45Z","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"},"paper":{"abstract_excerpt":"We consider the problem of finding small distance-preserving subgraphs of undirected, unweighted interval graphs with $k$ terminal vertices.\n  To start with, we show that finding an optimal distance-preserving subgraph is $\\mathsf{NP}$-hard for general graphs. Then, we show that every interval graph admits a subgraph with $O(k)$ branching vertices that approximates pairwise terminal distances up to an additive term of $+1$. We also present an interval graph $G_{\\mathrm{int}}$ for which the $+1$ approximation is necessary to obtain the $O(k)$ upper bound on the number of branching vertices. In ","authors_text":"Jaikumar Radhakrishnan, Kshitij Gajjar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-10T05:53:02Z","title":"Distance-preserving Subgraphs of Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03081","kind":"arxiv","version":2},"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:f7e0fc71f3790f0ad070ad2623e367472992cff04cdb715805e188ead10edf0f","target":"record","created_at":"2026-05-18T00:04:45Z","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":"414c8b73410d6d5f21bcc14def7ff1511944d7436bdb8e52ffb504895f9f9551","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-10T05:53:02Z","title_canon_sha256":"e662ea17b9049304742528d2a722ff6e92f05d46e53763d9a766a5a55a9ac0cc"},"schema_version":"1.0","source":{"id":"1708.03081","kind":"arxiv","version":2}},"canonical_sha256":"036d052f905d5ca604584112e9a8a0a357d57ab3ee9524e56a130f6f8e300192","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"036d052f905d5ca604584112e9a8a0a357d57ab3ee9524e56a130f6f8e300192","first_computed_at":"2026-05-18T00:04:45.304626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:45.304626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VFAk4dsRoQJCLgj4efCxWYgvjfj6NNdWX/T5kStH2Ez4Vhnw9V2RT3kiGXO4539Da0oTAuNAcQS6HnOicE2yAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:45.305219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03081","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7e0fc71f3790f0ad070ad2623e367472992cff04cdb715805e188ead10edf0f","sha256:ac3f8407f9b8bb694e1db592564d540719bb0d6c37863ce234df243944770782"],"state_sha256":"8e5dadbe74ba54d6a436e01af3d02a62211e48152450fb8856a664b4384a7fc6"}