{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VTWVTYCF3BOBUCKAACASTZMBFO","short_pith_number":"pith:VTWVTYCF","schema_version":"1.0","canonical_sha256":"aced59e045d85c1a0940008129e5812b97c7fae1c9de1c177c8a865b102c16a6","source":{"kind":"arxiv","id":"1102.1273","version":1},"attestation_state":"computed","paper":{"title":"One to Rule Them All: a General Randomized Algorithm for Buffer Management with Bounded Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"{\\L}ukasz Je\\.z","submitted_at":"2011-02-07T11:09:34Z","abstract_excerpt":"We give a memoryless scale-invariant randomized algorithm for the Buffer Management with Bounded Delay problem that is e/(e-1)-competitive against an adaptive adversary, together with better performance guarantees for many restricted variants, including the s-bounded instances. In particular, our algorithm attains the optimum competitive ratio of 4/3 on 2-bounded instances.\n  Both the algorithm and its analysis are applicable to a more general problem, called Collecting Items, in which only the relative order between packets' deadlines is known. Our algorithm is the optimal randomized memoryle"},"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":"1102.1273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-07T11:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"5b41f026f5d08eb726e770f30dfef8e3f39c22c966903ee46f47adebd45832f6","abstract_canon_sha256":"2f1aa1552bd51752f8c20fb59d1ce9a23549567be67cbdbe1b70d8070ff6f4ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.612645Z","signature_b64":"784diSyefl/A9LgG/zJGRI8F1OAbt3CKx0hh08BjyoTjXWHz8YpNoq1SCj6ES3CWjbOjrVv06wOTuj+iAyS1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aced59e045d85c1a0940008129e5812b97c7fae1c9de1c177c8a865b102c16a6","last_reissued_at":"2026-05-18T04:29:54.612086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.612086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One to Rule Them All: a General Randomized Algorithm for Buffer Management with Bounded Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"{\\L}ukasz Je\\.z","submitted_at":"2011-02-07T11:09:34Z","abstract_excerpt":"We give a memoryless scale-invariant randomized algorithm for the Buffer Management with Bounded Delay problem that is e/(e-1)-competitive against an adaptive adversary, together with better performance guarantees for many restricted variants, including the s-bounded instances. In particular, our algorithm attains the optimum competitive ratio of 4/3 on 2-bounded instances.\n  Both the algorithm and its analysis are applicable to a more general problem, called Collecting Items, in which only the relative order between packets' deadlines is known. Our algorithm is the optimal randomized memoryle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1273","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.1273","created_at":"2026-05-18T04:29:54.612166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1273v1","created_at":"2026-05-18T04:29:54.612166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1273","created_at":"2026-05-18T04:29:54.612166+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTWVTYCF3BOB","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTWVTYCF3BOBUCKA","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTWVTYCF","created_at":"2026-05-18T12:26:44.992195+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/VTWVTYCF3BOBUCKAACASTZMBFO","json":"https://pith.science/pith/VTWVTYCF3BOBUCKAACASTZMBFO.json","graph_json":"https://pith.science/api/pith-number/VTWVTYCF3BOBUCKAACASTZMBFO/graph.json","events_json":"https://pith.science/api/pith-number/VTWVTYCF3BOBUCKAACASTZMBFO/events.json","paper":"https://pith.science/paper/VTWVTYCF"},"agent_actions":{"view_html":"https://pith.science/pith/VTWVTYCF3BOBUCKAACASTZMBFO","download_json":"https://pith.science/pith/VTWVTYCF3BOBUCKAACASTZMBFO.json","view_paper":"https://pith.science/paper/VTWVTYCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1273&json=true","fetch_graph":"https://pith.science/api/pith-number/VTWVTYCF3BOBUCKAACASTZMBFO/graph.json","fetch_events":"https://pith.science/api/pith-number/VTWVTYCF3BOBUCKAACASTZMBFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTWVTYCF3BOBUCKAACASTZMBFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTWVTYCF3BOBUCKAACASTZMBFO/action/storage_attestation","attest_author":"https://pith.science/pith/VTWVTYCF3BOBUCKAACASTZMBFO/action/author_attestation","sign_citation":"https://pith.science/pith/VTWVTYCF3BOBUCKAACASTZMBFO/action/citation_signature","submit_replication":"https://pith.science/pith/VTWVTYCF3BOBUCKAACASTZMBFO/action/replication_record"}},"created_at":"2026-05-18T04:29:54.612166+00:00","updated_at":"2026-05-18T04:29:54.612166+00:00"}