{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KM6K6MMM7SLYE3IG6EZUDTTZGI","short_pith_number":"pith:KM6K6MMM","schema_version":"1.0","canonical_sha256":"533caf318cfc97826d06f13341ce79320ea799fa07a2a3d0b285bb7cc4926c85","source":{"kind":"arxiv","id":"1806.05776","version":2},"attestation_state":"computed","paper":{"title":"Tiny Codes for Guaranteeable Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Derya Malak, Edmund M. Yeh, Muriel M\\'edard","submitted_at":"2018-06-15T01:08:35Z","abstract_excerpt":"Future 5G systems will need to support ultra-reliable low-latency communications scenarios. From a latency-reliability viewpoint, it is inefficient to rely on average utility-based system design. Therefore, we introduce the notion of guaranteeable delay which is the average delay plus three standard deviations of the mean. We investigate the trade-off between guaranteeable delay and throughput for point-to-point wireless erasure links with unreliable and delayed feedback, by bringing together signal flow techniques to the area of coding. We use tiny codes, i.e. sliding window by coding with ju"},"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":"1806.05776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-15T01:08:35Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"b0316cd2848bf1b6a3b7241ad708ec6b1496f1a8a69d821003ef026120b3cd63","abstract_canon_sha256":"ee14b2aa7a78de6fa3d1e810d37999e9aa6bba38faad657b2f3f6fa02bb32857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:54.200369Z","signature_b64":"On1/xgrg9rNI8i6dKPwxzs4gAW4cRSwMi5DeCwJBIUo4SJnYMSDEZJXCEd6i06+PzJNLf21bwX1UPH/M8R7zCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"533caf318cfc97826d06f13341ce79320ea799fa07a2a3d0b285bb7cc4926c85","last_reissued_at":"2026-05-17T23:54:54.199853Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:54.199853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tiny Codes for Guaranteeable Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Derya Malak, Edmund M. Yeh, Muriel M\\'edard","submitted_at":"2018-06-15T01:08:35Z","abstract_excerpt":"Future 5G systems will need to support ultra-reliable low-latency communications scenarios. From a latency-reliability viewpoint, it is inefficient to rely on average utility-based system design. Therefore, we introduce the notion of guaranteeable delay which is the average delay plus three standard deviations of the mean. We investigate the trade-off between guaranteeable delay and throughput for point-to-point wireless erasure links with unreliable and delayed feedback, by bringing together signal flow techniques to the area of coding. We use tiny codes, i.e. sliding window by coding with ju"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05776","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":""},"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":"1806.05776","created_at":"2026-05-17T23:54:54.199931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05776v2","created_at":"2026-05-17T23:54:54.199931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05776","created_at":"2026-05-17T23:54:54.199931+00:00"},{"alias_kind":"pith_short_12","alias_value":"KM6K6MMM7SLY","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KM6K6MMM7SLYE3IG","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KM6K6MMM","created_at":"2026-05-18T12:32:33.847187+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/KM6K6MMM7SLYE3IG6EZUDTTZGI","json":"https://pith.science/pith/KM6K6MMM7SLYE3IG6EZUDTTZGI.json","graph_json":"https://pith.science/api/pith-number/KM6K6MMM7SLYE3IG6EZUDTTZGI/graph.json","events_json":"https://pith.science/api/pith-number/KM6K6MMM7SLYE3IG6EZUDTTZGI/events.json","paper":"https://pith.science/paper/KM6K6MMM"},"agent_actions":{"view_html":"https://pith.science/pith/KM6K6MMM7SLYE3IG6EZUDTTZGI","download_json":"https://pith.science/pith/KM6K6MMM7SLYE3IG6EZUDTTZGI.json","view_paper":"https://pith.science/paper/KM6K6MMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05776&json=true","fetch_graph":"https://pith.science/api/pith-number/KM6K6MMM7SLYE3IG6EZUDTTZGI/graph.json","fetch_events":"https://pith.science/api/pith-number/KM6K6MMM7SLYE3IG6EZUDTTZGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KM6K6MMM7SLYE3IG6EZUDTTZGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KM6K6MMM7SLYE3IG6EZUDTTZGI/action/storage_attestation","attest_author":"https://pith.science/pith/KM6K6MMM7SLYE3IG6EZUDTTZGI/action/author_attestation","sign_citation":"https://pith.science/pith/KM6K6MMM7SLYE3IG6EZUDTTZGI/action/citation_signature","submit_replication":"https://pith.science/pith/KM6K6MMM7SLYE3IG6EZUDTTZGI/action/replication_record"}},"created_at":"2026-05-17T23:54:54.199931+00:00","updated_at":"2026-05-17T23:54:54.199931+00:00"}