{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZQYLLEGCIBIBQB2XEG4GCDTFMV","short_pith_number":"pith:ZQYLLEGC","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"},"canonical_sha256":"cc30b590c2405018075721b8610e65654da42915dc0af6e3991fbc2db7d271a0","source":{"kind":"arxiv","id":"1904.11606","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11606","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11606v2","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11606","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZQYLLEGCIBIB","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZQYLLEGCIBIBQB2X","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZQYLLEGC","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZQYLLEGCIBIBQB2XEG4GCDTFMV","target":"record","payload":{"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"},"canonical_sha256":"cc30b590c2405018075721b8610e65654da42915dc0af6e3991fbc2db7d271a0","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"},"source_kind":"arxiv","source_id":"1904.11606","source_version":2,"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-05-17T23:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmBid/sOuppiW6KAGXORcwzSNt/dVaQA5t6pK++mzmY4lKvqq9wUstRTY3+XCHEmhtnRASMs7klN+331kBA2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:01:39.365869Z"},"content_sha256":"e6466e3a0e14a95b581a5e343003b60cafd820cad1487889330ebc3f86b45842","schema_version":"1.0","event_id":"sha256:e6466e3a0e14a95b581a5e343003b60cafd820cad1487889330ebc3f86b45842"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZQYLLEGCIBIBQB2XEG4GCDTFMV","target":"graph","payload":{"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"},"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-05-17T23:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMVCGruLNoO1eLaOFxkqYASpWAO6ryd/dYXxwpXNqwqYSfzLsY2xN6sNmUtRoraMAexhKD9akd/UElMZcYAUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:01:39.366223Z"},"content_sha256":"06eaa914633922f1956a6ba2682553005f5c45050bfbef117dcfc9f2d2de3c05","schema_version":"1.0","event_id":"sha256:06eaa914633922f1956a6ba2682553005f5c45050bfbef117dcfc9f2d2de3c05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/bundle.json","state_url":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/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-05-21T13:01:39Z","links":{"resolver":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV","bundle":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/bundle.json","state":"https://pith.science/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQYLLEGCIBIBQB2XEG4GCDTFMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZQYLLEGCIBIBQB2XEG4GCDTFMV","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":"bafaba1ef6787a16264f57d6ca169ad5156a57798007f7df7179113e8443cfc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T22:00:54Z","title_canon_sha256":"6558131cf95bd614776f590e3cc85bee508c8407ed35d9fe122edc9cdd26cacb"},"schema_version":"1.0","source":{"id":"1904.11606","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11606","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11606v2","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11606","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZQYLLEGCIBIB","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZQYLLEGCIBIBQB2X","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZQYLLEGC","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:06eaa914633922f1956a6ba2682553005f5c45050bfbef117dcfc9f2d2de3c05","target":"graph","created_at":"2026-05-17T23:43:14Z","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 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 ","authors_text":"Mina Dalirrooyfard, Nicole Wein, Nikhil Vyas, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T22:00:54Z","title":"Approximation Algorithms for Min-Distance Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11606","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:e6466e3a0e14a95b581a5e343003b60cafd820cad1487889330ebc3f86b45842","target":"record","created_at":"2026-05-17T23:43:14Z","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":"bafaba1ef6787a16264f57d6ca169ad5156a57798007f7df7179113e8443cfc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T22:00:54Z","title_canon_sha256":"6558131cf95bd614776f590e3cc85bee508c8407ed35d9fe122edc9cdd26cacb"},"schema_version":"1.0","source":{"id":"1904.11606","kind":"arxiv","version":2}},"canonical_sha256":"cc30b590c2405018075721b8610e65654da42915dc0af6e3991fbc2db7d271a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc30b590c2405018075721b8610e65654da42915dc0af6e3991fbc2db7d271a0","first_computed_at":"2026-05-17T23:43:14.447100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:14.447100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iDe1dxsTrKrdGaYshgQtodks4mAHaj4xRQHnioV1TSeJFDytoxYvrnup79c0wSyvOFOFme2zBqo3KVX0YJ+RCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:14.447578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11606","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6466e3a0e14a95b581a5e343003b60cafd820cad1487889330ebc3f86b45842","sha256:06eaa914633922f1956a6ba2682553005f5c45050bfbef117dcfc9f2d2de3c05"],"state_sha256":"3135d67b5bb86d7f2e6f2554b2a3a4ed206110bf6faff0aba5c8085b04bcdaf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5a9XVxlzkMIDSBKYYYBngi6NTuh5d6el5hTbSrFeE4j4K3oz7jhUu3h+IKVM5U4dco1Z6dcVL4bzSDGaN6fCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:01:39.368309Z","bundle_sha256":"ee38ad6d11d8bae8073feb7fd15d1e57a76719bf2534aea1e5fac4ce56a00847"}}