{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SLV7YOJGUDPZ6J5ZZ6J77ST5RR","short_pith_number":"pith:SLV7YOJG","schema_version":"1.0","canonical_sha256":"92ebfc3926a0df9f27b9cf93ffca7d8c797f6172f46302c86ba353efaaf1984a","source":{"kind":"arxiv","id":"1904.11601","version":1},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.11601","created_at":"2026-05-17T23:47:43.253548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11601v1","created_at":"2026-05-17T23:47:43.253548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11601","created_at":"2026-05-17T23:47:43.253548+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLV7YOJGUDPZ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLV7YOJGUDPZ6J5Z","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLV7YOJG","created_at":"2026-05-18T12:33:27.125529+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/SLV7YOJGUDPZ6J5ZZ6J77ST5RR","json":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR.json","graph_json":"https://pith.science/api/pith-number/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/graph.json","events_json":"https://pith.science/api/pith-number/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/events.json","paper":"https://pith.science/paper/SLV7YOJG"},"agent_actions":{"view_html":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR","download_json":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR.json","view_paper":"https://pith.science/paper/SLV7YOJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11601&json=true","fetch_graph":"https://pith.science/api/pith-number/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/graph.json","fetch_events":"https://pith.science/api/pith-number/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/action/storage_attestation","attest_author":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/action/author_attestation","sign_citation":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/action/citation_signature","submit_replication":"https://pith.science/pith/SLV7YOJGUDPZ6J5ZZ6J77ST5RR/action/replication_record"}},"created_at":"2026-05-17T23:47:43.253548+00:00","updated_at":"2026-05-17T23:47:43.253548+00:00"}