{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IOUA4MXXDD2WF7F2DYHCYGZNT5","short_pith_number":"pith:IOUA4MXX","canonical_record":{"source":{"id":"2009.11552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-24T08:47:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4ea71dad5c7ca21568607fa340e61a39cfc1f6ac9334d378e975b304838222f5","abstract_canon_sha256":"1d6af531817263b8a6637807cd1755e4ebf37ddc07e91579c6d422df6e0dfff5"},"schema_version":"1.0"},"canonical_sha256":"43a80e32f718f562fcba1e0e2c1b2d9f74e95995b4ca4d7c18f3306ddb712bf5","source":{"kind":"arxiv","id":"2009.11552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11552","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11552v1","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11552","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_12","alias_value":"IOUA4MXXDD2W","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_16","alias_value":"IOUA4MXXDD2WF7F2","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_8","alias_value":"IOUA4MXX","created_at":"2026-07-05T01:37:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IOUA4MXXDD2WF7F2DYHCYGZNT5","target":"record","payload":{"canonical_record":{"source":{"id":"2009.11552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-24T08:47:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4ea71dad5c7ca21568607fa340e61a39cfc1f6ac9334d378e975b304838222f5","abstract_canon_sha256":"1d6af531817263b8a6637807cd1755e4ebf37ddc07e91579c6d422df6e0dfff5"},"schema_version":"1.0"},"canonical_sha256":"43a80e32f718f562fcba1e0e2c1b2d9f74e95995b4ca4d7c18f3306ddb712bf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:46.876541Z","signature_b64":"FljX/Q2fYwXwImcD15wwYeSFTlbpl4SH6G8uxpt3vXZWxHoDKwbl1vaJ8W5+h+eeTLdVtPaGYQ+BH5vdY3sDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43a80e32f718f562fcba1e0e2c1b2d9f74e95995b4ca4d7c18f3306ddb712bf5","last_reissued_at":"2026-07-05T01:37:46.876118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:46.876118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.11552","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-07-05T01:37:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvITzH008d6WdT3Yf6xwrsWkRtjz4SRoI5GOios979l6eZ42k0yXgtCP0tf8WPZjVnUfAZ3TuE9oHphcpBh/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T10:46:46.652961Z"},"content_sha256":"9fcb5caaca5f67eca8d9185eeed2df28c723b5c673d2d09a5d94f46eda9acceb","schema_version":"1.0","event_id":"sha256:9fcb5caaca5f67eca8d9185eeed2df28c723b5c673d2d09a5d94f46eda9acceb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IOUA4MXXDD2WF7F2DYHCYGZNT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Hossein Esfandiari, Jakub {\\L}\\k{a}cki, Laxman Dhulipala, Soheil Behnezhad, Vahab Mirrokni, Warren Schudy","submitted_at":"2020-09-24T08:47:33Z","abstract_excerpt":"We study fundamental graph problems such as graph connectivity, minimum spanning forest (MSF), and approximate maximum (weight) matching in a distributed setting. In particular, we focus on the Adaptive Massively Parallel Computation (AMPC) model, which is a theoretical model that captures MapReduce-like computation augmented with a distributed hash table.\n  We show the first AMPC algorithms for all of the studied problems that run in a constant number of rounds and use only $O(n^\\epsilon)$ space per machine, where $0 < \\epsilon < 1$. Our results improve both upon the previous results in the A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11552","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.11552/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-05T01:37:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nqW7dXaVWUBkECpYFmzDIRxHxDgMt6C2QkHhjet3vydVnIr40BwR6SMc2L2af0vqfraM7b4yFSn1IO9lBKRSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T10:46:46.653376Z"},"content_sha256":"bac33f9352a0461660cf4afade8a28457785abbf386119ec77747f0f79286ff3","schema_version":"1.0","event_id":"sha256:bac33f9352a0461660cf4afade8a28457785abbf386119ec77747f0f79286ff3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOUA4MXXDD2WF7F2DYHCYGZNT5/bundle.json","state_url":"https://pith.science/pith/IOUA4MXXDD2WF7F2DYHCYGZNT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOUA4MXXDD2WF7F2DYHCYGZNT5/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-12T10:46:46Z","links":{"resolver":"https://pith.science/pith/IOUA4MXXDD2WF7F2DYHCYGZNT5","bundle":"https://pith.science/pith/IOUA4MXXDD2WF7F2DYHCYGZNT5/bundle.json","state":"https://pith.science/pith/IOUA4MXXDD2WF7F2DYHCYGZNT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOUA4MXXDD2WF7F2DYHCYGZNT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IOUA4MXXDD2WF7F2DYHCYGZNT5","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":"1d6af531817263b8a6637807cd1755e4ebf37ddc07e91579c6d422df6e0dfff5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-24T08:47:33Z","title_canon_sha256":"4ea71dad5c7ca21568607fa340e61a39cfc1f6ac9334d378e975b304838222f5"},"schema_version":"1.0","source":{"id":"2009.11552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11552","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11552v1","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11552","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_12","alias_value":"IOUA4MXXDD2W","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_16","alias_value":"IOUA4MXXDD2WF7F2","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_8","alias_value":"IOUA4MXX","created_at":"2026-07-05T01:37:46Z"}],"graph_snapshots":[{"event_id":"sha256:bac33f9352a0461660cf4afade8a28457785abbf386119ec77747f0f79286ff3","target":"graph","created_at":"2026-07-05T01:37:46Z","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/2009.11552/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study fundamental graph problems such as graph connectivity, minimum spanning forest (MSF), and approximate maximum (weight) matching in a distributed setting. In particular, we focus on the Adaptive Massively Parallel Computation (AMPC) model, which is a theoretical model that captures MapReduce-like computation augmented with a distributed hash table.\n  We show the first AMPC algorithms for all of the studied problems that run in a constant number of rounds and use only $O(n^\\epsilon)$ space per machine, where $0 < \\epsilon < 1$. Our results improve both upon the previous results in the A","authors_text":"Hossein Esfandiari, Jakub {\\L}\\k{a}cki, Laxman Dhulipala, Soheil Behnezhad, Vahab Mirrokni, Warren Schudy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-24T08:47:33Z","title":"Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11552","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:9fcb5caaca5f67eca8d9185eeed2df28c723b5c673d2d09a5d94f46eda9acceb","target":"record","created_at":"2026-07-05T01:37:46Z","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":"1d6af531817263b8a6637807cd1755e4ebf37ddc07e91579c6d422df6e0dfff5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-24T08:47:33Z","title_canon_sha256":"4ea71dad5c7ca21568607fa340e61a39cfc1f6ac9334d378e975b304838222f5"},"schema_version":"1.0","source":{"id":"2009.11552","kind":"arxiv","version":1}},"canonical_sha256":"43a80e32f718f562fcba1e0e2c1b2d9f74e95995b4ca4d7c18f3306ddb712bf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43a80e32f718f562fcba1e0e2c1b2d9f74e95995b4ca4d7c18f3306ddb712bf5","first_computed_at":"2026-07-05T01:37:46.876118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:37:46.876118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FljX/Q2fYwXwImcD15wwYeSFTlbpl4SH6G8uxpt3vXZWxHoDKwbl1vaJ8W5+h+eeTLdVtPaGYQ+BH5vdY3sDBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:37:46.876541Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.11552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fcb5caaca5f67eca8d9185eeed2df28c723b5c673d2d09a5d94f46eda9acceb","sha256:bac33f9352a0461660cf4afade8a28457785abbf386119ec77747f0f79286ff3"],"state_sha256":"98b3c9d711c502600a0606dbaf929752a1d1334d6f8d5c723b8988b68d91a8e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUA2oi1b2APvf9uemo6bNVzHoHtpOSFDG5XUI++zbIc4VT2U2NRKITMjbgdCfXR/V+ICe6HOSVNsSuWYr3xWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T10:46:46.656246Z","bundle_sha256":"f93abbef01012086480b2215c3a2d5faeec4f2a10f36b1c7fc22fb7d42c89c96"}}