{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VYL2LUIQDRERR45N6S7H6BAC6Z","short_pith_number":"pith:VYL2LUIQ","schema_version":"1.0","canonical_sha256":"ae17a5d1101c4918f3adf4be7f0402f660064ddf226108c53864843317e3e439","source":{"kind":"arxiv","id":"2104.14476","version":2},"attestation_state":"computed","paper":{"title":"Reverse Shortest Path Problem for Unit-Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Yiming Zhao","submitted_at":"2021-04-29T16:38:35Z","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"},"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":"2104.14476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-04-29T16:38:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"01911ab8d78a42d14cf7f161445cf62342fc6ae0dde6636bb8600e9ff1628901","abstract_canon_sha256":"b2b8962d06a3fb80e2122aafd01f6f3c522fa453fc7d3730f50fe3fe1cee9dd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:39:58.798434Z","signature_b64":"GHWiqHB8QMoVBUcHOur8Zo2plpiFihN8M/ELOLhLU94tlavSyG5Ilgvl0lSL1FTmoPjoC1bnD8rDYw9i01VlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae17a5d1101c4918f3adf4be7f0402f660064ddf226108c53864843317e3e439","last_reissued_at":"2026-07-05T03:39:58.797936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:39:58.797936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reverse Shortest Path Problem for Unit-Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Yiming Zhao","submitted_at":"2021-04-29T16:38:35Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14476","kind":"arxiv","version":2},"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/2104.14476/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":"2104.14476","created_at":"2026-07-05T03:39:58.797995+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.14476v2","created_at":"2026-07-05T03:39:58.797995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14476","created_at":"2026-07-05T03:39:58.797995+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYL2LUIQDRER","created_at":"2026-07-05T03:39:58.797995+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYL2LUIQDRERR45N","created_at":"2026-07-05T03:39:58.797995+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYL2LUIQ","created_at":"2026-07-05T03:39:58.797995+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/VYL2LUIQDRERR45N6S7H6BAC6Z","json":"https://pith.science/pith/VYL2LUIQDRERR45N6S7H6BAC6Z.json","graph_json":"https://pith.science/api/pith-number/VYL2LUIQDRERR45N6S7H6BAC6Z/graph.json","events_json":"https://pith.science/api/pith-number/VYL2LUIQDRERR45N6S7H6BAC6Z/events.json","paper":"https://pith.science/paper/VYL2LUIQ"},"agent_actions":{"view_html":"https://pith.science/pith/VYL2LUIQDRERR45N6S7H6BAC6Z","download_json":"https://pith.science/pith/VYL2LUIQDRERR45N6S7H6BAC6Z.json","view_paper":"https://pith.science/paper/VYL2LUIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.14476&json=true","fetch_graph":"https://pith.science/api/pith-number/VYL2LUIQDRERR45N6S7H6BAC6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/VYL2LUIQDRERR45N6S7H6BAC6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYL2LUIQDRERR45N6S7H6BAC6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYL2LUIQDRERR45N6S7H6BAC6Z/action/storage_attestation","attest_author":"https://pith.science/pith/VYL2LUIQDRERR45N6S7H6BAC6Z/action/author_attestation","sign_citation":"https://pith.science/pith/VYL2LUIQDRERR45N6S7H6BAC6Z/action/citation_signature","submit_replication":"https://pith.science/pith/VYL2LUIQDRERR45N6S7H6BAC6Z/action/replication_record"}},"created_at":"2026-07-05T03:39:58.797995+00:00","updated_at":"2026-07-05T03:39:58.797995+00:00"}