{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VYL2LUIQDRERR45N6S7H6BAC6Z","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":"b2b8962d06a3fb80e2122aafd01f6f3c522fa453fc7d3730f50fe3fe1cee9dd8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-04-29T16:38:35Z","title_canon_sha256":"01911ab8d78a42d14cf7f161445cf62342fc6ae0dde6636bb8600e9ff1628901"},"schema_version":"1.0","source":{"id":"2104.14476","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.14476","created_at":"2026-07-05T03:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"2104.14476v2","created_at":"2026-07-05T03:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14476","created_at":"2026-07-05T03:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"VYL2LUIQDRER","created_at":"2026-07-05T03:39:58Z"},{"alias_kind":"pith_short_16","alias_value":"VYL2LUIQDRERR45N","created_at":"2026-07-05T03:39:58Z"},{"alias_kind":"pith_short_8","alias_value":"VYL2LUIQ","created_at":"2026-07-05T03:39:58Z"}],"graph_snapshots":[{"event_id":"sha256:99153bc2166d6762fe30c4f601d7fcba8062b2e6370f13a8dcca0865050d533c","target":"graph","created_at":"2026-07-05T03:39:58Z","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/2104.14476/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a set P of n points in the plane, the unit-disk graph G_{r}(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q \\in P if the Euclidean distance between p and q is at most r (the weight of the edge is 1 in the unweighted case and is the distance between p and q in the weighted case). Given a value \\lambda>0 and two points s and t of P, we consider the following reverse shortest path problem: computing the smallest r such that the shortest path length between s and t in G_r(P) is at most \\lambda. In this paper, we present","authors_text":"Haitao Wang, Yiming Zhao","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-04-29T16:38:35Z","title":"Reverse Shortest Path Problem for Unit-Disk Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14476","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:b2b93ff6ce152d90a794f3f8217a7c4a52e09f1bd4bc611a541ca67ae08ecd00","target":"record","created_at":"2026-07-05T03:39:58Z","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":"b2b8962d06a3fb80e2122aafd01f6f3c522fa453fc7d3730f50fe3fe1cee9dd8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-04-29T16:38:35Z","title_canon_sha256":"01911ab8d78a42d14cf7f161445cf62342fc6ae0dde6636bb8600e9ff1628901"},"schema_version":"1.0","source":{"id":"2104.14476","kind":"arxiv","version":2}},"canonical_sha256":"ae17a5d1101c4918f3adf4be7f0402f660064ddf226108c53864843317e3e439","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae17a5d1101c4918f3adf4be7f0402f660064ddf226108c53864843317e3e439","first_computed_at":"2026-07-05T03:39:58.797936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:39:58.797936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GHWiqHB8QMoVBUcHOur8Zo2plpiFihN8M/ELOLhLU94tlavSyG5Ilgvl0lSL1FTmoPjoC1bnD8rDYw9i01VlDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:39:58.798434Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.14476","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2b93ff6ce152d90a794f3f8217a7c4a52e09f1bd4bc611a541ca67ae08ecd00","sha256:99153bc2166d6762fe30c4f601d7fcba8062b2e6370f13a8dcca0865050d533c"],"state_sha256":"a5c917eb11b4660b2147fdf8820b3c2998747bb0b52171db5c0d438311ab98ce"}