{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:H3WILNAHMICZP2ZCIZZZ56YS5F","short_pith_number":"pith:H3WILNAH","canonical_record":{"source":{"id":"2205.14101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-27T17:11:20Z","cross_cats_sorted":[],"title_canon_sha256":"0c4d9457d8d5fb19b314c93fc728666ce2064f7a97fc6f1b3b967fc702d02f61","abstract_canon_sha256":"f4265342f51096cd683be5eb67b9684bb3bf53f5118a1c9a43972faef4600f2a"},"schema_version":"1.0"},"canonical_sha256":"3eec85b407620597eb2246739efb12e97036ff177aae739ad369a3174b04cc3d","source":{"kind":"arxiv","id":"2205.14101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14101","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14101v1","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14101","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"pith_short_12","alias_value":"H3WILNAHMICZ","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"H3WILNAHMICZP2ZC","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"H3WILNAH","created_at":"2026-07-05T04:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:H3WILNAHMICZP2ZCIZZZ56YS5F","target":"record","payload":{"canonical_record":{"source":{"id":"2205.14101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-27T17:11:20Z","cross_cats_sorted":[],"title_canon_sha256":"0c4d9457d8d5fb19b314c93fc728666ce2064f7a97fc6f1b3b967fc702d02f61","abstract_canon_sha256":"f4265342f51096cd683be5eb67b9684bb3bf53f5118a1c9a43972faef4600f2a"},"schema_version":"1.0"},"canonical_sha256":"3eec85b407620597eb2246739efb12e97036ff177aae739ad369a3174b04cc3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:01.480819Z","signature_b64":"dP/PCEvlubqJ16RopLCzp2fBMfVRHQnuRtwnvnx2/wS/FI1x3UlK6Gvr5YSYu0s6XBtp7uudlBoPW29Px5lhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eec85b407620597eb2246739efb12e97036ff177aae739ad369a3174b04cc3d","last_reissued_at":"2026-07-05T04:27:01.480293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:01.480293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.14101","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-05T04:27:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOO8yQ4wK0ooWOmlNaYEPKa3szD21aP4eTvfowKchEOldZTp3Bmg+iwS6DqdnFYBqINQvIDeUCUFq9xdMshNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T14:25:16.312657Z"},"content_sha256":"890c7b719d63eee0f8dde07a0fa82191667c1f16bd944910be380e4b9d723216","schema_version":"1.0","event_id":"sha256:890c7b719d63eee0f8dde07a0fa82191667c1f16bd944910be380e4b9d723216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:H3WILNAHMICZP2ZCIZZZ56YS5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Massively Parallel Algorithms for Cut Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hamed Saleh, Jan Olkowski, Marina Knittel, MohammadTaghi Hajiaghayi","submitted_at":"2022-05-27T17:11:20Z","abstract_excerpt":"We study the Weighted Min Cut problem in the Adaptive Massively Parallel Computation (AMPC) model. In 2019, Behnezhad et al. [3] introduced the AMPC model as an extension of the Massively Parallel Computation (MPC) model. In the past decade, research on highly scalable algorithms has had significant impact on many massive systems. The MPC model, introduced in 2010 by Karloff et al. [16], which is an abstraction of famous practical frameworks such as MapReduce, Hadoop, Flume, and Spark, has been at the forefront of this research. While great strides have been taken to create highly efficient MP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14101","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/2205.14101/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-05T04:27:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdfG4Wxk5/rltgsILAoncrv4RgjM9JzFApmTRe7yqiWYoqwrZwqk0aOy4pkb9yXktDorSzJxHktRkzfr2hkcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T14:25:16.313017Z"},"content_sha256":"dda5040c377a1cb9dafb01de8c45de808174a2444f9467707ab1e678ec16f2a8","schema_version":"1.0","event_id":"sha256:dda5040c377a1cb9dafb01de8c45de808174a2444f9467707ab1e678ec16f2a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3WILNAHMICZP2ZCIZZZ56YS5F/bundle.json","state_url":"https://pith.science/pith/H3WILNAHMICZP2ZCIZZZ56YS5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3WILNAHMICZP2ZCIZZZ56YS5F/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-19T14:25:16Z","links":{"resolver":"https://pith.science/pith/H3WILNAHMICZP2ZCIZZZ56YS5F","bundle":"https://pith.science/pith/H3WILNAHMICZP2ZCIZZZ56YS5F/bundle.json","state":"https://pith.science/pith/H3WILNAHMICZP2ZCIZZZ56YS5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3WILNAHMICZP2ZCIZZZ56YS5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:H3WILNAHMICZP2ZCIZZZ56YS5F","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":"f4265342f51096cd683be5eb67b9684bb3bf53f5118a1c9a43972faef4600f2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-27T17:11:20Z","title_canon_sha256":"0c4d9457d8d5fb19b314c93fc728666ce2064f7a97fc6f1b3b967fc702d02f61"},"schema_version":"1.0","source":{"id":"2205.14101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14101","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14101v1","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14101","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"pith_short_12","alias_value":"H3WILNAHMICZ","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"H3WILNAHMICZP2ZC","created_at":"2026-07-05T04:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"H3WILNAH","created_at":"2026-07-05T04:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:dda5040c377a1cb9dafb01de8c45de808174a2444f9467707ab1e678ec16f2a8","target":"graph","created_at":"2026-07-05T04:27:01Z","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/2205.14101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the Weighted Min Cut problem in the Adaptive Massively Parallel Computation (AMPC) model. In 2019, Behnezhad et al. [3] introduced the AMPC model as an extension of the Massively Parallel Computation (MPC) model. In the past decade, research on highly scalable algorithms has had significant impact on many massive systems. The MPC model, introduced in 2010 by Karloff et al. [16], which is an abstraction of famous practical frameworks such as MapReduce, Hadoop, Flume, and Spark, has been at the forefront of this research. While great strides have been taken to create highly efficient MP","authors_text":"Hamed Saleh, Jan Olkowski, Marina Knittel, MohammadTaghi Hajiaghayi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-27T17:11:20Z","title":"Adaptive Massively Parallel Algorithms for Cut Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14101","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:890c7b719d63eee0f8dde07a0fa82191667c1f16bd944910be380e4b9d723216","target":"record","created_at":"2026-07-05T04:27:01Z","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":"f4265342f51096cd683be5eb67b9684bb3bf53f5118a1c9a43972faef4600f2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-27T17:11:20Z","title_canon_sha256":"0c4d9457d8d5fb19b314c93fc728666ce2064f7a97fc6f1b3b967fc702d02f61"},"schema_version":"1.0","source":{"id":"2205.14101","kind":"arxiv","version":1}},"canonical_sha256":"3eec85b407620597eb2246739efb12e97036ff177aae739ad369a3174b04cc3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3eec85b407620597eb2246739efb12e97036ff177aae739ad369a3174b04cc3d","first_computed_at":"2026-07-05T04:27:01.480293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:01.480293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dP/PCEvlubqJ16RopLCzp2fBMfVRHQnuRtwnvnx2/wS/FI1x3UlK6Gvr5YSYu0s6XBtp7uudlBoPW29Px5lhAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:01.480819Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.14101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:890c7b719d63eee0f8dde07a0fa82191667c1f16bd944910be380e4b9d723216","sha256:dda5040c377a1cb9dafb01de8c45de808174a2444f9467707ab1e678ec16f2a8"],"state_sha256":"43d836597c0d22bf9cdb921313519afd4a3a3fb3ebf803bdb6d50beac8204cbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKuNtfamw4G+Kt+1eF+3QdkIUC1obK5oGtskgkbvgP2CapJeoD+OpFTkIZ96jc39p5C07mTKg63GF3LE9SbaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T14:25:16.315042Z","bundle_sha256":"291a4967bcfb79386221824c8332f522765f72e18d7a4aeeebe5ecd67a574452"}}