{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I4BKF3JU4MQZ54P4HTXZINAS74","short_pith_number":"pith:I4BKF3JU","canonical_record":{"source":{"id":"1802.04172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T16:35:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1b74a70c7a7cd024289840a72678dfb5e7fccbdbf0cf1bd47963e73da274fc7","abstract_canon_sha256":"acf80e7718eb55442547a09d7e91925a0fa0a14e4ead1e153d9b2df4a612e1ff"},"schema_version":"1.0"},"canonical_sha256":"4702a2ed34e3219ef1fc3cef943412ff3aa3dc0328d6d77dc3e9079dc6ce2ba6","source":{"kind":"arxiv","id":"1802.04172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04172","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04172v1","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04172","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"I4BKF3JU4MQZ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I4BKF3JU4MQZ54P4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I4BKF3JU","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I4BKF3JU4MQZ54P4HTXZINAS74","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T16:35:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1b74a70c7a7cd024289840a72678dfb5e7fccbdbf0cf1bd47963e73da274fc7","abstract_canon_sha256":"acf80e7718eb55442547a09d7e91925a0fa0a14e4ead1e153d9b2df4a612e1ff"},"schema_version":"1.0"},"canonical_sha256":"4702a2ed34e3219ef1fc3cef943412ff3aa3dc0328d6d77dc3e9079dc6ce2ba6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:46.619402Z","signature_b64":"/RlORir5YJYHuVOD/Fj1Pj2Fg8RnZylNdEy2n0ykLzbo2nSxUKcDL7kYrm2/1FUI0Hc3ItvKLMDXqlpi0abuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4702a2ed34e3219ef1fc3cef943412ff3aa3dc0328d6d77dc3e9079dc6ce2ba6","last_reissued_at":"2026-05-18T00:23:46.618882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:46.618882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04172","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-05-18T00:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9kyW8qMb2fEggrFOiV6C6pNpKLvGW3/0eoU7PqgQnx7zScux9ZnCfhihDJ+1yMQwVnDItIqaA2XXy9HeR7xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:02:31.159028Z"},"content_sha256":"bdf7930bee4ca89823e4fc2ff597e02b8917bd315ba1ccd3b45731751dcf57b8","schema_version":"1.0","event_id":"sha256:bdf7930bee4ca89823e4fc2ff597e02b8917bd315ba1ccd3b45731751dcf57b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I4BKF3JU4MQZ54P4HTXZINAS74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eleftherios Lampiris, Emanuele Parrinello, Petros Elia","submitted_at":"2018-02-12T16:35:46Z","abstract_excerpt":"This work explores a distributed computing setting where $K$ nodes are assigned fractions (subtasks) of a computational task in order to perform the computation in parallel. In this setting, a well-known main bottleneck has been the inter-node communication cost required to parallelize the task, because unlike the computational cost which could keep decreasing as $K$ increases, the communication cost remains approximately constant, thus bounding the total speedup gains associated to having more computing nodes. This bottleneck was substantially ameliorated by the recent introduction of coded M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04172","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":""},"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-05-18T00:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rofn7KnlIPH9IiPlCZyuayX7rUvSLu8nuGlu6K1P9AB2o67Oa/HXUPwm6tTdjAqPMF7qX/p2XPzZoE02Ij4MCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:02:31.159691Z"},"content_sha256":"083c9cc759c62ccbea35c10b7dad5cbea3907a1aaf4c0ed638263f5e2e6eff08","schema_version":"1.0","event_id":"sha256:083c9cc759c62ccbea35c10b7dad5cbea3907a1aaf4c0ed638263f5e2e6eff08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4BKF3JU4MQZ54P4HTXZINAS74/bundle.json","state_url":"https://pith.science/pith/I4BKF3JU4MQZ54P4HTXZINAS74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4BKF3JU4MQZ54P4HTXZINAS74/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-05-26T11:02:31Z","links":{"resolver":"https://pith.science/pith/I4BKF3JU4MQZ54P4HTXZINAS74","bundle":"https://pith.science/pith/I4BKF3JU4MQZ54P4HTXZINAS74/bundle.json","state":"https://pith.science/pith/I4BKF3JU4MQZ54P4HTXZINAS74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4BKF3JU4MQZ54P4HTXZINAS74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I4BKF3JU4MQZ54P4HTXZINAS74","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":"acf80e7718eb55442547a09d7e91925a0fa0a14e4ead1e153d9b2df4a612e1ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T16:35:46Z","title_canon_sha256":"c1b74a70c7a7cd024289840a72678dfb5e7fccbdbf0cf1bd47963e73da274fc7"},"schema_version":"1.0","source":{"id":"1802.04172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04172","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04172v1","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04172","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"I4BKF3JU4MQZ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I4BKF3JU4MQZ54P4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I4BKF3JU","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:083c9cc759c62ccbea35c10b7dad5cbea3907a1aaf4c0ed638263f5e2e6eff08","target":"graph","created_at":"2026-05-18T00:23:46Z","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"},"paper":{"abstract_excerpt":"This work explores a distributed computing setting where $K$ nodes are assigned fractions (subtasks) of a computational task in order to perform the computation in parallel. In this setting, a well-known main bottleneck has been the inter-node communication cost required to parallelize the task, because unlike the computational cost which could keep decreasing as $K$ increases, the communication cost remains approximately constant, thus bounding the total speedup gains associated to having more computing nodes. This bottleneck was substantially ameliorated by the recent introduction of coded M","authors_text":"Eleftherios Lampiris, Emanuele Parrinello, Petros Elia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T16:35:46Z","title":"Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04172","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:bdf7930bee4ca89823e4fc2ff597e02b8917bd315ba1ccd3b45731751dcf57b8","target":"record","created_at":"2026-05-18T00:23:46Z","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":"acf80e7718eb55442547a09d7e91925a0fa0a14e4ead1e153d9b2df4a612e1ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T16:35:46Z","title_canon_sha256":"c1b74a70c7a7cd024289840a72678dfb5e7fccbdbf0cf1bd47963e73da274fc7"},"schema_version":"1.0","source":{"id":"1802.04172","kind":"arxiv","version":1}},"canonical_sha256":"4702a2ed34e3219ef1fc3cef943412ff3aa3dc0328d6d77dc3e9079dc6ce2ba6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4702a2ed34e3219ef1fc3cef943412ff3aa3dc0328d6d77dc3e9079dc6ce2ba6","first_computed_at":"2026-05-18T00:23:46.618882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:46.618882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/RlORir5YJYHuVOD/Fj1Pj2Fg8RnZylNdEy2n0ykLzbo2nSxUKcDL7kYrm2/1FUI0Hc3ItvKLMDXqlpi0abuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:46.619402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdf7930bee4ca89823e4fc2ff597e02b8917bd315ba1ccd3b45731751dcf57b8","sha256:083c9cc759c62ccbea35c10b7dad5cbea3907a1aaf4c0ed638263f5e2e6eff08"],"state_sha256":"015eb18ead85b3f796dccfc7001f05d42c879a2b8cfe398f5a7fd39694a1966b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9NiUM9G55Wt6xFBt+pd5JQuFxAVS/oeyBnmY1M1PBP6QGeLYdDwmxdxsoPiOcwg3cMwrbYrW6ErhZXskUhsGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:02:31.162907Z","bundle_sha256":"d2eaf5089b452695412f25193b819f607e1c909d5cce6d9526379b2776ecf562"}}