{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2WYC6I5SE3ZWZ42KOWKDIQFRLL","short_pith_number":"pith:2WYC6I5S","canonical_record":{"source":{"id":"1702.06082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T17:56:01Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"0586cad53182536e44e14e6f290f3da063669fa45f9ed981ef7f004f52c63fab","abstract_canon_sha256":"2507f944ffec95618cf33755c445e35bc8dbae9d018f8be43ffabe22d103738b"},"schema_version":"1.0"},"canonical_sha256":"d5b02f23b226f36cf34a75943440b15af63881ac9af09ac4536b4f57ba50b3b3","source":{"kind":"arxiv","id":"1702.06082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06082","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06082v1","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06082","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"2WYC6I5SE3ZW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WYC6I5SE3ZWZ42K","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WYC6I5S","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2WYC6I5SE3ZWZ42KOWKDIQFRLL","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T17:56:01Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"0586cad53182536e44e14e6f290f3da063669fa45f9ed981ef7f004f52c63fab","abstract_canon_sha256":"2507f944ffec95618cf33755c445e35bc8dbae9d018f8be43ffabe22d103738b"},"schema_version":"1.0"},"canonical_sha256":"d5b02f23b226f36cf34a75943440b15af63881ac9af09ac4536b4f57ba50b3b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:24.391022Z","signature_b64":"UEhBZdddHQMTXgH0lemWM+TSMWI0g2pDpjGLUSUVbcQs4gOnX6+jl7psV6I+mcHFsMCfLP7kCyCqL0ACykvdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5b02f23b226f36cf34a75943440b15af63881ac9af09ac4536b4f57ba50b3b3","last_reissued_at":"2026-05-18T00:50:24.390412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:24.390412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06082","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:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usFNL/x6PzLEMRM3CQgRMueE72uzufGCs4OD8rTe+Rp2XdeBd9nVsqZOX7ye0dVYmrHKo7DuApe2S4c515TdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:49:14.514353Z"},"content_sha256":"ee30ddd2cfb593cc6eaa2b252c1807392464f3709da4cd87fafd5ded5948fb67","schema_version":"1.0","event_id":"sha256:ee30ddd2cfb593cc6eaa2b252c1807392464f3709da4cd87fafd5ded5948fb67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2WYC6I5SE3ZWZ42KOWKDIQFRLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding for Distributed Fog Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Songze Li","submitted_at":"2017-02-20T17:56:01Z","abstract_excerpt":"Redundancy is abundant in Fog networks (i.e., many computing and storage points) and grows linearly with network size. We demonstrate the transformational role of coding in Fog computing for leveraging such redundancy to substantially reduce the bandwidth consumption and latency of computing. In particular, we discuss two recently proposed coding concepts, namely Minimum Bandwidth Codes and Minimum Latency Codes, and illustrate their impacts in Fog computing. We also review a unified coding framework that includes the above two coding techniques as special cases, and enables a tradeoff between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06082","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:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asy2brD8Qz7iRV9k7HyGaYoJexE+c0Mlpp9QyK2r4PY1TgEIH3EGLALOg1OSfYaKvHGkQqzsHY5cG5MIzzVQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:49:14.515032Z"},"content_sha256":"928eaef935a1931b0f88f48ed469dd8f070fb11e975ea934fe5c64de699f7cb2","schema_version":"1.0","event_id":"sha256:928eaef935a1931b0f88f48ed469dd8f070fb11e975ea934fe5c64de699f7cb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WYC6I5SE3ZWZ42KOWKDIQFRLL/bundle.json","state_url":"https://pith.science/pith/2WYC6I5SE3ZWZ42KOWKDIQFRLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WYC6I5SE3ZWZ42KOWKDIQFRLL/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-25T15:49:14Z","links":{"resolver":"https://pith.science/pith/2WYC6I5SE3ZWZ42KOWKDIQFRLL","bundle":"https://pith.science/pith/2WYC6I5SE3ZWZ42KOWKDIQFRLL/bundle.json","state":"https://pith.science/pith/2WYC6I5SE3ZWZ42KOWKDIQFRLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WYC6I5SE3ZWZ42KOWKDIQFRLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2WYC6I5SE3ZWZ42KOWKDIQFRLL","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":"2507f944ffec95618cf33755c445e35bc8dbae9d018f8be43ffabe22d103738b","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T17:56:01Z","title_canon_sha256":"0586cad53182536e44e14e6f290f3da063669fa45f9ed981ef7f004f52c63fab"},"schema_version":"1.0","source":{"id":"1702.06082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06082","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06082v1","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06082","created_at":"2026-05-18T00:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"2WYC6I5SE3ZW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WYC6I5SE3ZWZ42K","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WYC6I5S","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:928eaef935a1931b0f88f48ed469dd8f070fb11e975ea934fe5c64de699f7cb2","target":"graph","created_at":"2026-05-18T00:50:24Z","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":"Redundancy is abundant in Fog networks (i.e., many computing and storage points) and grows linearly with network size. We demonstrate the transformational role of coding in Fog computing for leveraging such redundancy to substantially reduce the bandwidth consumption and latency of computing. In particular, we discuss two recently proposed coding concepts, namely Minimum Bandwidth Codes and Minimum Latency Codes, and illustrate their impacts in Fog computing. We also review a unified coding framework that includes the above two coding techniques as special cases, and enables a tradeoff between","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Songze Li","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T17:56:01Z","title":"Coding for Distributed Fog Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06082","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:ee30ddd2cfb593cc6eaa2b252c1807392464f3709da4cd87fafd5ded5948fb67","target":"record","created_at":"2026-05-18T00:50:24Z","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":"2507f944ffec95618cf33755c445e35bc8dbae9d018f8be43ffabe22d103738b","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T17:56:01Z","title_canon_sha256":"0586cad53182536e44e14e6f290f3da063669fa45f9ed981ef7f004f52c63fab"},"schema_version":"1.0","source":{"id":"1702.06082","kind":"arxiv","version":1}},"canonical_sha256":"d5b02f23b226f36cf34a75943440b15af63881ac9af09ac4536b4f57ba50b3b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5b02f23b226f36cf34a75943440b15af63881ac9af09ac4536b4f57ba50b3b3","first_computed_at":"2026-05-18T00:50:24.390412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:24.390412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UEhBZdddHQMTXgH0lemWM+TSMWI0g2pDpjGLUSUVbcQs4gOnX6+jl7psV6I+mcHFsMCfLP7kCyCqL0ACykvdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:24.391022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee30ddd2cfb593cc6eaa2b252c1807392464f3709da4cd87fafd5ded5948fb67","sha256:928eaef935a1931b0f88f48ed469dd8f070fb11e975ea934fe5c64de699f7cb2"],"state_sha256":"fa0db079b003b86f4c9c76d224bfc4bbaa8d398fe933db351774441ea04d449d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kih0OyrhjrULpWfS/JkVR+J9/mDw5CKkru6N4U9Hmr3BqAbSqEMDUWgzRsH4fF/pJFWQr2QJIlWlDyY24GTpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:49:14.518121Z","bundle_sha256":"ce7e779e884fe0e9b9462f65305f842efcdce9623ac1b5d392d2a1ba9ed8f9f7"}}