{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VTWVTYCF3BOBUCKAACASTZMBFO","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":"2f1aa1552bd51752f8c20fb59d1ce9a23549567be67cbdbe1b70d8070ff6f4ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-07T11:09:34Z","title_canon_sha256":"5b41f026f5d08eb726e770f30dfef8e3f39c22c966903ee46f47adebd45832f6"},"schema_version":"1.0","source":{"id":"1102.1273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1273","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1273v1","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1273","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"VTWVTYCF3BOB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VTWVTYCF3BOBUCKA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VTWVTYCF","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:89b67fb76c19231e028e49746ef572af1e8d0876c4b2f627d5035ad639cfcf38","target":"graph","created_at":"2026-05-18T04:29:54Z","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"},"paper":{"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","authors_text":"{\\L}ukasz Je\\.z","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-07T11:09:34Z","title":"One to Rule Them All: a General Randomized Algorithm for Buffer Management with Bounded Delay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1273","kind":"arxiv","version":1},"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:8b7a55c682292dc5629add81f7ecbf495a18764c8f36b9db2f07aec7530a6148","target":"record","created_at":"2026-05-18T04:29:54Z","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":"2f1aa1552bd51752f8c20fb59d1ce9a23549567be67cbdbe1b70d8070ff6f4ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-07T11:09:34Z","title_canon_sha256":"5b41f026f5d08eb726e770f30dfef8e3f39c22c966903ee46f47adebd45832f6"},"schema_version":"1.0","source":{"id":"1102.1273","kind":"arxiv","version":1}},"canonical_sha256":"aced59e045d85c1a0940008129e5812b97c7fae1c9de1c177c8a865b102c16a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aced59e045d85c1a0940008129e5812b97c7fae1c9de1c177c8a865b102c16a6","first_computed_at":"2026-05-18T04:29:54.612086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:54.612086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"784diSyefl/A9LgG/zJGRI8F1OAbt3CKx0hh08BjyoTjXWHz8YpNoq1SCj6ES3CWjbOjrVv06wOTuj+iAyS1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:54.612645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b7a55c682292dc5629add81f7ecbf495a18764c8f36b9db2f07aec7530a6148","sha256:89b67fb76c19231e028e49746ef572af1e8d0876c4b2f627d5035ad639cfcf38"],"state_sha256":"f8512bdb4b92eff7eb980c5dfa152adde56653ba4fd6fd0846a4b157a83ec730"}