{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JRLSLDWK3E3BRJGYNM2IXGM7UF","short_pith_number":"pith:JRLSLDWK","schema_version":"1.0","canonical_sha256":"4c57258ecad93618a4d86b348b999fa149b64e0f8cf07a63eaa011d719639f48","source":{"kind":"arxiv","id":"1903.05956","version":2},"attestation_state":"computed","paper":{"title":"Fast Approximate Shortest Paths in the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dean Leitersdorf, Janne H. Korhonen, Keren Censor-Hillel, Michal Dory","submitted_at":"2019-03-14T12:54:11Z","abstract_excerpt":"We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include:\n  -- A $(2+\\epsilon)$-approximation for all-pairs shortest paths in $O(\\log^2{n} / \\epsilon)$ rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\n  -- A $(1+\\epsilon)$-approximation for multi-source shortest paths from $O(\\sqrt{n})$ sources in $O(\\log^2{n} / \\epsilon)$ rounds on weighted undirected graphs. This is th"},"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":"1903.05956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-14T12:54:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2a7d16dd91e082390cec0c863c1f70d99070fb924e34241a78ae120365457798","abstract_canon_sha256":"19af4eb56736439bf7156b10ef295569eb1e765bb88e5e136474d85879d16923"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:03.367920Z","signature_b64":"MlW1h7Vl78j6hn7xkxUhV31G6WXJOH/RoVli4uoAzHimh319lX2UpNlK3SuNnMcV5VdUsthL3O1+RnaNHF4kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c57258ecad93618a4d86b348b999fa149b64e0f8cf07a63eaa011d719639f48","last_reissued_at":"2026-07-05T00:16:03.367452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:03.367452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximate Shortest Paths in the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dean Leitersdorf, Janne H. Korhonen, Keren Censor-Hillel, Michal Dory","submitted_at":"2019-03-14T12:54:11Z","abstract_excerpt":"We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include:\n  -- A $(2+\\epsilon)$-approximation for all-pairs shortest paths in $O(\\log^2{n} / \\epsilon)$ rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\n  -- A $(1+\\epsilon)$-approximation for multi-source shortest paths from $O(\\sqrt{n})$ sources in $O(\\log^2{n} / \\epsilon)$ rounds on weighted undirected graphs. This is th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05956","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/1903.05956/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":"1903.05956","created_at":"2026-07-05T00:16:03.367509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05956v2","created_at":"2026-07-05T00:16:03.367509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05956","created_at":"2026-07-05T00:16:03.367509+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRLSLDWK3E3B","created_at":"2026-07-05T00:16:03.367509+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRLSLDWK3E3BRJGY","created_at":"2026-07-05T00:16:03.367509+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRLSLDWK","created_at":"2026-07-05T00:16:03.367509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.01597","citing_title":"Shortest Paths in a Hybrid Network Model","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF","json":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF.json","graph_json":"https://pith.science/api/pith-number/JRLSLDWK3E3BRJGYNM2IXGM7UF/graph.json","events_json":"https://pith.science/api/pith-number/JRLSLDWK3E3BRJGYNM2IXGM7UF/events.json","paper":"https://pith.science/paper/JRLSLDWK"},"agent_actions":{"view_html":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF","download_json":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF.json","view_paper":"https://pith.science/paper/JRLSLDWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05956&json=true","fetch_graph":"https://pith.science/api/pith-number/JRLSLDWK3E3BRJGYNM2IXGM7UF/graph.json","fetch_events":"https://pith.science/api/pith-number/JRLSLDWK3E3BRJGYNM2IXGM7UF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/action/storage_attestation","attest_author":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/action/author_attestation","sign_citation":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/action/citation_signature","submit_replication":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/action/replication_record"}},"created_at":"2026-07-05T00:16:03.367509+00:00","updated_at":"2026-07-05T00:16:03.367509+00:00"}