{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4OXFHZCT6IMYPBU4FIXARQ6FGZ","short_pith_number":"pith:4OXFHZCT","schema_version":"1.0","canonical_sha256":"e3ae53e453f21987869c2a2e08c3c53648442f1d6f21fd3705a039440f2cd1df","source":{"kind":"arxiv","id":"2502.11984","version":4},"attestation_state":"computed","paper":{"title":"Blank Space: Adaptive Causal Coding for Streaming Communications Over Multi-Hop Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Adina Waxman, Alejandro Cohen, Aviel Glam, Rivka Gitik, Shai Ginzach","submitted_at":"2025-02-17T16:25:19Z","abstract_excerpt":"In this work, we introduce Blank Space Adaptive Causal Random Linear Network Coding (BS-AC-RLNC), a novel coding scheme designed to mitigate the triplet trade-off between throughput-delay-efficiency in multi-hop networks. BS-AC-RLNC leverages the physical limitations of the network, considering the bottleneck from each node to the destination. In particular, this approach introduces a light-computational re-encoding algorithm, called AC-RLNC (NET), implemented independently at intermediate nodes. NET adaptively adjusts the Forward Error Correction (FEC) rates and schedules idle periods. It inc"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.11984","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-17T16:25:19Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f36b27f03e819e18f9ecf8b8f0acd9821ff6b639ada5e4023665dcd575c661aa","abstract_canon_sha256":"119c6deb95d26b07592dcf98cf494ee7020d451dc79fbca6c32fdcc00557771a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:52.131312Z","signature_b64":"pEtHSvQ4HZF5Q+gn/RfNLYCJiuRsNm/FkqKFHjOGjgVb/58i+DxXZLUxFCDoH60yE9zqbUxrxXczEK0e1kKeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ae53e453f21987869c2a2e08c3c53648442f1d6f21fd3705a039440f2cd1df","last_reissued_at":"2026-05-20T01:04:52.130445Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:52.130445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blank Space: Adaptive Causal Coding for Streaming Communications Over Multi-Hop Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Adina Waxman, Alejandro Cohen, Aviel Glam, Rivka Gitik, Shai Ginzach","submitted_at":"2025-02-17T16:25:19Z","abstract_excerpt":"In this work, we introduce Blank Space Adaptive Causal Random Linear Network Coding (BS-AC-RLNC), a novel coding scheme designed to mitigate the triplet trade-off between throughput-delay-efficiency in multi-hop networks. BS-AC-RLNC leverages the physical limitations of the network, considering the bottleneck from each node to the destination. In particular, this approach introduces a light-computational re-encoding algorithm, called AC-RLNC (NET), implemented independently at intermediate nodes. NET adaptively adjusts the Forward Error Correction (FEC) rates and schedules idle periods. It inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11984","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.11984/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.11984","created_at":"2026-05-20T01:04:52.130590+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.11984v4","created_at":"2026-05-20T01:04:52.130590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11984","created_at":"2026-05-20T01:04:52.130590+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OXFHZCT6IMY","created_at":"2026-05-20T01:04:52.130590+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OXFHZCT6IMYPBU4","created_at":"2026-05-20T01:04:52.130590+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OXFHZCT","created_at":"2026-05-20T01:04:52.130590+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ","json":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ.json","graph_json":"https://pith.science/api/pith-number/4OXFHZCT6IMYPBU4FIXARQ6FGZ/graph.json","events_json":"https://pith.science/api/pith-number/4OXFHZCT6IMYPBU4FIXARQ6FGZ/events.json","paper":"https://pith.science/paper/4OXFHZCT"},"agent_actions":{"view_html":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ","download_json":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ.json","view_paper":"https://pith.science/paper/4OXFHZCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.11984&json=true","fetch_graph":"https://pith.science/api/pith-number/4OXFHZCT6IMYPBU4FIXARQ6FGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4OXFHZCT6IMYPBU4FIXARQ6FGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/action/storage_attestation","attest_author":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/action/author_attestation","sign_citation":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/action/citation_signature","submit_replication":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/action/replication_record"}},"created_at":"2026-05-20T01:04:52.130590+00:00","updated_at":"2026-05-20T01:04:52.130590+00:00"}