{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A2KQXBP7V3CASY2T5EVJEAGILF","short_pith_number":"pith:A2KQXBP7","canonical_record":{"source":{"id":"1408.2626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-12T05:49:53Z","cross_cats_sorted":[],"title_canon_sha256":"2507233f6fffcd702a8b66232aa3491e5aab0dc0964242f942df838abdca3c73","abstract_canon_sha256":"2eaabfd08c014f51c18eec7709dc9cc3e086fc6d0fca31273e601cfdcce56dba"},"schema_version":"1.0"},"canonical_sha256":"06950b85ffaec4096353e92a9200c859748cf177a51812f0a0a132a7f91375ca","source":{"kind":"arxiv","id":"1408.2626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2626","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2626v1","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2626","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"A2KQXBP7V3CA","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A2KQXBP7V3CASY2T","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A2KQXBP7","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A2KQXBP7V3CASY2T5EVJEAGILF","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-12T05:49:53Z","cross_cats_sorted":[],"title_canon_sha256":"2507233f6fffcd702a8b66232aa3491e5aab0dc0964242f942df838abdca3c73","abstract_canon_sha256":"2eaabfd08c014f51c18eec7709dc9cc3e086fc6d0fca31273e601cfdcce56dba"},"schema_version":"1.0"},"canonical_sha256":"06950b85ffaec4096353e92a9200c859748cf177a51812f0a0a132a7f91375ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.657073Z","signature_b64":"GKiVBaeE2VAE8+NW/+aKOMScR+xHFFV3Np44ERlqDJJJ8wCX52M/VhNDmvev6tfVVakXBQI1cg3mtV5BJUzVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06950b85ffaec4096353e92a9200c859748cf177a51812f0a0a132a7f91375ca","last_reissued_at":"2026-05-18T02:45:22.656667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.656667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2626","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-18T02:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wfsYis7ofmdxq0vycTaQdF8rUEvppI6fYZXPXLUxsdD9w5CUbtZaNO38karyoDhvI12W4J9X6LYOfHxwuI9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:46:58.055167Z"},"content_sha256":"53a03374b8a773552cd358bd420a3b2b717ba66b76ca2de5f27151b95c29e639","schema_version":"1.0","event_id":"sha256:53a03374b8a773552cd358bd420a3b2b717ba66b76ca2de5f27151b95c29e639"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A2KQXBP7V3CASY2T5EVJEAGILF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TCP-Forward: Fast and Reliable TCP Variant for Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dharma P. Agrawal, Yang Chi","submitted_at":"2014-08-12T05:49:53Z","abstract_excerpt":"The congestion control algorithms in TCP may incur inferior performance in a lossy network context like wireless networks. Previous works have shown that random linear network coding can improve the throughput of TCP in such networks, although it introduces extra decoding delay at the destination. In this paper we try to alleviate the decoding delay by replacing random linear network coding with LT Codes. Due to the inherent difference between linear network coding and Fountain Codes, such replacement is not as simple as it sounds. We conquer some practical problems and come up with TCP-Forwar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2626","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-18T02:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kefeEuLTDLDKDzlbOXRXa1uuqhWYCZpBReXWSeisvEQJJdcj/eCFQ63j5gMxn9FZCD62YJ9dg+yKDF4rkkliDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:46:58.055524Z"},"content_sha256":"b32df4d521fcc85e30a0d053e92461cdca431d3908126e84e1e62119ae9b6a6c","schema_version":"1.0","event_id":"sha256:b32df4d521fcc85e30a0d053e92461cdca431d3908126e84e1e62119ae9b6a6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2KQXBP7V3CASY2T5EVJEAGILF/bundle.json","state_url":"https://pith.science/pith/A2KQXBP7V3CASY2T5EVJEAGILF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2KQXBP7V3CASY2T5EVJEAGILF/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-27T03:46:58Z","links":{"resolver":"https://pith.science/pith/A2KQXBP7V3CASY2T5EVJEAGILF","bundle":"https://pith.science/pith/A2KQXBP7V3CASY2T5EVJEAGILF/bundle.json","state":"https://pith.science/pith/A2KQXBP7V3CASY2T5EVJEAGILF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2KQXBP7V3CASY2T5EVJEAGILF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A2KQXBP7V3CASY2T5EVJEAGILF","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":"2eaabfd08c014f51c18eec7709dc9cc3e086fc6d0fca31273e601cfdcce56dba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-12T05:49:53Z","title_canon_sha256":"2507233f6fffcd702a8b66232aa3491e5aab0dc0964242f942df838abdca3c73"},"schema_version":"1.0","source":{"id":"1408.2626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2626","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2626v1","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2626","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"A2KQXBP7V3CA","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A2KQXBP7V3CASY2T","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A2KQXBP7","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:b32df4d521fcc85e30a0d053e92461cdca431d3908126e84e1e62119ae9b6a6c","target":"graph","created_at":"2026-05-18T02:45:22Z","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":"The congestion control algorithms in TCP may incur inferior performance in a lossy network context like wireless networks. Previous works have shown that random linear network coding can improve the throughput of TCP in such networks, although it introduces extra decoding delay at the destination. In this paper we try to alleviate the decoding delay by replacing random linear network coding with LT Codes. Due to the inherent difference between linear network coding and Fountain Codes, such replacement is not as simple as it sounds. We conquer some practical problems and come up with TCP-Forwar","authors_text":"Dharma P. Agrawal, Yang Chi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-12T05:49:53Z","title":"TCP-Forward: Fast and Reliable TCP Variant for Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2626","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:53a03374b8a773552cd358bd420a3b2b717ba66b76ca2de5f27151b95c29e639","target":"record","created_at":"2026-05-18T02:45:22Z","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":"2eaabfd08c014f51c18eec7709dc9cc3e086fc6d0fca31273e601cfdcce56dba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-12T05:49:53Z","title_canon_sha256":"2507233f6fffcd702a8b66232aa3491e5aab0dc0964242f942df838abdca3c73"},"schema_version":"1.0","source":{"id":"1408.2626","kind":"arxiv","version":1}},"canonical_sha256":"06950b85ffaec4096353e92a9200c859748cf177a51812f0a0a132a7f91375ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06950b85ffaec4096353e92a9200c859748cf177a51812f0a0a132a7f91375ca","first_computed_at":"2026-05-18T02:45:22.656667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:22.656667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GKiVBaeE2VAE8+NW/+aKOMScR+xHFFV3Np44ERlqDJJJ8wCX52M/VhNDmvev6tfVVakXBQI1cg3mtV5BJUzVDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:22.657073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53a03374b8a773552cd358bd420a3b2b717ba66b76ca2de5f27151b95c29e639","sha256:b32df4d521fcc85e30a0d053e92461cdca431d3908126e84e1e62119ae9b6a6c"],"state_sha256":"8747048474bb9a704603e9b6993a3396a6f9bd96a53795899a737f2ad58dbf1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5qZLbadbClwBo2KS/4vxXrhUxLIhIAzTOHJNdbyYviXQXjPRMHlVQUz6giUCdcIvSM6PDCKSmkhMBKzM/9xBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:46:58.057383Z","bundle_sha256":"949a3bc25bee3164b91aeee5e4f0fcd1ddbd8c4b7110850552c08ac8fbaf6b73"}}