{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SLV7YOJGUDPZ6J5ZZ6J77ST5RR","short_pith_number":"pith:SLV7YOJG","canonical_record":{"source":{"id":"1904.11601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T21:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"ea4b35052716228e9bb8b3f8c98f8c9fcebc4b9a902a20f1e6972a7b5b827f02","abstract_canon_sha256":"d8936d237a800af0359622bbe6877bb8fe1cb51ed205e473ea7aa2773c191c29"},"schema_version":"1.0"},"canonical_sha256":"92ebfc3926a0df9f27b9cf93ffca7d8c797f6172f46302c86ba353efaaf1984a","source":{"kind":"arxiv","id":"1904.11601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11601","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11601v1","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11601","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"SLV7YOJGUDPZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SLV7YOJGUDPZ6J5Z","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SLV7YOJG","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SLV7YOJGUDPZ6J5ZZ6J77ST5RR","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T21:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"ea4b35052716228e9bb8b3f8c98f8c9fcebc4b9a902a20f1e6972a7b5b827f02","abstract_canon_sha256":"d8936d237a800af0359622bbe6877bb8fe1cb51ed205e473ea7aa2773c191c29"},"schema_version":"1.0"},"canonical_sha256":"92ebfc3926a0df9f27b9cf93ffca7d8c797f6172f46302c86ba353efaaf1984a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:43.253942Z","signature_b64":"8GTwIe5murGc9nbLPfOFIDoy/MrCOCk6lvh22ayVdMoGs9+d9PA/2fvgAXU76CVxz/SD4v/fJjshYOYXEA1pAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ebfc3926a0df9f27b9cf93ffca7d8c797f6172f46302c86ba353efaaf1984a","last_reissued_at":"2026-05-17T23:47:43.253474Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:43.253474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11601","source_version":1,"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:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zqv1L80jsLhsSuACgCwVTevmYle/sZ54huNrBkNHm5l/yXUaEj7WclvGnxlEPqUZFEf/MaOxqWTsl1OECz25DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:54:25.371643Z"},"content_sha256":"53869abfac59feb4e1359275e426496a910883227ea957bf478e437e6a679b20","schema_version":"1.0","event_id":"sha256:53869abfac59feb4e1359275e426496a910883227ea957bf478e437e6a679b20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SLV7YOJGUDPZ6J5ZZ6J77ST5RR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Approximation Algorithms for Bichromatic Graph Diameter and Related 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","submitted_at":"2019-04-25T21:45:29Z","abstract_excerpt":"Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortest paths distance) and Radius (the smallest distance for which a \"center\" node can reach all other nodes). The natural and important $ST$-variant considers two subsets $S$ and $T$ of the vertex set and lets the $ST$-diameter be the maximum distance between a node in $S$ and a node in $T$, and the $ST$-radius be the minimum distance for a node of $S$ to reach all nodes of $T$. The bichromatic variant is the special case in which $S$ and $T$ partition the vertex set.\n  In this paper we present a co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11601","kind":"arxiv","version":1},"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:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RUsXhsSg2voKZQDeUinSELkmjZEo7iQ4hx408uPinrVWUrBiSeS3U4PulBm2JCj5puvs3ZmxSlxMfbXL3fFMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:54:25.372170Z"},"content_sha256":"99d55a0b8cc8d0a463ffe0643c0407cfbaa087393e01b304b0fac059fb68ccec","schema_version":"1.0","event_id":"sha256:99d55a0b8cc8d0a463ffe0643c0407cfbaa087393e01b304b0fac059fb68ccec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/bundle.json","state_url":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/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-07-04T20:54:25Z","links":{"resolver":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR","bundle":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/bundle.json","state":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SLV7YOJGUDPZ6J5ZZ6J77ST5RR","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":"d8936d237a800af0359622bbe6877bb8fe1cb51ed205e473ea7aa2773c191c29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T21:45:29Z","title_canon_sha256":"ea4b35052716228e9bb8b3f8c98f8c9fcebc4b9a902a20f1e6972a7b5b827f02"},"schema_version":"1.0","source":{"id":"1904.11601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11601","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11601v1","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11601","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"SLV7YOJGUDPZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SLV7YOJGUDPZ6J5Z","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SLV7YOJG","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:99d55a0b8cc8d0a463ffe0643c0407cfbaa087393e01b304b0fac059fb68ccec","target":"graph","created_at":"2026-05-17T23:47:43Z","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":"Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortest paths distance) and Radius (the smallest distance for which a \"center\" node can reach all other nodes). The natural and important $ST$-variant considers two subsets $S$ and $T$ of the vertex set and lets the $ST$-diameter be the maximum distance between a node in $S$ and a node in $T$, and the $ST$-radius be the minimum distance for a node of $S$ to reach all nodes of $T$. The bichromatic variant is the special case in which $S$ and $T$ partition the vertex set.\n  In this paper we present a co","authors_text":"Mina Dalirrooyfard, Nicole Wein, Nikhil Vyas, Virginia Vassilevska Williams","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T21:45:29Z","title":"Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11601","kind":"arxiv","version":1},"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:53869abfac59feb4e1359275e426496a910883227ea957bf478e437e6a679b20","target":"record","created_at":"2026-05-17T23:47:43Z","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":"d8936d237a800af0359622bbe6877bb8fe1cb51ed205e473ea7aa2773c191c29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T21:45:29Z","title_canon_sha256":"ea4b35052716228e9bb8b3f8c98f8c9fcebc4b9a902a20f1e6972a7b5b827f02"},"schema_version":"1.0","source":{"id":"1904.11601","kind":"arxiv","version":1}},"canonical_sha256":"92ebfc3926a0df9f27b9cf93ffca7d8c797f6172f46302c86ba353efaaf1984a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92ebfc3926a0df9f27b9cf93ffca7d8c797f6172f46302c86ba353efaaf1984a","first_computed_at":"2026-05-17T23:47:43.253474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:43.253474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8GTwIe5murGc9nbLPfOFIDoy/MrCOCk6lvh22ayVdMoGs9+d9PA/2fvgAXU76CVxz/SD4v/fJjshYOYXEA1pAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:43.253942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53869abfac59feb4e1359275e426496a910883227ea957bf478e437e6a679b20","sha256:99d55a0b8cc8d0a463ffe0643c0407cfbaa087393e01b304b0fac059fb68ccec"],"state_sha256":"e2c269794901a5913ade432ae3f1168a42d98e00748bdc3c9fd7b56b77a5cab1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLx26EAmAfNjXmsMq1vUqg242TrPb09xnGcWPZWzx13G88Nt6Z4O6rucZJQqbqha4Xod7uIXhl09zFWuofgeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:54:25.374476Z","bundle_sha256":"40e0281b4d6badac79d4325abf5d1c5db2315b13b942b8da4eefb7490913f2cd"}}