{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:LOAWLBHMH2P5BUAF7FPHH24STK","short_pith_number":"pith:LOAWLBHM","canonical_record":{"source":{"id":"2201.06300","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T09:32:15Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"79499418f613c475d524d4dc19f1027a3e5f48293fd7e57315d2ec2c9f01416d","abstract_canon_sha256":"34f2cc023eb3f5b64c080e6c49834257457aedae5f47cd685bea560c84d3130a"},"schema_version":"1.0"},"canonical_sha256":"5b816584ec3e9fd0d005f95e73eb929ab520984178de3bdb6b1657d944523d6d","source":{"kind":"arxiv","id":"2201.06300","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06300","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06300v3","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06300","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"LOAWLBHMH2P5","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"LOAWLBHMH2P5BUAF","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"LOAWLBHM","created_at":"2026-07-05T10:05:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:LOAWLBHMH2P5BUAF7FPHH24STK","target":"record","payload":{"canonical_record":{"source":{"id":"2201.06300","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T09:32:15Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"79499418f613c475d524d4dc19f1027a3e5f48293fd7e57315d2ec2c9f01416d","abstract_canon_sha256":"34f2cc023eb3f5b64c080e6c49834257457aedae5f47cd685bea560c84d3130a"},"schema_version":"1.0"},"canonical_sha256":"5b816584ec3e9fd0d005f95e73eb929ab520984178de3bdb6b1657d944523d6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:05.603467Z","signature_b64":"JaoUHuxAJ2AEFvHsOHBY4QTACSlKKV08sE99Sg1yCrfeeNlaMbIAZus5VvEsNoZjqkgyshojtTo7epcM22LuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b816584ec3e9fd0d005f95e73eb929ab520984178de3bdb6b1657d944523d6d","last_reissued_at":"2026-07-05T10:05:05.603099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:05.603099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.06300","source_version":3,"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-05T10:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3yhS2mPVNU+HhjysjRcGFjn1dP62v0CRKhGUkcsySljCDjApsmQ7ud0VIbi7ywWxycEZ4q9Js+haK6hVyTGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:04:46.071169Z"},"content_sha256":"de2036efd249079b3a8b21014a0e65386b6cd635e74bb3774f67aacfcacc7dbf","schema_version":"1.0","event_id":"sha256:de2036efd249079b3a8b21014a0e65386b6cd635e74bb3774f67aacfcacc7dbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:LOAWLBHMH2P5BUAF7FPHH24STK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Distributed Computing with Pre-set Assignments of Data and Output Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Youlong Wu, Yuhan Wang","submitted_at":"2022-01-17T09:32:15Z","abstract_excerpt":"Coded distributed computing can reduce the communication load for distributed computing systems by introducing redundant computation and creating multicasting opportunities. However, the existing schemes require delicate data placement and output function assignment, which is not feasible when distributed nodes fetch data without the orchestration of a master node. In this paper, we consider the general systems where the data placement and output function assignment are arbitrary but pre-set. We propose two coded computing schemes, One-shot Coded Transmission (OSCT) and Few-shot Coded Transmis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06300","kind":"arxiv","version":3},"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/2201.06300/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-05T10:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BBf75AvDBwxM7pqRlCB+Q+6zGWpg78vbqajAAvc2t6ChnXseKxglHhraEvcaHjh42+gTsuJzO/KDpdW/aHrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:04:46.072032Z"},"content_sha256":"7c7fb9a588ebc679a14a101a64f6a46863491c41d1e1cfa90f4aa2ec5af95914","schema_version":"1.0","event_id":"sha256:7c7fb9a588ebc679a14a101a64f6a46863491c41d1e1cfa90f4aa2ec5af95914"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOAWLBHMH2P5BUAF7FPHH24STK/bundle.json","state_url":"https://pith.science/pith/LOAWLBHMH2P5BUAF7FPHH24STK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOAWLBHMH2P5BUAF7FPHH24STK/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-07T10:04:46Z","links":{"resolver":"https://pith.science/pith/LOAWLBHMH2P5BUAF7FPHH24STK","bundle":"https://pith.science/pith/LOAWLBHMH2P5BUAF7FPHH24STK/bundle.json","state":"https://pith.science/pith/LOAWLBHMH2P5BUAF7FPHH24STK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOAWLBHMH2P5BUAF7FPHH24STK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LOAWLBHMH2P5BUAF7FPHH24STK","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":"34f2cc023eb3f5b64c080e6c49834257457aedae5f47cd685bea560c84d3130a","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T09:32:15Z","title_canon_sha256":"79499418f613c475d524d4dc19f1027a3e5f48293fd7e57315d2ec2c9f01416d"},"schema_version":"1.0","source":{"id":"2201.06300","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06300","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06300v3","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06300","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"LOAWLBHMH2P5","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"LOAWLBHMH2P5BUAF","created_at":"2026-07-05T10:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"LOAWLBHM","created_at":"2026-07-05T10:05:05Z"}],"graph_snapshots":[{"event_id":"sha256:7c7fb9a588ebc679a14a101a64f6a46863491c41d1e1cfa90f4aa2ec5af95914","target":"graph","created_at":"2026-07-05T10:05:05Z","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/2201.06300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Coded distributed computing can reduce the communication load for distributed computing systems by introducing redundant computation and creating multicasting opportunities. However, the existing schemes require delicate data placement and output function assignment, which is not feasible when distributed nodes fetch data without the orchestration of a master node. In this paper, we consider the general systems where the data placement and output function assignment are arbitrary but pre-set. We propose two coded computing schemes, One-shot Coded Transmission (OSCT) and Few-shot Coded Transmis","authors_text":"Youlong Wu, Yuhan Wang","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T09:32:15Z","title":"Coded Distributed Computing with Pre-set Assignments of Data and Output Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06300","kind":"arxiv","version":3},"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:de2036efd249079b3a8b21014a0e65386b6cd635e74bb3774f67aacfcacc7dbf","target":"record","created_at":"2026-07-05T10:05:05Z","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":"34f2cc023eb3f5b64c080e6c49834257457aedae5f47cd685bea560c84d3130a","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T09:32:15Z","title_canon_sha256":"79499418f613c475d524d4dc19f1027a3e5f48293fd7e57315d2ec2c9f01416d"},"schema_version":"1.0","source":{"id":"2201.06300","kind":"arxiv","version":3}},"canonical_sha256":"5b816584ec3e9fd0d005f95e73eb929ab520984178de3bdb6b1657d944523d6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b816584ec3e9fd0d005f95e73eb929ab520984178de3bdb6b1657d944523d6d","first_computed_at":"2026-07-05T10:05:05.603099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:05:05.603099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JaoUHuxAJ2AEFvHsOHBY4QTACSlKKV08sE99Sg1yCrfeeNlaMbIAZus5VvEsNoZjqkgyshojtTo7epcM22LuAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:05:05.603467Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.06300","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de2036efd249079b3a8b21014a0e65386b6cd635e74bb3774f67aacfcacc7dbf","sha256:7c7fb9a588ebc679a14a101a64f6a46863491c41d1e1cfa90f4aa2ec5af95914"],"state_sha256":"4922a81d6e54d4beda4ca37327beddeafa2c931aef48aa29ff3f3d80764f16af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbNOEJRYUM2fJ0kLEsT3sevyl3G93Xe6VGdP6zouLUZr2Rfh3cCiGFJtcIzD9rUwvP3kC/BSh9Q3l3FF6JDACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:04:46.079859Z","bundle_sha256":"58263c8261acd541043530374c18d222534bd99e388ae45d79a89f5905f899aa"}}