{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VBFXCOQGVTHLYYICTARG6QHJ4T","short_pith_number":"pith:VBFXCOQG","canonical_record":{"source":{"id":"2003.01254","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T23:52:06Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0d3d2461b5e4f2ce57fc040f637dd3adf9da56a685baf6622a0e55d3e5953f85","abstract_canon_sha256":"0b16359fc01d36542e6b3136bae10c02b079a8bd6b68ad4e1bb8e92eb78df43e"},"schema_version":"1.0"},"canonical_sha256":"a84b713a06accebc610298226f40e9e4daada680bd08ddb8ffc1f9eb28941cb6","source":{"kind":"arxiv","id":"2003.01254","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.01254","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"2003.01254v6","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.01254","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"VBFXCOQGVTHL","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_16","alias_value":"VBFXCOQGVTHLYYIC","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_8","alias_value":"VBFXCOQG","created_at":"2026-07-05T02:52:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VBFXCOQGVTHLYYICTARG6QHJ4T","target":"record","payload":{"canonical_record":{"source":{"id":"2003.01254","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T23:52:06Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0d3d2461b5e4f2ce57fc040f637dd3adf9da56a685baf6622a0e55d3e5953f85","abstract_canon_sha256":"0b16359fc01d36542e6b3136bae10c02b079a8bd6b68ad4e1bb8e92eb78df43e"},"schema_version":"1.0"},"canonical_sha256":"a84b713a06accebc610298226f40e9e4daada680bd08ddb8ffc1f9eb28941cb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:56.670006Z","signature_b64":"aGDWXKw650+rYtA3mB0lMNNpBNsrEy5bur4Vm78q06TMQl5iFNBRFvf2UkJzzlwJDErc8mX02oU8BisVnmKuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a84b713a06accebc610298226f40e9e4daada680bd08ddb8ffc1f9eb28941cb6","last_reissued_at":"2026-07-05T02:52:56.669555Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:56.669555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.01254","source_version":6,"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-05T02:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wx738KsCnx1n2zpWG9fuBburG+dHMmLb2+fvlqLqdqWsbCAZmV6Hv5TfoueQd+t/RJw2k26VVRkyeWvKnvrYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:23:13.358548Z"},"content_sha256":"319ecfde8d93611ee51bd41e8f5c5209c7eb7c1fdff3d691733e57d7eb17fbfa","schema_version":"1.0","event_id":"sha256:319ecfde8d93611ee51bd41e8f5c5209c7eb7c1fdff3d691733e57d7eb17fbfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VBFXCOQGVTHLYYICTARG6QHJ4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Massively Parallel Algorithms for Distance Approximation and Spanners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovi\\'c, Yasamin Nazari","submitted_at":"2020-03-02T23:52:06Z","abstract_excerpt":"Over the past decade, there has been increasing interest in distributed/parallel algorithms for processing large-scale graphs. By now, we have quite fast algorithms -- usually sublogarithmic-time and often $poly(\\log\\log n)$-time, or even faster -- for a number of fundamental graph problems in the massively parallel computation (MPC) model. This model is a widely-adopted theoretical abstraction of MapReduce style settings, where a number of machines communicate in an all-to-all manner to process large-scale data. Contributing to this line of work on MPC graph algorithms, we present $poly(\\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.01254","kind":"arxiv","version":6},"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/2003.01254/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-05T02:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vFX/Zezm8yqsMUTu4DZ8MZmQwEWFIG28HL/IYBM4RJi2jOrRzVlYQdrnjEj+fHRrxmUWIrvIohz87XI6gYDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:23:13.359326Z"},"content_sha256":"38ddfee39389b3b3b9690e5e50e15c46609c1ce85bd71d94b7e4ffbe0baaab24","schema_version":"1.0","event_id":"sha256:38ddfee39389b3b3b9690e5e50e15c46609c1ce85bd71d94b7e4ffbe0baaab24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBFXCOQGVTHLYYICTARG6QHJ4T/bundle.json","state_url":"https://pith.science/pith/VBFXCOQGVTHLYYICTARG6QHJ4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBFXCOQGVTHLYYICTARG6QHJ4T/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-04T14:23:13Z","links":{"resolver":"https://pith.science/pith/VBFXCOQGVTHLYYICTARG6QHJ4T","bundle":"https://pith.science/pith/VBFXCOQGVTHLYYICTARG6QHJ4T/bundle.json","state":"https://pith.science/pith/VBFXCOQGVTHLYYICTARG6QHJ4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBFXCOQGVTHLYYICTARG6QHJ4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VBFXCOQGVTHLYYICTARG6QHJ4T","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":"0b16359fc01d36542e6b3136bae10c02b079a8bd6b68ad4e1bb8e92eb78df43e","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T23:52:06Z","title_canon_sha256":"0d3d2461b5e4f2ce57fc040f637dd3adf9da56a685baf6622a0e55d3e5953f85"},"schema_version":"1.0","source":{"id":"2003.01254","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.01254","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"2003.01254v6","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.01254","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"VBFXCOQGVTHL","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_16","alias_value":"VBFXCOQGVTHLYYIC","created_at":"2026-07-05T02:52:56Z"},{"alias_kind":"pith_short_8","alias_value":"VBFXCOQG","created_at":"2026-07-05T02:52:56Z"}],"graph_snapshots":[{"event_id":"sha256:38ddfee39389b3b3b9690e5e50e15c46609c1ce85bd71d94b7e4ffbe0baaab24","target":"graph","created_at":"2026-07-05T02:52:56Z","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/2003.01254/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Over the past decade, there has been increasing interest in distributed/parallel algorithms for processing large-scale graphs. By now, we have quite fast algorithms -- usually sublogarithmic-time and often $poly(\\log\\log n)$-time, or even faster -- for a number of fundamental graph problems in the massively parallel computation (MPC) model. This model is a widely-adopted theoretical abstraction of MapReduce style settings, where a number of machines communicate in an all-to-all manner to process large-scale data. Contributing to this line of work on MPC graph algorithms, we present $poly(\\log ","authors_text":"Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovi\\'c, Yasamin Nazari","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T23:52:06Z","title":"Massively Parallel Algorithms for Distance Approximation and Spanners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.01254","kind":"arxiv","version":6},"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:319ecfde8d93611ee51bd41e8f5c5209c7eb7c1fdff3d691733e57d7eb17fbfa","target":"record","created_at":"2026-07-05T02:52:56Z","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":"0b16359fc01d36542e6b3136bae10c02b079a8bd6b68ad4e1bb8e92eb78df43e","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T23:52:06Z","title_canon_sha256":"0d3d2461b5e4f2ce57fc040f637dd3adf9da56a685baf6622a0e55d3e5953f85"},"schema_version":"1.0","source":{"id":"2003.01254","kind":"arxiv","version":6}},"canonical_sha256":"a84b713a06accebc610298226f40e9e4daada680bd08ddb8ffc1f9eb28941cb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a84b713a06accebc610298226f40e9e4daada680bd08ddb8ffc1f9eb28941cb6","first_computed_at":"2026-07-05T02:52:56.669555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:52:56.669555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aGDWXKw650+rYtA3mB0lMNNpBNsrEy5bur4Vm78q06TMQl5iFNBRFvf2UkJzzlwJDErc8mX02oU8BisVnmKuCw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:52:56.670006Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.01254","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:319ecfde8d93611ee51bd41e8f5c5209c7eb7c1fdff3d691733e57d7eb17fbfa","sha256:38ddfee39389b3b3b9690e5e50e15c46609c1ce85bd71d94b7e4ffbe0baaab24"],"state_sha256":"0430ebfafe0836b7d67ca2676783c37f552ee3c506e631c5b7466298fb476277"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DjOlRH7yrHeVcROWdWg78o9Bey0aAJoOcRK/XN3K6+kHh4uG/e5V6DsmhbkdmHxMSkadmZ3VM0XRb5qiteNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:23:13.371709Z","bundle_sha256":"a9ad6da9c8dc2b89df15f7f7a535afeea13a5620bd37dbc4f4d179f2f2cb6a87"}}