{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JRLSLDWK3E3BRJGYNM2IXGM7UF","short_pith_number":"pith:JRLSLDWK","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"},"canonical_sha256":"4c57258ecad93618a4d86b348b999fa149b64e0f8cf07a63eaa011d719639f48","source":{"kind":"arxiv","id":"1903.05956","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05956","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05956v2","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05956","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"JRLSLDWK3E3B","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"JRLSLDWK3E3BRJGY","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"JRLSLDWK","created_at":"2026-07-05T00:16:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JRLSLDWK3E3BRJGYNM2IXGM7UF","target":"record","payload":{"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"},"canonical_sha256":"4c57258ecad93618a4d86b348b999fa149b64e0f8cf07a63eaa011d719639f48","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"},"source_kind":"arxiv","source_id":"1903.05956","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-07-05T00:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88s/2BVvgJ97oeTbPknQkPWYhO1aX6rxaKMOXbb2UDX+vQauPU0FyU1rWYe0i4wPntq2Tr2FLdr+FGdLZ1S5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T01:39:14.096264Z"},"content_sha256":"f484fc1b28a646f257e2173b52b75d19fc46a1d4f680c7d590b944c1123ea9a1","schema_version":"1.0","event_id":"sha256:f484fc1b28a646f257e2173b52b75d19fc46a1d4f680c7d590b944c1123ea9a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JRLSLDWK3E3BRJGYNM2IXGM7UF","target":"graph","payload":{"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"},"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-07-05T00:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8zSozfbi8hk3EDQa1xDpMFp/R4s0JizPlIS0q9y5JmcCK29YS6Q3a4WOSu0qW0SbKVpulsppjq4CBvWGutRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T01:39:14.096799Z"},"content_sha256":"60fa2cab4c2a31737a5a133a18f8a4ae9e878f97efa3817634b65a40845f32df","schema_version":"1.0","event_id":"sha256:60fa2cab4c2a31737a5a133a18f8a4ae9e878f97efa3817634b65a40845f32df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/bundle.json","state_url":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/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-08-16T01:39:14Z","links":{"resolver":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF","bundle":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/bundle.json","state":"https://pith.science/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRLSLDWK3E3BRJGYNM2IXGM7UF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JRLSLDWK3E3BRJGYNM2IXGM7UF","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":"19af4eb56736439bf7156b10ef295569eb1e765bb88e5e136474d85879d16923","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-14T12:54:11Z","title_canon_sha256":"2a7d16dd91e082390cec0c863c1f70d99070fb924e34241a78ae120365457798"},"schema_version":"1.0","source":{"id":"1903.05956","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05956","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05956v2","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05956","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"JRLSLDWK3E3B","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"JRLSLDWK3E3BRJGY","created_at":"2026-07-05T00:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"JRLSLDWK","created_at":"2026-07-05T00:16:03Z"}],"graph_snapshots":[{"event_id":"sha256:60fa2cab4c2a31737a5a133a18f8a4ae9e878f97efa3817634b65a40845f32df","target":"graph","created_at":"2026-07-05T00:16:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.05956/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dean Leitersdorf, Janne H. Korhonen, Keren Censor-Hillel, Michal Dory","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-14T12:54:11Z","title":"Fast Approximate Shortest Paths in the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05956","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:f484fc1b28a646f257e2173b52b75d19fc46a1d4f680c7d590b944c1123ea9a1","target":"record","created_at":"2026-07-05T00:16:03Z","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":"19af4eb56736439bf7156b10ef295569eb1e765bb88e5e136474d85879d16923","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-14T12:54:11Z","title_canon_sha256":"2a7d16dd91e082390cec0c863c1f70d99070fb924e34241a78ae120365457798"},"schema_version":"1.0","source":{"id":"1903.05956","kind":"arxiv","version":2}},"canonical_sha256":"4c57258ecad93618a4d86b348b999fa149b64e0f8cf07a63eaa011d719639f48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c57258ecad93618a4d86b348b999fa149b64e0f8cf07a63eaa011d719639f48","first_computed_at":"2026-07-05T00:16:03.367452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:03.367452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MlW1h7Vl78j6hn7xkxUhV31G6WXJOH/RoVli4uoAzHimh319lX2UpNlK3SuNnMcV5VdUsthL3O1+RnaNHF4kDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:03.367920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05956","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f484fc1b28a646f257e2173b52b75d19fc46a1d4f680c7d590b944c1123ea9a1","sha256:60fa2cab4c2a31737a5a133a18f8a4ae9e878f97efa3817634b65a40845f32df"],"state_sha256":"7fada4154f55a817ea86c43b225966683b0ccefb79c4f3d4f7c5155ab8a921e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kepY3YpHumaODDjQYsCS0ANf8wJFCwIFuhLEZ1dF1o2WRmezEa6+l+g4cM0/2KwLF2FF5vZ+GwqPtZHEiOVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T01:39:14.100360Z","bundle_sha256":"dd73e2c73d3e488cac1a9d003309303d726d6a9aa88405e77f8e54753664ef42"}}