{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DGABUHYQPRP4F4KR6K3LTQSEAO","short_pith_number":"pith:DGABUHYQ","schema_version":"1.0","canonical_sha256":"19801a1f107c5fc2f151f2b6b9c2440394537b8716ae5ebf8a51c897d4545b04","source":{"kind":"arxiv","id":"1303.3386","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Randomized Online Algorithm for Reordering Buffer Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Noa Avigdor-Elgrabli, Yuval Rabani","submitted_at":"2013-03-14T09:47:49Z","abstract_excerpt":"We give an $O(\\log\\log k)$-competitive randomized online algorithm for reordering buffer management, where $k$ is the buffer size. Our bound matches the lower bound of Adamaszek et al. (STOC 2011). Our algorithm has two stages which are executed online in parallel. The first stage computes deterministically a feasible fractional solution to an LP relaxation for reordering buffer management. The second stage \"rounds\" using randomness the fractional solution. The first stage is based on the online primal-dual schema, combined with a dual fitting argument. As multiplicative weights steps and dual"},"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":"1303.3386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-14T09:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"6668569adcb9a38fe0e843b3b31eb9ffcb6dd5fc845f5da0135b9c71ee8d19f6","abstract_canon_sha256":"44e969986eb34cf553dd42f8d9d02dc944e090da6982ec76560938b93655715e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:54.696780Z","signature_b64":"CKvqz3hnRt11tUdQUNs2VIMYrQzuUCzhmUfp3fmqjTBnuv9N5ZVSllQhlWNCayDv76yWqcOkgsPyHTbMaKdjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19801a1f107c5fc2f151f2b6b9c2440394537b8716ae5ebf8a51c897d4545b04","last_reissued_at":"2026-05-18T03:30:54.695975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:54.695975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Randomized Online Algorithm for Reordering Buffer Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Noa Avigdor-Elgrabli, Yuval Rabani","submitted_at":"2013-03-14T09:47:49Z","abstract_excerpt":"We give an $O(\\log\\log k)$-competitive randomized online algorithm for reordering buffer management, where $k$ is the buffer size. Our bound matches the lower bound of Adamaszek et al. (STOC 2011). Our algorithm has two stages which are executed online in parallel. The first stage computes deterministically a feasible fractional solution to an LP relaxation for reordering buffer management. The second stage \"rounds\" using randomness the fractional solution. The first stage is based on the online primal-dual schema, combined with a dual fitting argument. As multiplicative weights steps and dual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3386","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":"1303.3386","created_at":"2026-05-18T03:30:54.696114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3386v1","created_at":"2026-05-18T03:30:54.696114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3386","created_at":"2026-05-18T03:30:54.696114+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGABUHYQPRP4","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGABUHYQPRP4F4KR","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGABUHYQ","created_at":"2026-05-18T12:27:43.054852+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/DGABUHYQPRP4F4KR6K3LTQSEAO","json":"https://pith.science/pith/DGABUHYQPRP4F4KR6K3LTQSEAO.json","graph_json":"https://pith.science/api/pith-number/DGABUHYQPRP4F4KR6K3LTQSEAO/graph.json","events_json":"https://pith.science/api/pith-number/DGABUHYQPRP4F4KR6K3LTQSEAO/events.json","paper":"https://pith.science/paper/DGABUHYQ"},"agent_actions":{"view_html":"https://pith.science/pith/DGABUHYQPRP4F4KR6K3LTQSEAO","download_json":"https://pith.science/pith/DGABUHYQPRP4F4KR6K3LTQSEAO.json","view_paper":"https://pith.science/paper/DGABUHYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3386&json=true","fetch_graph":"https://pith.science/api/pith-number/DGABUHYQPRP4F4KR6K3LTQSEAO/graph.json","fetch_events":"https://pith.science/api/pith-number/DGABUHYQPRP4F4KR6K3LTQSEAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGABUHYQPRP4F4KR6K3LTQSEAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGABUHYQPRP4F4KR6K3LTQSEAO/action/storage_attestation","attest_author":"https://pith.science/pith/DGABUHYQPRP4F4KR6K3LTQSEAO/action/author_attestation","sign_citation":"https://pith.science/pith/DGABUHYQPRP4F4KR6K3LTQSEAO/action/citation_signature","submit_replication":"https://pith.science/pith/DGABUHYQPRP4F4KR6K3LTQSEAO/action/replication_record"}},"created_at":"2026-05-18T03:30:54.696114+00:00","updated_at":"2026-05-18T03:30:54.696114+00:00"}