{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7Z5BHOZJI7IJJYGQWZLK6NALXI","short_pith_number":"pith:7Z5BHOZJ","canonical_record":{"source":{"id":"2506.04524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T00:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"5ef9fe2d2fdc2fee673553d65f0033c6f83795f80712e4513ea1992533df3319","abstract_canon_sha256":"677c8c7b9a574350574b363db3aa5fe81ff00f3e8198fbf004f46ca84d96f532"},"schema_version":"1.0"},"canonical_sha256":"fe7a13bb2947d094e0d0b656af340bba11bdfdf537aad61646b68531eb14e932","source":{"kind":"arxiv","id":"2506.04524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04524","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04524v1","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04524","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"7Z5BHOZJI7IJ","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"pith_short_16","alias_value":"7Z5BHOZJI7IJJYGQ","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"pith_short_8","alias_value":"7Z5BHOZJ","created_at":"2026-07-05T11:16:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7Z5BHOZJI7IJJYGQWZLK6NALXI","target":"record","payload":{"canonical_record":{"source":{"id":"2506.04524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T00:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"5ef9fe2d2fdc2fee673553d65f0033c6f83795f80712e4513ea1992533df3319","abstract_canon_sha256":"677c8c7b9a574350574b363db3aa5fe81ff00f3e8198fbf004f46ca84d96f532"},"schema_version":"1.0"},"canonical_sha256":"fe7a13bb2947d094e0d0b656af340bba11bdfdf537aad61646b68531eb14e932","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:15.920040Z","signature_b64":"tU7KqOwIGltSKlGwINsgFk3oei2OzwBTKulN8GC/BreuQIm20r4Tq1TOj1Q1i1Y373xscBKfu8b/dbLEM1ipBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe7a13bb2947d094e0d0b656af340bba11bdfdf537aad61646b68531eb14e932","last_reissued_at":"2026-07-05T11:16:15.919499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:15.919499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.04524","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-05T11:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jBC5A7ImbS2nchj8IPkQMQtPQq0AnAD8HAGX/KuJAwxlkZgnBF8CHeOeSvnNIZ2u/+PNGIWHguRcSfdIDC2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:02:35.581085Z"},"content_sha256":"8543cc67b1f083c538d6eee055ec928d0d9b93a90e29d5cd3519bc60d91f4269","schema_version":"1.0","event_id":"sha256:8543cc67b1f083c538d6eee055ec928d0d9b93a90e29d5cd3519bc60d91f4269"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7Z5BHOZJI7IJJYGQWZLK6NALXI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub {\\L}\\k{a}cki, Slobodan Mitrovi\\'c, Srikkanth Ramachandran, Wen-Horng Sheu","submitted_at":"2025-06-05T00:13:25Z","abstract_excerpt":"We study the allocation problem in the Massively Parallel Computation (MPC) model. This problem is a special case of $b$-matching, in which the input is a bipartite graph with capacities greater than $1$ in only one part of the bipartition. We give a $(1+\\epsilon)$ approximate algorithm for the problem, which runs in $\\tilde{O}(\\sqrt{\\log \\lambda})$ MPC rounds, using sublinear space per machine and $\\tilde{O}(\\lambda n)$ total space, where $\\lambda$ is the arboricity of the input graph. Our result is obtained by providing a new analysis of a LOCAL algorithm by Agrawal, Zadimoghaddam, and Mirro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04524","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/2506.04524/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-05T11:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lin5O2i08yZbWOoqU/6obEPGT6MOg9LtCUppsMZFPzN/y/TzJCUVe1htoJSRppFbzR7iqOkzzNrS3QdkIwPBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:02:35.581660Z"},"content_sha256":"9ad2b945d3d7f902a20a996845d50341903f7780f4ab0cc2c618fb5f54999634","schema_version":"1.0","event_id":"sha256:9ad2b945d3d7f902a20a996845d50341903f7780f4ab0cc2c618fb5f54999634"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Z5BHOZJI7IJJYGQWZLK6NALXI/bundle.json","state_url":"https://pith.science/pith/7Z5BHOZJI7IJJYGQWZLK6NALXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Z5BHOZJI7IJJYGQWZLK6NALXI/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-19T20:02:35Z","links":{"resolver":"https://pith.science/pith/7Z5BHOZJI7IJJYGQWZLK6NALXI","bundle":"https://pith.science/pith/7Z5BHOZJI7IJJYGQWZLK6NALXI/bundle.json","state":"https://pith.science/pith/7Z5BHOZJI7IJJYGQWZLK6NALXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Z5BHOZJI7IJJYGQWZLK6NALXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7Z5BHOZJI7IJJYGQWZLK6NALXI","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":"677c8c7b9a574350574b363db3aa5fe81ff00f3e8198fbf004f46ca84d96f532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T00:13:25Z","title_canon_sha256":"5ef9fe2d2fdc2fee673553d65f0033c6f83795f80712e4513ea1992533df3319"},"schema_version":"1.0","source":{"id":"2506.04524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04524","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04524v1","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04524","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"7Z5BHOZJI7IJ","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"pith_short_16","alias_value":"7Z5BHOZJI7IJJYGQ","created_at":"2026-07-05T11:16:15Z"},{"alias_kind":"pith_short_8","alias_value":"7Z5BHOZJ","created_at":"2026-07-05T11:16:15Z"}],"graph_snapshots":[{"event_id":"sha256:9ad2b945d3d7f902a20a996845d50341903f7780f4ab0cc2c618fb5f54999634","target":"graph","created_at":"2026-07-05T11:16:15Z","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/2506.04524/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the allocation problem in the Massively Parallel Computation (MPC) model. This problem is a special case of $b$-matching, in which the input is a bipartite graph with capacities greater than $1$ in only one part of the bipartition. We give a $(1+\\epsilon)$ approximate algorithm for the problem, which runs in $\\tilde{O}(\\sqrt{\\log \\lambda})$ MPC rounds, using sublinear space per machine and $\\tilde{O}(\\lambda n)$ total space, where $\\lambda$ is the arboricity of the input graph. Our result is obtained by providing a new analysis of a LOCAL algorithm by Agrawal, Zadimoghaddam, and Mirro","authors_text":"Jakub {\\L}\\k{a}cki, Slobodan Mitrovi\\'c, Srikkanth Ramachandran, Wen-Horng Sheu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04524","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:8543cc67b1f083c538d6eee055ec928d0d9b93a90e29d5cd3519bc60d91f4269","target":"record","created_at":"2026-07-05T11:16:15Z","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":"677c8c7b9a574350574b363db3aa5fe81ff00f3e8198fbf004f46ca84d96f532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T00:13:25Z","title_canon_sha256":"5ef9fe2d2fdc2fee673553d65f0033c6f83795f80712e4513ea1992533df3319"},"schema_version":"1.0","source":{"id":"2506.04524","kind":"arxiv","version":1}},"canonical_sha256":"fe7a13bb2947d094e0d0b656af340bba11bdfdf537aad61646b68531eb14e932","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe7a13bb2947d094e0d0b656af340bba11bdfdf537aad61646b68531eb14e932","first_computed_at":"2026-07-05T11:16:15.919499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:15.919499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tU7KqOwIGltSKlGwINsgFk3oei2OzwBTKulN8GC/BreuQIm20r4Tq1TOj1Q1i1Y373xscBKfu8b/dbLEM1ipBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:15.920040Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8543cc67b1f083c538d6eee055ec928d0d9b93a90e29d5cd3519bc60d91f4269","sha256:9ad2b945d3d7f902a20a996845d50341903f7780f4ab0cc2c618fb5f54999634"],"state_sha256":"0f5b134eb161127b70f04f5ff790bb212f6d0b7ea8dbebb5747bda5bc3607f52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyMJPWZwDzYs7maBbbClvy++/R2p0J7jubz7asgy249vxOFZXouB0Fa0fDlLM/3ZmzfwCdUq0R2qt8+4b9v/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T20:02:35.586904Z","bundle_sha256":"401c2de2d6e36476a56d58d26a3292d4f5cb5b8877d5cd06c32c085ec8ea3c70"}}