{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EAGCLL3WMGJR3M72EJ3HGK66AD","short_pith_number":"pith:EAGCLL3W","schema_version":"1.0","canonical_sha256":"200c25af7661931db3fa2276732bde00fdb5e237b592ae4f8250febd85344c5d","source":{"kind":"arxiv","id":"1204.5823","version":1},"attestation_state":"computed","paper":{"title":"A Bicriteria Approximation for the Reordering Buffer Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Seeun Umboh, Shuchi Chawla, Siddharth Barman","submitted_at":"2012-04-26T03:33:41Z","abstract_excerpt":"In the reordering buffer problem (RBP), a server is asked to process a sequence of requests lying in a metric space. To process a request the server must move to the corresponding point in the metric. The requests can be processed slightly out of order; in particular, the server has a buffer of capacity k which can store up to k requests as it reads in the sequence. The goal is to reorder the requests in such a manner that the buffer constraint is satisfied and the total travel cost of the server is minimized. The RBP arises in many applications that require scheduling with a limited buffer ca"},"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":"1204.5823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T03:33:41Z","cross_cats_sorted":[],"title_canon_sha256":"909fb74eb5d29786e7dde0c2434b914b3735cb640f6bb91d9c0d6c10f94bc3e7","abstract_canon_sha256":"6267cc7f3ea9d314560bfbfde62c1ca9ff822045dbc3b2dc1d23b1ead4a71195"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:59.410863Z","signature_b64":"aFl3TwMPsclMLKrjVoe3/6kXp1sZDJ32Chv5lRlFgk4drUqRTNqsznAVeymPvxaKJh4xeLjEptDdyFs2xV/hBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"200c25af7661931db3fa2276732bde00fdb5e237b592ae4f8250febd85344c5d","last_reissued_at":"2026-05-18T03:56:59.409875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:59.409875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bicriteria Approximation for the Reordering Buffer Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Seeun Umboh, Shuchi Chawla, Siddharth Barman","submitted_at":"2012-04-26T03:33:41Z","abstract_excerpt":"In the reordering buffer problem (RBP), a server is asked to process a sequence of requests lying in a metric space. To process a request the server must move to the corresponding point in the metric. The requests can be processed slightly out of order; in particular, the server has a buffer of capacity k which can store up to k requests as it reads in the sequence. The goal is to reorder the requests in such a manner that the buffer constraint is satisfied and the total travel cost of the server is minimized. The RBP arises in many applications that require scheduling with a limited buffer ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5823","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":"1204.5823","created_at":"2026-05-18T03:56:59.410023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5823v1","created_at":"2026-05-18T03:56:59.410023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5823","created_at":"2026-05-18T03:56:59.410023+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAGCLL3WMGJR","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAGCLL3WMGJR3M72","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAGCLL3W","created_at":"2026-05-18T12:27:04.183437+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/EAGCLL3WMGJR3M72EJ3HGK66AD","json":"https://pith.science/pith/EAGCLL3WMGJR3M72EJ3HGK66AD.json","graph_json":"https://pith.science/api/pith-number/EAGCLL3WMGJR3M72EJ3HGK66AD/graph.json","events_json":"https://pith.science/api/pith-number/EAGCLL3WMGJR3M72EJ3HGK66AD/events.json","paper":"https://pith.science/paper/EAGCLL3W"},"agent_actions":{"view_html":"https://pith.science/pith/EAGCLL3WMGJR3M72EJ3HGK66AD","download_json":"https://pith.science/pith/EAGCLL3WMGJR3M72EJ3HGK66AD.json","view_paper":"https://pith.science/paper/EAGCLL3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5823&json=true","fetch_graph":"https://pith.science/api/pith-number/EAGCLL3WMGJR3M72EJ3HGK66AD/graph.json","fetch_events":"https://pith.science/api/pith-number/EAGCLL3WMGJR3M72EJ3HGK66AD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAGCLL3WMGJR3M72EJ3HGK66AD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAGCLL3WMGJR3M72EJ3HGK66AD/action/storage_attestation","attest_author":"https://pith.science/pith/EAGCLL3WMGJR3M72EJ3HGK66AD/action/author_attestation","sign_citation":"https://pith.science/pith/EAGCLL3WMGJR3M72EJ3HGK66AD/action/citation_signature","submit_replication":"https://pith.science/pith/EAGCLL3WMGJR3M72EJ3HGK66AD/action/replication_record"}},"created_at":"2026-05-18T03:56:59.410023+00:00","updated_at":"2026-05-18T03:56:59.410023+00:00"}