{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZQYLLEGCIBIBQB2XEG4GCDTFMV","short_pith_number":"pith:ZQYLLEGC","schema_version":"1.0","canonical_sha256":"cc30b590c2405018075721b8610e65654da42915dc0af6e3991fbc2db7d271a0","source":{"kind":"arxiv","id":"1904.11606","version":2},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Min-Distance Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mina Dalirrooyfard, Nicole Wein, Nikhil Vyas, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu","submitted_at":"2019-04-25T22:00:54Z","abstract_excerpt":"We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when distances are measured using a somewhat unorthodox but natural measure: the distance between $u$ and $v$ is the minimum of the shortest path distances from $u$ to $v$ and from $v$ to $u$. The center node in a graph under this measure can for instance represent the optimal location for a hospital to ensure the fastest medical care for everyone, as one can either go to the hospital, or a doctor can be sent to help.\n  By computing All-Pairs Shortest Paths, all pairwise distances and thus the parameters "},"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":"1904.11606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T22:00:54Z","cross_cats_sorted":[],"title_canon_sha256":"6558131cf95bd614776f590e3cc85bee508c8407ed35d9fe122edc9cdd26cacb","abstract_canon_sha256":"bafaba1ef6787a16264f57d6ca169ad5156a57798007f7df7179113e8443cfc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:14.447578Z","signature_b64":"iDe1dxsTrKrdGaYshgQtodks4mAHaj4xRQHnioV1TSeJFDytoxYvrnup79c0wSyvOFOFme2zBqo3KVX0YJ+RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc30b590c2405018075721b8610e65654da42915dc0af6e3991fbc2db7d271a0","last_reissued_at":"2026-05-17T23:43:14.447100Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:14.447100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Min-Distance Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mina Dalirrooyfard, Nicole Wein, Nikhil Vyas, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu","submitted_at":"2019-04-25T22:00:54Z","abstract_excerpt":"We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when distances are measured using a somewhat unorthodox but natural measure: the distance between $u$ and $v$ is the minimum of the shortest path distances from $u$ to $v$ and from $v$ to $u$. The center node in a graph under this measure can for instance represent the optimal location for a hospital to ensure the fastest medical care for everyone, as one can either go to the hospital, or a doctor can be sent to help.\n  By computing All-Pairs Shortest Paths, all pairwise distances and thus the parameters "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11606","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":""},"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":"1904.11606","created_at":"2026-05-17T23:43:14.447178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11606v2","created_at":"2026-05-17T23:43:14.447178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11606","created_at":"2026-05-17T23:43:14.447178+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQYLLEGCIBIB","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQYLLEGCIBIBQB2X","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQYLLEGC","created_at":"2026-05-18T12:33:33.725879+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/ZQYLLEGCIBIBQB2XEG4GCDTFMV","json":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV.json","graph_json":"https://pith.science/api/pith-number/ZQYLLEGCIBIBQB2XEG4GCDTFMV/graph.json","events_json":"https://pith.science/api/pith-number/ZQYLLEGCIBIBQB2XEG4GCDTFMV/events.json","paper":"https://pith.science/paper/ZQYLLEGC"},"agent_actions":{"view_html":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV","download_json":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV.json","view_paper":"https://pith.science/paper/ZQYLLEGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11606&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQYLLEGCIBIBQB2XEG4GCDTFMV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQYLLEGCIBIBQB2XEG4GCDTFMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/action/storage_attestation","attest_author":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/action/author_attestation","sign_citation":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/action/citation_signature","submit_replication":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/action/replication_record"}},"created_at":"2026-05-17T23:43:14.447178+00:00","updated_at":"2026-05-17T23:43:14.447178+00:00"}