{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VWM22JUYJJB4INJSEAOEDDFLBD","short_pith_number":"pith:VWM22JUY","canonical_record":{"source":{"id":"1905.07533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-18T04:06:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c45a5c8e4fabb340d082d76aa79866edc78b2a02c82569832a72d476422a1c0e","abstract_canon_sha256":"8431e860c22271e5e2e6db2921269e3afced10a2d336f8f0b38c689f846ffa78"},"schema_version":"1.0"},"canonical_sha256":"ad99ad26984a43c43532201c418cab08eca4e18994739585c34ee7affa4d4cd2","source":{"kind":"arxiv","id":"1905.07533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07533","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07533v1","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07533","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"VWM22JUYJJB4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VWM22JUYJJB4INJS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VWM22JUY","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VWM22JUYJJB4INJSEAOEDDFLBD","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-18T04:06:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c45a5c8e4fabb340d082d76aa79866edc78b2a02c82569832a72d476422a1c0e","abstract_canon_sha256":"8431e860c22271e5e2e6db2921269e3afced10a2d336f8f0b38c689f846ffa78"},"schema_version":"1.0"},"canonical_sha256":"ad99ad26984a43c43532201c418cab08eca4e18994739585c34ee7affa4d4cd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:49.427206Z","signature_b64":"eTwmpUqV3UiFdk93w98cq2A4ob5tKzU5GrKuR59I2x0hDzntSEUwfMIO+KR/8Dto9bW9HQqgTVcGFahKfCPYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad99ad26984a43c43532201c418cab08eca4e18994739585c34ee7affa4d4cd2","last_reissued_at":"2026-05-17T23:45:49.426451Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:49.426451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07533","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-05-17T23:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWbm7t8PCSZmVDjh/cIuWTfugPRbGbIjk66ppukFfmxzaaIoTjNVdyRAf/AZAn44hdOJhtxYw2W8RyY6clWjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:58:36.175002Z"},"content_sha256":"869eab6bebab44999b24a45a9d8ca88705276dd484b6032fad134acacfe4abf6","schema_version":"1.0","event_id":"sha256:869eab6bebab44999b24a45a9d8ca88705276dd484b6032fad134acacfe4abf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VWM22JUYJJB4INJSEAOEDDFLBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Massively Parallel Computation via Remote Memory Access","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":"2019-05-18T04:06:43Z","abstract_excerpt":"We introduce the Adaptive Massively Parallel Computation (AMPC) model, which is an extension of the Massively Parallel Computation (MPC) model. At a high level, the AMPC model strengthens the MPC model by storing all messages sent within a round in a distributed data store. In the following round, all machines are provided with random read access to the data store, subject to the same constraints on the total amount of communication as in the MPC model. Our model is inspired by the previous empirical studies of distributed graph algorithms using MapReduce and a distributed hash table service.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07533","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"},"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-05-17T23:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUhLx0Jd/wDwHrCTGyNWuiS5yHHXBH2S3t8/aieF+rQc+GkPLsCICwpiX1kRN+D5mfQn9YlQ+sSIa5lEJKUWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:58:36.175696Z"},"content_sha256":"a62e8925404a3d0dc3890068bab7a4678462d9ba3a88dc369d1c2e0e0e697786","schema_version":"1.0","event_id":"sha256:a62e8925404a3d0dc3890068bab7a4678462d9ba3a88dc369d1c2e0e0e697786"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWM22JUYJJB4INJSEAOEDDFLBD/bundle.json","state_url":"https://pith.science/pith/VWM22JUYJJB4INJSEAOEDDFLBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWM22JUYJJB4INJSEAOEDDFLBD/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-05-25T19:58:36Z","links":{"resolver":"https://pith.science/pith/VWM22JUYJJB4INJSEAOEDDFLBD","bundle":"https://pith.science/pith/VWM22JUYJJB4INJSEAOEDDFLBD/bundle.json","state":"https://pith.science/pith/VWM22JUYJJB4INJSEAOEDDFLBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWM22JUYJJB4INJSEAOEDDFLBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VWM22JUYJJB4INJSEAOEDDFLBD","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":"8431e860c22271e5e2e6db2921269e3afced10a2d336f8f0b38c689f846ffa78","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-18T04:06:43Z","title_canon_sha256":"c45a5c8e4fabb340d082d76aa79866edc78b2a02c82569832a72d476422a1c0e"},"schema_version":"1.0","source":{"id":"1905.07533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07533","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07533v1","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07533","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"VWM22JUYJJB4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VWM22JUYJJB4INJS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VWM22JUY","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:a62e8925404a3d0dc3890068bab7a4678462d9ba3a88dc369d1c2e0e0e697786","target":"graph","created_at":"2026-05-17T23:45:49Z","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"},"paper":{"abstract_excerpt":"We introduce the Adaptive Massively Parallel Computation (AMPC) model, which is an extension of the Massively Parallel Computation (MPC) model. At a high level, the AMPC model strengthens the MPC model by storing all messages sent within a round in a distributed data store. In the following round, all machines are provided with random read access to the data store, subject to the same constraints on the total amount of communication as in the MPC model. Our model is inspired by the previous empirical studies of distributed graph algorithms using MapReduce and a distributed hash table service.\n","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":"2019-05-18T04:06:43Z","title":"Massively Parallel Computation via Remote Memory Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07533","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:869eab6bebab44999b24a45a9d8ca88705276dd484b6032fad134acacfe4abf6","target":"record","created_at":"2026-05-17T23:45:49Z","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":"8431e860c22271e5e2e6db2921269e3afced10a2d336f8f0b38c689f846ffa78","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-18T04:06:43Z","title_canon_sha256":"c45a5c8e4fabb340d082d76aa79866edc78b2a02c82569832a72d476422a1c0e"},"schema_version":"1.0","source":{"id":"1905.07533","kind":"arxiv","version":1}},"canonical_sha256":"ad99ad26984a43c43532201c418cab08eca4e18994739585c34ee7affa4d4cd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad99ad26984a43c43532201c418cab08eca4e18994739585c34ee7affa4d4cd2","first_computed_at":"2026-05-17T23:45:49.426451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:49.426451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eTwmpUqV3UiFdk93w98cq2A4ob5tKzU5GrKuR59I2x0hDzntSEUwfMIO+KR/8Dto9bW9HQqgTVcGFahKfCPYCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:49.427206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:869eab6bebab44999b24a45a9d8ca88705276dd484b6032fad134acacfe4abf6","sha256:a62e8925404a3d0dc3890068bab7a4678462d9ba3a88dc369d1c2e0e0e697786"],"state_sha256":"e517837e74170ce277addfbd85580de18b9f95dc6db66eab51bea3728fc1929c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mb+Mafg0TPSGeRMG8guNeHgfYM5p5TJ5BdPHxKXHYcbA8zHWln12UehNgYrabI3mk18tsR7ZZ58GwQHX6hvSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:58:36.178990Z","bundle_sha256":"e6697e1257ac83e81749a1d78cc337fd8934eb1383f778a6c4f98632594637e0"}}