{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:YHSQ6WROVFPTXUD5G2POOFK3UI","short_pith_number":"pith:YHSQ6WRO","canonical_record":{"source":{"id":"2012.08715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-12-16T03:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"47e3ee82b153357b7cf6c7a55eafe166436b40a87004488e1ac59dcd9644051c","abstract_canon_sha256":"47f9ff4be8e9b2b44c702b9b80f937b2560e1ecd07f765fff5a393c54c4aaa5e"},"schema_version":"1.0"},"canonical_sha256":"c1e50f5a2ea95f3bd07d369ee7155ba22782af678d65530daaaab74b56f66447","source":{"kind":"arxiv","id":"2012.08715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.08715","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"2012.08715v1","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.08715","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"YHSQ6WROVFPT","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"pith_short_16","alias_value":"YHSQ6WROVFPTXUD5","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"pith_short_8","alias_value":"YHSQ6WRO","created_at":"2026-07-05T02:00:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:YHSQ6WROVFPTXUD5G2POOFK3UI","target":"record","payload":{"canonical_record":{"source":{"id":"2012.08715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-12-16T03:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"47e3ee82b153357b7cf6c7a55eafe166436b40a87004488e1ac59dcd9644051c","abstract_canon_sha256":"47f9ff4be8e9b2b44c702b9b80f937b2560e1ecd07f765fff5a393c54c4aaa5e"},"schema_version":"1.0"},"canonical_sha256":"c1e50f5a2ea95f3bd07d369ee7155ba22782af678d65530daaaab74b56f66447","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:02.537161Z","signature_b64":"mxhQIaxu1kWeqLV3lY1NxMnKxWMIJzHik5PSVY5fHl94Oa3NHxSaijv7E+i38kAdsXRkSmqw4YwU2rs5mmSnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e50f5a2ea95f3bd07d369ee7155ba22782af678d65530daaaab74b56f66447","last_reissued_at":"2026-07-05T02:00:02.536766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:02.536766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.08715","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-05T02:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxjdpDY3geF4AIzJ2S63MmPDWXnMHmQ5xxUdFabdjW1ALNM4iW2sEb7w96jrhlpxSPkUMt1NviiYaC0IpGUvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:44:41.742452Z"},"content_sha256":"43f8cb718202f513fe16f96ec4cfdcebc59d7503c34451e293193999b9a0933b","schema_version":"1.0","event_id":"sha256:43f8cb718202f513fe16f96ec4cfdcebc59d7503c34451e293193999b9a0933b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:YHSQ6WROVFPTXUD5G2POOFK3UI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incentive Mechanism Design for Distributed Coded Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jianwei Huang, Lingjie Duan, Ningning Ding, Zhixuan Fang","submitted_at":"2020-12-16T03:09:15Z","abstract_excerpt":"A distributed machine learning platform needs to recruit many heterogeneous worker nodes to finish computation simultaneously. As a result, the overall performance may be degraded due to straggling workers. By introducing redundancy into computation, coded machine learning can effectively improve the runtime performance by recovering the final computation result through the first $k$ (out of the total $n$) workers who finish computation. While existing studies focus on designing efficient coding schemes, the issue of designing proper incentives to encourage worker participation is still under-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.08715","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/2012.08715/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-05T02:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnJnjkD1dO2+Kru5L1vtI1T+jJaDDPCKBTjl4w7lxi1lTnDzhaOAPVTW6NkhkFXgjcGAIBNtKd37jUKbogaQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:44:41.742973Z"},"content_sha256":"d4c2d3eb3d2fd30722cb3dbe35d09dfc7eccc2acfdb07c6fc2781004e9c90385","schema_version":"1.0","event_id":"sha256:d4c2d3eb3d2fd30722cb3dbe35d09dfc7eccc2acfdb07c6fc2781004e9c90385"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHSQ6WROVFPTXUD5G2POOFK3UI/bundle.json","state_url":"https://pith.science/pith/YHSQ6WROVFPTXUD5G2POOFK3UI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHSQ6WROVFPTXUD5G2POOFK3UI/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-07T21:44:41Z","links":{"resolver":"https://pith.science/pith/YHSQ6WROVFPTXUD5G2POOFK3UI","bundle":"https://pith.science/pith/YHSQ6WROVFPTXUD5G2POOFK3UI/bundle.json","state":"https://pith.science/pith/YHSQ6WROVFPTXUD5G2POOFK3UI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHSQ6WROVFPTXUD5G2POOFK3UI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:YHSQ6WROVFPTXUD5G2POOFK3UI","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":"47f9ff4be8e9b2b44c702b9b80f937b2560e1ecd07f765fff5a393c54c4aaa5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-12-16T03:09:15Z","title_canon_sha256":"47e3ee82b153357b7cf6c7a55eafe166436b40a87004488e1ac59dcd9644051c"},"schema_version":"1.0","source":{"id":"2012.08715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.08715","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"2012.08715v1","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.08715","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"YHSQ6WROVFPT","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"pith_short_16","alias_value":"YHSQ6WROVFPTXUD5","created_at":"2026-07-05T02:00:02Z"},{"alias_kind":"pith_short_8","alias_value":"YHSQ6WRO","created_at":"2026-07-05T02:00:02Z"}],"graph_snapshots":[{"event_id":"sha256:d4c2d3eb3d2fd30722cb3dbe35d09dfc7eccc2acfdb07c6fc2781004e9c90385","target":"graph","created_at":"2026-07-05T02:00:02Z","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/2012.08715/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A distributed machine learning platform needs to recruit many heterogeneous worker nodes to finish computation simultaneously. As a result, the overall performance may be degraded due to straggling workers. By introducing redundancy into computation, coded machine learning can effectively improve the runtime performance by recovering the final computation result through the first $k$ (out of the total $n$) workers who finish computation. While existing studies focus on designing efficient coding schemes, the issue of designing proper incentives to encourage worker participation is still under-","authors_text":"Jianwei Huang, Lingjie Duan, Ningning Ding, Zhixuan Fang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-12-16T03:09:15Z","title":"Incentive Mechanism Design for Distributed Coded Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.08715","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:43f8cb718202f513fe16f96ec4cfdcebc59d7503c34451e293193999b9a0933b","target":"record","created_at":"2026-07-05T02:00:02Z","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":"47f9ff4be8e9b2b44c702b9b80f937b2560e1ecd07f765fff5a393c54c4aaa5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-12-16T03:09:15Z","title_canon_sha256":"47e3ee82b153357b7cf6c7a55eafe166436b40a87004488e1ac59dcd9644051c"},"schema_version":"1.0","source":{"id":"2012.08715","kind":"arxiv","version":1}},"canonical_sha256":"c1e50f5a2ea95f3bd07d369ee7155ba22782af678d65530daaaab74b56f66447","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e50f5a2ea95f3bd07d369ee7155ba22782af678d65530daaaab74b56f66447","first_computed_at":"2026-07-05T02:00:02.536766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:00:02.536766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mxhQIaxu1kWeqLV3lY1NxMnKxWMIJzHik5PSVY5fHl94Oa3NHxSaijv7E+i38kAdsXRkSmqw4YwU2rs5mmSnCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:00:02.537161Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.08715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43f8cb718202f513fe16f96ec4cfdcebc59d7503c34451e293193999b9a0933b","sha256:d4c2d3eb3d2fd30722cb3dbe35d09dfc7eccc2acfdb07c6fc2781004e9c90385"],"state_sha256":"5c459f1eb85cfd842f8697e98e3f5e3cc2c720153a060e40d452c4f5546cedf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVG6z+Jx0PmrYpwRxHNVXbyFj+WPL2kdix78k/En5MZ/hYgjM1du0fBf2fNHel0zKetWVCvrMDtPhutMREbNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T21:44:41.746751Z","bundle_sha256":"8dc7e4c4eba3faae7f50f292a0b0b4e8646cf95ea511dde8e98652b059541f89"}}