{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DXOACW7GSWCC5KV5C2ZBTIUKFP","short_pith_number":"pith:DXOACW7G","canonical_record":{"source":{"id":"1704.04698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T23:37:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"89a067242e01db7411acd10e1829af00c564fbfcf6526d26e84bfd7365a378cd","abstract_canon_sha256":"58f8be9286294acfffd380d520780729d8b383c569da0803ea55c2567ee021aa"},"schema_version":"1.0"},"canonical_sha256":"1ddc015be695842eaabd16b219a28a2beef55abc368fb84dc89e2b62ec53bcc2","source":{"kind":"arxiv","id":"1704.04698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04698","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04698v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04698","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"DXOACW7GSWCC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DXOACW7GSWCC5KV5","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DXOACW7G","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DXOACW7GSWCC5KV5C2ZBTIUKFP","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T23:37:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"89a067242e01db7411acd10e1829af00c564fbfcf6526d26e84bfd7365a378cd","abstract_canon_sha256":"58f8be9286294acfffd380d520780729d8b383c569da0803ea55c2567ee021aa"},"schema_version":"1.0"},"canonical_sha256":"1ddc015be695842eaabd16b219a28a2beef55abc368fb84dc89e2b62ec53bcc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.920816Z","signature_b64":"DAi+EQ2K3KPBX3v3YmXFgZH+xMI9tirVcdqAjyLp3ywuoP7uvCNzMboWPp1a2vkeLC61IomA7BoTAW5/ZS0kBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ddc015be695842eaabd16b219a28a2beef55abc368fb84dc89e2b62ec53bcc2","last_reissued_at":"2026-05-18T00:46:17.920472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.920472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04698","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:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/R0kVOttwttnjknxboydp0/Zf2E3qTUlJ63tOrYKH0dmUSZnmkaPX/lRMo7F/d5EEyfwVMliqBrYGFTe/2kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:34:55.115605Z"},"content_sha256":"4ff37a4130959294f37cba8b83d48ea5347872e0169ba8cd625bde0e76db4c10","schema_version":"1.0","event_id":"sha256:4ff37a4130959294f37cba8b83d48ea5347872e0169ba8cd625bde0e76db4c10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DXOACW7GSWCC5KV5C2ZBTIUKFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Network Coding Schemes for Satellite Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ala Eddine Gharsellaoui, Alessandro Vanelli-Coralli, Daniele Tarchi, Samah A. M. Ghanem","submitted_at":"2017-04-15T23:37:19Z","abstract_excerpt":"In this paper, we propose two novel physical layer aware adaptive network coding and coded modulation schemes for time variant channels. The proposed schemes have been applied to different satellite communications scenarios with different Round Trip Times (RTT). Compared to adaptive network coding, and classical non-adaptive network coding schemes for time variant channels, as benchmarks, the proposed schemes demonstrate that adaptation of packet transmission based on the channel variation and corresponding erasures allows for significant gains in terms of throughput, delay and energy efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04698","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:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt8AJuNf2TSmK84NgF1B+9IFuyeR+AxkeunG/1b4AXmako1bm3MdyiKS60L1JjQzC9GUryo6VG1XX1/KF808Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:34:55.115973Z"},"content_sha256":"585754565d4ec617c259fdfe5e1c64d7c7f7d5e6dc1fd04b54550482a5566fd7","schema_version":"1.0","event_id":"sha256:585754565d4ec617c259fdfe5e1c64d7c7f7d5e6dc1fd04b54550482a5566fd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXOACW7GSWCC5KV5C2ZBTIUKFP/bundle.json","state_url":"https://pith.science/pith/DXOACW7GSWCC5KV5C2ZBTIUKFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXOACW7GSWCC5KV5C2ZBTIUKFP/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-07-01T00:34:55Z","links":{"resolver":"https://pith.science/pith/DXOACW7GSWCC5KV5C2ZBTIUKFP","bundle":"https://pith.science/pith/DXOACW7GSWCC5KV5C2ZBTIUKFP/bundle.json","state":"https://pith.science/pith/DXOACW7GSWCC5KV5C2ZBTIUKFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXOACW7GSWCC5KV5C2ZBTIUKFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DXOACW7GSWCC5KV5C2ZBTIUKFP","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":"58f8be9286294acfffd380d520780729d8b383c569da0803ea55c2567ee021aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T23:37:19Z","title_canon_sha256":"89a067242e01db7411acd10e1829af00c564fbfcf6526d26e84bfd7365a378cd"},"schema_version":"1.0","source":{"id":"1704.04698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04698","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04698v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04698","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"DXOACW7GSWCC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DXOACW7GSWCC5KV5","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DXOACW7G","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:585754565d4ec617c259fdfe5e1c64d7c7f7d5e6dc1fd04b54550482a5566fd7","target":"graph","created_at":"2026-05-18T00:46:17Z","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":"In this paper, we propose two novel physical layer aware adaptive network coding and coded modulation schemes for time variant channels. The proposed schemes have been applied to different satellite communications scenarios with different Round Trip Times (RTT). Compared to adaptive network coding, and classical non-adaptive network coding schemes for time variant channels, as benchmarks, the proposed schemes demonstrate that adaptation of packet transmission based on the channel variation and corresponding erasures allows for significant gains in terms of throughput, delay and energy efficien","authors_text":"Ala Eddine Gharsellaoui, Alessandro Vanelli-Coralli, Daniele Tarchi, Samah A. M. Ghanem","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T23:37:19Z","title":"Adaptive Network Coding Schemes for Satellite Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04698","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:4ff37a4130959294f37cba8b83d48ea5347872e0169ba8cd625bde0e76db4c10","target":"record","created_at":"2026-05-18T00:46:17Z","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":"58f8be9286294acfffd380d520780729d8b383c569da0803ea55c2567ee021aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T23:37:19Z","title_canon_sha256":"89a067242e01db7411acd10e1829af00c564fbfcf6526d26e84bfd7365a378cd"},"schema_version":"1.0","source":{"id":"1704.04698","kind":"arxiv","version":1}},"canonical_sha256":"1ddc015be695842eaabd16b219a28a2beef55abc368fb84dc89e2b62ec53bcc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ddc015be695842eaabd16b219a28a2beef55abc368fb84dc89e2b62ec53bcc2","first_computed_at":"2026-05-18T00:46:17.920472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:17.920472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DAi+EQ2K3KPBX3v3YmXFgZH+xMI9tirVcdqAjyLp3ywuoP7uvCNzMboWPp1a2vkeLC61IomA7BoTAW5/ZS0kBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:17.920816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ff37a4130959294f37cba8b83d48ea5347872e0169ba8cd625bde0e76db4c10","sha256:585754565d4ec617c259fdfe5e1c64d7c7f7d5e6dc1fd04b54550482a5566fd7"],"state_sha256":"d1b89539cb55248bb2c6ca076932075441e9aa9a7e334b51c941f8b46e9921d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZbXZrjOkJNluqzqLgWzA4PkfteZ2LKaKunhL/UlVGQpd3VrmeafS2v61uyhfdJzKyyWP+A1wR51VMcoMdf9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T00:34:55.118093Z","bundle_sha256":"5beeddb79ba5add7322687bac634f3f17996bd70f5faf2f605d81e5cc52adebc"}}