{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5MBUPVHUPLLCKKZHXD7KPY6DZO","short_pith_number":"pith:5MBUPVHU","canonical_record":{"source":{"id":"1801.08766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-01-26T11:44:15Z","cross_cats_sorted":["cs.PL","cs.SE"],"title_canon_sha256":"226cf3db6eb1119c360aa18f77ab4ff5653ebd06028bae923d13fd64c7cab088","abstract_canon_sha256":"792dd66a121157261029ad8e4b7ff018c13660e1658cd96ec6f4be9de4f8f655"},"schema_version":"1.0"},"canonical_sha256":"eb0347d4f47ad6252b27b8fea7e3c3cbb3cf80a980c72561bca57136c77aecc3","source":{"kind":"arxiv","id":"1801.08766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08766","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08766v1","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08766","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"pith_short_12","alias_value":"5MBUPVHUPLLC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5MBUPVHUPLLCKKZH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5MBUPVHU","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5MBUPVHUPLLCKKZHXD7KPY6DZO","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-01-26T11:44:15Z","cross_cats_sorted":["cs.PL","cs.SE"],"title_canon_sha256":"226cf3db6eb1119c360aa18f77ab4ff5653ebd06028bae923d13fd64c7cab088","abstract_canon_sha256":"792dd66a121157261029ad8e4b7ff018c13660e1658cd96ec6f4be9de4f8f655"},"schema_version":"1.0"},"canonical_sha256":"eb0347d4f47ad6252b27b8fea7e3c3cbb3cf80a980c72561bca57136c77aecc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:22.011296Z","signature_b64":"z6dm/IrJqdmsGqKeTHKR+9CW2F4ep4t3PIQzgIX069WYR+f8ZNIi5BsS9MaQ/k4RSnmM1sFjS4PK3FJxded5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb0347d4f47ad6252b27b8fea7e3c3cbb3cf80a980c72561bca57136c77aecc3","last_reissued_at":"2026-05-18T00:24:22.010683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:22.010683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08766","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-18T00:24:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DP40YYlSSrBTrecKOEvA23J1Hfybs9oW1yGdQkjthm3caZdl4X7kxVIxGAc9TIu7zuwYl0rWIn+qJrXwh5ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:55:18.875463Z"},"content_sha256":"a4bf69292d0fda4dfc2237219f002ae6c85f2299c412d5ca7de2fe280714ebcf","schema_version":"1.0","event_id":"sha256:a4bf69292d0fda4dfc2237219f002ae6c85f2299c412d5ca7de2fe280714ebcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5MBUPVHUPLLCKKZHXD7KPY6DZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relational Equivalence Proofs Between Imperative and MapReduce Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SE"],"primary_cat":"cs.LO","authors_text":"Alexander Weigl, Bernhard Beckert, Mattias Ulbrich, Moritz Kiefer, Peter Sanders, Timo Bingmann","submitted_at":"2018-01-26T11:44:15Z","abstract_excerpt":"MapReduce frameworks are widely used for the implementation of distributed algorithms. However, translating imperative algorithms into these frameworks requires significant structural changes to the algorithm. As the costs of running faulty algorithms at scale can be severe, it is highly desirable to verify the correctness of the translation, i.e., to prove that the MapReduce version is equivalent to the imperative original. We present a novel approach for proving equivalence between imperative and MapReduce algorithms based on partitioning the equivalence proof into a sequence of equivalence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08766","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-18T00:24:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ksoRLL9g2/QJHDE5+3RctF1GElC4zanQkYYXq42e1teNYV3C0BWCevs+PvK29MK2+JX0Kc4jKdhyBYIpANLoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:55:18.876101Z"},"content_sha256":"52aa9e9b729a020a8b27d09912f909ad4aabce7c10b2e48ddc62d9fc3409ef36","schema_version":"1.0","event_id":"sha256:52aa9e9b729a020a8b27d09912f909ad4aabce7c10b2e48ddc62d9fc3409ef36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MBUPVHUPLLCKKZHXD7KPY6DZO/bundle.json","state_url":"https://pith.science/pith/5MBUPVHUPLLCKKZHXD7KPY6DZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MBUPVHUPLLCKKZHXD7KPY6DZO/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-24T11:55:18Z","links":{"resolver":"https://pith.science/pith/5MBUPVHUPLLCKKZHXD7KPY6DZO","bundle":"https://pith.science/pith/5MBUPVHUPLLCKKZHXD7KPY6DZO/bundle.json","state":"https://pith.science/pith/5MBUPVHUPLLCKKZHXD7KPY6DZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MBUPVHUPLLCKKZHXD7KPY6DZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5MBUPVHUPLLCKKZHXD7KPY6DZO","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":"792dd66a121157261029ad8e4b7ff018c13660e1658cd96ec6f4be9de4f8f655","cross_cats_sorted":["cs.PL","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-01-26T11:44:15Z","title_canon_sha256":"226cf3db6eb1119c360aa18f77ab4ff5653ebd06028bae923d13fd64c7cab088"},"schema_version":"1.0","source":{"id":"1801.08766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08766","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08766v1","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08766","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"pith_short_12","alias_value":"5MBUPVHUPLLC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5MBUPVHUPLLCKKZH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5MBUPVHU","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:52aa9e9b729a020a8b27d09912f909ad4aabce7c10b2e48ddc62d9fc3409ef36","target":"graph","created_at":"2026-05-18T00:24:22Z","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":"MapReduce frameworks are widely used for the implementation of distributed algorithms. However, translating imperative algorithms into these frameworks requires significant structural changes to the algorithm. As the costs of running faulty algorithms at scale can be severe, it is highly desirable to verify the correctness of the translation, i.e., to prove that the MapReduce version is equivalent to the imperative original. We present a novel approach for proving equivalence between imperative and MapReduce algorithms based on partitioning the equivalence proof into a sequence of equivalence ","authors_text":"Alexander Weigl, Bernhard Beckert, Mattias Ulbrich, Moritz Kiefer, Peter Sanders, Timo Bingmann","cross_cats":["cs.PL","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-01-26T11:44:15Z","title":"Relational Equivalence Proofs Between Imperative and MapReduce Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08766","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:a4bf69292d0fda4dfc2237219f002ae6c85f2299c412d5ca7de2fe280714ebcf","target":"record","created_at":"2026-05-18T00:24:22Z","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":"792dd66a121157261029ad8e4b7ff018c13660e1658cd96ec6f4be9de4f8f655","cross_cats_sorted":["cs.PL","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-01-26T11:44:15Z","title_canon_sha256":"226cf3db6eb1119c360aa18f77ab4ff5653ebd06028bae923d13fd64c7cab088"},"schema_version":"1.0","source":{"id":"1801.08766","kind":"arxiv","version":1}},"canonical_sha256":"eb0347d4f47ad6252b27b8fea7e3c3cbb3cf80a980c72561bca57136c77aecc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb0347d4f47ad6252b27b8fea7e3c3cbb3cf80a980c72561bca57136c77aecc3","first_computed_at":"2026-05-18T00:24:22.010683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:22.010683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z6dm/IrJqdmsGqKeTHKR+9CW2F4ep4t3PIQzgIX069WYR+f8ZNIi5BsS9MaQ/k4RSnmM1sFjS4PK3FJxded5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:22.011296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4bf69292d0fda4dfc2237219f002ae6c85f2299c412d5ca7de2fe280714ebcf","sha256:52aa9e9b729a020a8b27d09912f909ad4aabce7c10b2e48ddc62d9fc3409ef36"],"state_sha256":"85347911e61250f2449b2bcf6ab60fbed110a9886d1fb422d03fdd053d8231e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBzJgUqwvHfva4t00vRF+lrD+QzzZz2HI74sanipJfVF+b+bNeoWRzVibx55+8lpcRfZ4C+CZcFuqNPuDF2rAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:55:18.880039Z","bundle_sha256":"74e082c25d0eba515b2881f272d43f59ae24c46d06f325bfe079061386ca4e47"}}