{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4OXFHZCT6IMYPBU4FIXARQ6FGZ","short_pith_number":"pith:4OXFHZCT","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"},"canonical_sha256":"e3ae53e453f21987869c2a2e08c3c53648442f1d6f21fd3705a039440f2cd1df","source":{"kind":"arxiv","id":"2502.11984","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11984","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11984v4","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11984","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"4OXFHZCT6IMY","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"4OXFHZCT6IMYPBU4","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"4OXFHZCT","created_at":"2026-05-20T01:04:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4OXFHZCT6IMYPBU4FIXARQ6FGZ","target":"record","payload":{"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"},"canonical_sha256":"e3ae53e453f21987869c2a2e08c3c53648442f1d6f21fd3705a039440f2cd1df","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"},"source_kind":"arxiv","source_id":"2502.11984","source_version":4,"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-20T01:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wp79J47sCxvK9LlmAbCteilsuGByjtK9YOZjkjLjloSM2hSon3c+sbr7hIQh5bu8WTPRnrTKRn8s+oVQTTrHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:27:25.011190Z"},"content_sha256":"3d62e44efa83edc4d653cacd458e5f390a0c7c4ccd0e5db644511ecb6f84bb4d","schema_version":"1.0","event_id":"sha256:3d62e44efa83edc4d653cacd458e5f390a0c7c4ccd0e5db644511ecb6f84bb4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4OXFHZCT6IMYPBU4FIXARQ6FGZ","target":"graph","payload":{"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"},"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-20T01:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFuZy5BHZMN1c9zlN655EVvf76uxMc94/eBwie32KPPum2/CYCpGOXhiQw1n0Y9CnQq4McI2oCpH+GZk6lfpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:27:25.011975Z"},"content_sha256":"1d64a8769277c5b106ed271527789f33990a2246177e54ac9b94b300c84e912c","schema_version":"1.0","event_id":"sha256:1d64a8769277c5b106ed271527789f33990a2246177e54ac9b94b300c84e912c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/bundle.json","state_url":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/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-24T23:27:25Z","links":{"resolver":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ","bundle":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/bundle.json","state":"https://pith.science/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OXFHZCT6IMYPBU4FIXARQ6FGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4OXFHZCT6IMYPBU4FIXARQ6FGZ","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":"119c6deb95d26b07592dcf98cf494ee7020d451dc79fbca6c32fdcc00557771a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-17T16:25:19Z","title_canon_sha256":"f36b27f03e819e18f9ecf8b8f0acd9821ff6b639ada5e4023665dcd575c661aa"},"schema_version":"1.0","source":{"id":"2502.11984","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11984","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11984v4","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11984","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"4OXFHZCT6IMY","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"4OXFHZCT6IMYPBU4","created_at":"2026-05-20T01:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"4OXFHZCT","created_at":"2026-05-20T01:04:52Z"}],"graph_snapshots":[{"event_id":"sha256:1d64a8769277c5b106ed271527789f33990a2246177e54ac9b94b300c84e912c","target":"graph","created_at":"2026-05-20T01:04:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.11984/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Adina Waxman, Alejandro Cohen, Aviel Glam, Rivka Gitik, Shai Ginzach","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-17T16:25:19Z","title":"Blank Space: Adaptive Causal Coding for Streaming Communications Over Multi-Hop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11984","kind":"arxiv","version":4},"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:3d62e44efa83edc4d653cacd458e5f390a0c7c4ccd0e5db644511ecb6f84bb4d","target":"record","created_at":"2026-05-20T01:04:52Z","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":"119c6deb95d26b07592dcf98cf494ee7020d451dc79fbca6c32fdcc00557771a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-17T16:25:19Z","title_canon_sha256":"f36b27f03e819e18f9ecf8b8f0acd9821ff6b639ada5e4023665dcd575c661aa"},"schema_version":"1.0","source":{"id":"2502.11984","kind":"arxiv","version":4}},"canonical_sha256":"e3ae53e453f21987869c2a2e08c3c53648442f1d6f21fd3705a039440f2cd1df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ae53e453f21987869c2a2e08c3c53648442f1d6f21fd3705a039440f2cd1df","first_computed_at":"2026-05-20T01:04:52.130445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:04:52.130445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pEtHSvQ4HZF5Q+gn/RfNLYCJiuRsNm/FkqKFHjOGjgVb/58i+DxXZLUxFCDoH60yE9zqbUxrxXczEK0e1kKeDw==","signature_status":"signed_v1","signed_at":"2026-05-20T01:04:52.131312Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11984","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d62e44efa83edc4d653cacd458e5f390a0c7c4ccd0e5db644511ecb6f84bb4d","sha256:1d64a8769277c5b106ed271527789f33990a2246177e54ac9b94b300c84e912c"],"state_sha256":"17af49d7b92498bf0dad1bf920a382edb547c8bd16e7e781647f9765c3d66d9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaO3nOftfbScKMmr3PvN4q54IgM33gHd2kItIO+P7/vIL9/CynJ7jAcBG4+0qK+e0URRlZ2ctILO0CPv0zobAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:27:25.015091Z","bundle_sha256":"fbbf5931a0bba7e2143bb5d475be94a9e3a9d479b997d37af647a8b951f37407"}}