{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QNX4F6JPVPS5ZNKSHX3TTMXSDO","short_pith_number":"pith:QNX4F6JP","canonical_record":{"source":{"id":"1607.03025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T16:46:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d351f0a0755029a923916aa9aa66ce19a01ed607190e74c37964e4e127e577ad","abstract_canon_sha256":"53c208d21dbd322b61575de4f8eb7a339bc587b3ea2ef58d612d13cf71f6733e"},"schema_version":"1.0"},"canonical_sha256":"836fc2f92fabe5dcb5523df739b2f21babd1eb7230717820ecfa2a71713ee244","source":{"kind":"arxiv","id":"1607.03025","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03025","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03025v3","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03025","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"QNX4F6JPVPS5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QNX4F6JPVPS5ZNKS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QNX4F6JP","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QNX4F6JPVPS5ZNKSHX3TTMXSDO","target":"record","payload":{"canonical_record":{"source":{"id":"1607.03025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T16:46:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d351f0a0755029a923916aa9aa66ce19a01ed607190e74c37964e4e127e577ad","abstract_canon_sha256":"53c208d21dbd322b61575de4f8eb7a339bc587b3ea2ef58d612d13cf71f6733e"},"schema_version":"1.0"},"canonical_sha256":"836fc2f92fabe5dcb5523df739b2f21babd1eb7230717820ecfa2a71713ee244","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:25.485863Z","signature_b64":"4s7FGR1cNvcyWIFjf3DdeI6dWE4lms0CQOHDKDQshDzIdJfh14cL8OzygWIqfT7w2x32pnTEHBfeVuNkHBvsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"836fc2f92fabe5dcb5523df739b2f21babd1eb7230717820ecfa2a71713ee244","last_reissued_at":"2026-05-18T00:51:25.485229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:25.485229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.03025","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-05-18T00:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVySPBaIZWWUw/oyPHeX7gi+FU71BJdYDewtRxMKYLJoZWhJqmuNfeZHhf0da20Xy3wDqI5/c0ghLjnrckhaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:12:49.637575Z"},"content_sha256":"64c16ce71ad0e25696a7670c249f35dcb7c4ec6efcb471583d821dda8e0fd751","schema_version":"1.0","event_id":"sha256:64c16ce71ad0e25696a7670c249f35dcb7c4ec6efcb471583d821dda8e0fd751"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QNX4F6JPVPS5ZNKSHX3TTMXSDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Dissemination using Instantly Decodable Binary Codes in Fog-Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Douik, Sameh Sorour","submitted_at":"2016-07-11T16:46:54Z","abstract_excerpt":"Consider a device-to-device (D2D) fog-radio access network wherein a set of devices are required to store a set of files. Each device is connected to a subset of the cloud data centers and thus possesses a subset of the data. This paper investigates the problem of disseminating all files among the devices while reducing the total time of communication, i.e., the completion time, using instantly decodable network coding (IDNC). While previous studies on the use of IDNC in D2D systems assume a fully connected communication network, this paper tackles the more realistic scenario of a partially co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03025","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":""},"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLrEybYka0tR2lybOlIFd47RdWFTEe3Zyd4jt242cdJlZ2mshFlEdnHZygdq6/SchbpfcUIO3VSst0JP5WHXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:12:49.637920Z"},"content_sha256":"3b29b3551f676636c07ab3eccdb1a94e098de3f7b48fb180f2b4f1fa3d79743b","schema_version":"1.0","event_id":"sha256:3b29b3551f676636c07ab3eccdb1a94e098de3f7b48fb180f2b4f1fa3d79743b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNX4F6JPVPS5ZNKSHX3TTMXSDO/bundle.json","state_url":"https://pith.science/pith/QNX4F6JPVPS5ZNKSHX3TTMXSDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNX4F6JPVPS5ZNKSHX3TTMXSDO/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-06-23T17:12:49Z","links":{"resolver":"https://pith.science/pith/QNX4F6JPVPS5ZNKSHX3TTMXSDO","bundle":"https://pith.science/pith/QNX4F6JPVPS5ZNKSHX3TTMXSDO/bundle.json","state":"https://pith.science/pith/QNX4F6JPVPS5ZNKSHX3TTMXSDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNX4F6JPVPS5ZNKSHX3TTMXSDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QNX4F6JPVPS5ZNKSHX3TTMXSDO","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":"53c208d21dbd322b61575de4f8eb7a339bc587b3ea2ef58d612d13cf71f6733e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T16:46:54Z","title_canon_sha256":"d351f0a0755029a923916aa9aa66ce19a01ed607190e74c37964e4e127e577ad"},"schema_version":"1.0","source":{"id":"1607.03025","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03025","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03025v3","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03025","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"QNX4F6JPVPS5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QNX4F6JPVPS5ZNKS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QNX4F6JP","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:3b29b3551f676636c07ab3eccdb1a94e098de3f7b48fb180f2b4f1fa3d79743b","target":"graph","created_at":"2026-05-18T00:51:25Z","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":"Consider a device-to-device (D2D) fog-radio access network wherein a set of devices are required to store a set of files. Each device is connected to a subset of the cloud data centers and thus possesses a subset of the data. This paper investigates the problem of disseminating all files among the devices while reducing the total time of communication, i.e., the completion time, using instantly decodable network coding (IDNC). While previous studies on the use of IDNC in D2D systems assume a fully connected communication network, this paper tackles the more realistic scenario of a partially co","authors_text":"Ahmed Douik, Sameh Sorour","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T16:46:54Z","title":"Data Dissemination using Instantly Decodable Binary Codes in Fog-Radio Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03025","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:64c16ce71ad0e25696a7670c249f35dcb7c4ec6efcb471583d821dda8e0fd751","target":"record","created_at":"2026-05-18T00:51:25Z","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":"53c208d21dbd322b61575de4f8eb7a339bc587b3ea2ef58d612d13cf71f6733e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T16:46:54Z","title_canon_sha256":"d351f0a0755029a923916aa9aa66ce19a01ed607190e74c37964e4e127e577ad"},"schema_version":"1.0","source":{"id":"1607.03025","kind":"arxiv","version":3}},"canonical_sha256":"836fc2f92fabe5dcb5523df739b2f21babd1eb7230717820ecfa2a71713ee244","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"836fc2f92fabe5dcb5523df739b2f21babd1eb7230717820ecfa2a71713ee244","first_computed_at":"2026-05-18T00:51:25.485229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:25.485229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4s7FGR1cNvcyWIFjf3DdeI6dWE4lms0CQOHDKDQshDzIdJfh14cL8OzygWIqfT7w2x32pnTEHBfeVuNkHBvsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:25.485863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03025","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64c16ce71ad0e25696a7670c249f35dcb7c4ec6efcb471583d821dda8e0fd751","sha256:3b29b3551f676636c07ab3eccdb1a94e098de3f7b48fb180f2b4f1fa3d79743b"],"state_sha256":"4da0f047aea6027f537f0d22e4d4a92ca887d502e01e1d564cd080250ec11611"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8G/IIKXMC+3GqAWN7lewLzPQR+keMkyXZfDlGOnEpyVb2zW70MczGBqHkpnOcC6Dy0dAFrJkTbf0+YTIJEcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:12:49.639894Z","bundle_sha256":"ce049d80f99023418b5f9c6c93e3b2e67f2023829463801e3b4d3b5143e7a69e"}}