{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6JY7XMZOJXVXLP4J4WYWEHYPBS","short_pith_number":"pith:6JY7XMZO","canonical_record":{"source":{"id":"2302.05826","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-12T00:45:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7722b062a5d5dd728a787f10b38f5bb97ec9765b94dc962e26cb2cac317ad2ca","abstract_canon_sha256":"50a5a43d51e5c6b81a87e2a90dd26669f8225e45f5bb56abdb845924f36c5102"},"schema_version":"1.0"},"canonical_sha256":"f271fbb32e4deb75bf89e5b1621f0f0cb8ec97410d9638f5c1c9754f4242e39e","source":{"kind":"arxiv","id":"2302.05826","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.05826","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"2302.05826v2","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05826","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"6JY7XMZOJXVX","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"pith_short_16","alias_value":"6JY7XMZOJXVXLP4J","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"pith_short_8","alias_value":"6JY7XMZO","created_at":"2026-07-05T07:14:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6JY7XMZOJXVXLP4J4WYWEHYPBS","target":"record","payload":{"canonical_record":{"source":{"id":"2302.05826","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-12T00:45:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7722b062a5d5dd728a787f10b38f5bb97ec9765b94dc962e26cb2cac317ad2ca","abstract_canon_sha256":"50a5a43d51e5c6b81a87e2a90dd26669f8225e45f5bb56abdb845924f36c5102"},"schema_version":"1.0"},"canonical_sha256":"f271fbb32e4deb75bf89e5b1621f0f0cb8ec97410d9638f5c1c9754f4242e39e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:52.262062Z","signature_b64":"3lmHnHpWIFCgeXmp2vHH8wbi5UZBtWybRXHNJj75vwIpyEenUc0eRpgHX0/f0WSoqmUtdDrP8F6hayToMUVmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f271fbb32e4deb75bf89e5b1621f0f0cb8ec97410d9638f5c1c9754f4242e39e","last_reissued_at":"2026-07-05T07:14:52.261511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:52.261511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.05826","source_version":2,"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-05T07:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nhblcdTcgfcWpx06ivxEwzTy3warEqQEInswDK/7kKa1n6UOahjD5kINssgWfrlHudhP7g6wP/YUsj0zlqFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T20:07:12.162695Z"},"content_sha256":"7fc4b4d3a9a9877ca73b4612526f222290cb274e3b99c99e7b730a1df96526ef","schema_version":"1.0","event_id":"sha256:7fc4b4d3a9a9877ca73b4612526f222290cb274e3b99c99e7b730a1df96526ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6JY7XMZOJXVXLP4J4WYWEHYPBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Coded Distributed Computing via Combinatorial Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dianhua Wu, Minquan Cheng, Xianxian Li, Youlong Wu","submitted_at":"2023-02-12T00:45:36Z","abstract_excerpt":"Coded distributed computing (CDC) introduced by Li \\emph{et al.} can greatly reduce the communication load for MapReduce computing systems. In the general cascaded CDC with $K$ workers, $N$ input files and $Q$ Reduce functions, each input file will be mapped by $r$ workers and each Reduce function will be computed by $s$ workers such that coding techniques can be applied to achieve the maximum multicast gain. The main drawback of most existing CDC schemes is that they require the original data to be split into a large number of input files that grows exponentially with $K$, which can significa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05826","kind":"arxiv","version":2},"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/2302.05826/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-05T07:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mPtrONZUswETqEb5NW8eI3lOvWrjdcSzxiQYX47NHEoLDI/rpVF3BNxqgWJ0Sq7CxLm+pO13sRhYvvmIb3SKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T20:07:12.163187Z"},"content_sha256":"7b8b406c0d8449300ecaa67fa0095ffe389ef886c79f8b7038aaab3f97f322cc","schema_version":"1.0","event_id":"sha256:7b8b406c0d8449300ecaa67fa0095ffe389ef886c79f8b7038aaab3f97f322cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JY7XMZOJXVXLP4J4WYWEHYPBS/bundle.json","state_url":"https://pith.science/pith/6JY7XMZOJXVXLP4J4WYWEHYPBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JY7XMZOJXVXLP4J4WYWEHYPBS/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-09T20:07:12Z","links":{"resolver":"https://pith.science/pith/6JY7XMZOJXVXLP4J4WYWEHYPBS","bundle":"https://pith.science/pith/6JY7XMZOJXVXLP4J4WYWEHYPBS/bundle.json","state":"https://pith.science/pith/6JY7XMZOJXVXLP4J4WYWEHYPBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JY7XMZOJXVXLP4J4WYWEHYPBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6JY7XMZOJXVXLP4J4WYWEHYPBS","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":"50a5a43d51e5c6b81a87e2a90dd26669f8225e45f5bb56abdb845924f36c5102","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-12T00:45:36Z","title_canon_sha256":"7722b062a5d5dd728a787f10b38f5bb97ec9765b94dc962e26cb2cac317ad2ca"},"schema_version":"1.0","source":{"id":"2302.05826","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.05826","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"2302.05826v2","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05826","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"6JY7XMZOJXVX","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"pith_short_16","alias_value":"6JY7XMZOJXVXLP4J","created_at":"2026-07-05T07:14:52Z"},{"alias_kind":"pith_short_8","alias_value":"6JY7XMZO","created_at":"2026-07-05T07:14:52Z"}],"graph_snapshots":[{"event_id":"sha256:7b8b406c0d8449300ecaa67fa0095ffe389ef886c79f8b7038aaab3f97f322cc","target":"graph","created_at":"2026-07-05T07:14:52Z","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/2302.05826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Coded distributed computing (CDC) introduced by Li \\emph{et al.} can greatly reduce the communication load for MapReduce computing systems. In the general cascaded CDC with $K$ workers, $N$ input files and $Q$ Reduce functions, each input file will be mapped by $r$ workers and each Reduce function will be computed by $s$ workers such that coding techniques can be applied to achieve the maximum multicast gain. The main drawback of most existing CDC schemes is that they require the original data to be split into a large number of input files that grows exponentially with $K$, which can significa","authors_text":"Dianhua Wu, Minquan Cheng, Xianxian Li, Youlong Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-12T00:45:36Z","title":"Asymptotically Optimal Coded Distributed Computing via Combinatorial Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05826","kind":"arxiv","version":2},"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:7fc4b4d3a9a9877ca73b4612526f222290cb274e3b99c99e7b730a1df96526ef","target":"record","created_at":"2026-07-05T07:14:52Z","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":"50a5a43d51e5c6b81a87e2a90dd26669f8225e45f5bb56abdb845924f36c5102","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-12T00:45:36Z","title_canon_sha256":"7722b062a5d5dd728a787f10b38f5bb97ec9765b94dc962e26cb2cac317ad2ca"},"schema_version":"1.0","source":{"id":"2302.05826","kind":"arxiv","version":2}},"canonical_sha256":"f271fbb32e4deb75bf89e5b1621f0f0cb8ec97410d9638f5c1c9754f4242e39e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f271fbb32e4deb75bf89e5b1621f0f0cb8ec97410d9638f5c1c9754f4242e39e","first_computed_at":"2026-07-05T07:14:52.261511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:14:52.261511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3lmHnHpWIFCgeXmp2vHH8wbi5UZBtWybRXHNJj75vwIpyEenUc0eRpgHX0/f0WSoqmUtdDrP8F6hayToMUVmBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:14:52.262062Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.05826","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fc4b4d3a9a9877ca73b4612526f222290cb274e3b99c99e7b730a1df96526ef","sha256:7b8b406c0d8449300ecaa67fa0095ffe389ef886c79f8b7038aaab3f97f322cc"],"state_sha256":"674e65d10a59b4e914721c487131c588a307a225bab64f9dee3fdc97df08bfb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V1RIE76SxLRy3dWh3oJggrMBPUa+s4/FsOKTX8f1Q+7Rx0WH6b2wIELa32qsqvrm/+HZ0h0BVBdvLbUmW3A+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T20:07:12.168416Z","bundle_sha256":"f3cd83f417e2f27268cee480ee030420e688e77bd4481190788e777e43dd4dcc"}}