{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JKE5WGZ2UMZSZE4UWZP4FHMROO","short_pith_number":"pith:JKE5WGZ2","schema_version":"1.0","canonical_sha256":"4a89db1b3aa3332c9394b65fc29d9173b1ed522c1ab00060488dc2ef9ba06d30","source":{"kind":"arxiv","id":"2201.04257","version":2},"attestation_state":"computed","paper":{"title":"The Information Velocity of Packet-Erasure Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Anatoly Khina, Elad Domanovitz, Tal Philosof","submitted_at":"2022-01-12T01:02:11Z","abstract_excerpt":"We consider the problem of in-order packet transmission over a cascade of packet-erasure links with acknowledgment (ACK) signals, interconnected by relays. We treat first the case of transmitting a single packet, in which ACKs are unnecessary, over links with independent identically distributed erasures. For this case, we derive tight upper and lower bounds on the probability of arrive failure within an allowed end-to-end communication delay over a given number of links. When the number of links is commensurate with the allowed delay, we determine the maximal ratio between the two -- coined in"},"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":"2201.04257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-12T01:02:11Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"2a79f0f34775b7c2fe26ed1151aa74ede34fde24ca6e5ccd6c2c95c12a260312","abstract_canon_sha256":"79b7d8fc16bd12b387e192de7034aaf2673a7ab018b150809b9dfe6c6c0acb1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:49.194607Z","signature_b64":"ZYEnVwWk+D9XEHErm3kWisGM72s2Uulm4yosBrmp5vTaLSRIGF9jIr8fZ0x+Kmm7kPuHB8akPYUWK/6LTL+gAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a89db1b3aa3332c9394b65fc29d9173b1ed522c1ab00060488dc2ef9ba06d30","last_reissued_at":"2026-07-05T03:48:49.194253Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:49.194253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Information Velocity of Packet-Erasure Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Anatoly Khina, Elad Domanovitz, Tal Philosof","submitted_at":"2022-01-12T01:02:11Z","abstract_excerpt":"We consider the problem of in-order packet transmission over a cascade of packet-erasure links with acknowledgment (ACK) signals, interconnected by relays. We treat first the case of transmitting a single packet, in which ACKs are unnecessary, over links with independent identically distributed erasures. For this case, we derive tight upper and lower bounds on the probability of arrive failure within an allowed end-to-end communication delay over a given number of links. When the number of links is commensurate with the allowed delay, we determine the maximal ratio between the two -- coined in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.04257","kind":"arxiv","version":2},"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/2201.04257/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":"2201.04257","created_at":"2026-07-05T03:48:49.194308+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.04257v2","created_at":"2026-07-05T03:48:49.194308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.04257","created_at":"2026-07-05T03:48:49.194308+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKE5WGZ2UMZS","created_at":"2026-07-05T03:48:49.194308+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKE5WGZ2UMZSZE4U","created_at":"2026-07-05T03:48:49.194308+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKE5WGZ2","created_at":"2026-07-05T03:48:49.194308+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/JKE5WGZ2UMZSZE4UWZP4FHMROO","json":"https://pith.science/pith/JKE5WGZ2UMZSZE4UWZP4FHMROO.json","graph_json":"https://pith.science/api/pith-number/JKE5WGZ2UMZSZE4UWZP4FHMROO/graph.json","events_json":"https://pith.science/api/pith-number/JKE5WGZ2UMZSZE4UWZP4FHMROO/events.json","paper":"https://pith.science/paper/JKE5WGZ2"},"agent_actions":{"view_html":"https://pith.science/pith/JKE5WGZ2UMZSZE4UWZP4FHMROO","download_json":"https://pith.science/pith/JKE5WGZ2UMZSZE4UWZP4FHMROO.json","view_paper":"https://pith.science/paper/JKE5WGZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.04257&json=true","fetch_graph":"https://pith.science/api/pith-number/JKE5WGZ2UMZSZE4UWZP4FHMROO/graph.json","fetch_events":"https://pith.science/api/pith-number/JKE5WGZ2UMZSZE4UWZP4FHMROO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKE5WGZ2UMZSZE4UWZP4FHMROO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKE5WGZ2UMZSZE4UWZP4FHMROO/action/storage_attestation","attest_author":"https://pith.science/pith/JKE5WGZ2UMZSZE4UWZP4FHMROO/action/author_attestation","sign_citation":"https://pith.science/pith/JKE5WGZ2UMZSZE4UWZP4FHMROO/action/citation_signature","submit_replication":"https://pith.science/pith/JKE5WGZ2UMZSZE4UWZP4FHMROO/action/replication_record"}},"created_at":"2026-07-05T03:48:49.194308+00:00","updated_at":"2026-07-05T03:48:49.194308+00:00"}