{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BLZNNSWU7KW6VGBOQPG7SSZTYT","short_pith_number":"pith:BLZNNSWU","schema_version":"1.0","canonical_sha256":"0af2d6cad4faadea982e83cdf94b33c4cd840766ca44f00e7dffec5fbeb3a437","source":{"kind":"arxiv","id":"1904.02861","version":1},"attestation_state":"computed","paper":{"title":"Achieving Optimal Backlog in Multi-Processor Cup Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Farach-Colton, Michael A. Bender, William Kuszmaul","submitted_at":"2019-04-05T03:40:58Z","abstract_excerpt":"The single- and multi- processor cup games can be used to model natural problems in areas such as processor scheduling, deamortization, and buffer management. At the beginning of the single-processor cup game, $n$ cups are initially empty. In each step of the game, a filler distributes $1$ unit of water among the cups, and then an emptier selects a cup and removes $1 + \\epsilon$ units from that cup. The goal of the emptier is to minimize the amount of water in the fullest cup, also known as the backlog. It is known that the greedy algorithm (i.e., empty the fullest cup) achieves backlog $O(\\lo"},"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":"1904.02861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T03:40:58Z","cross_cats_sorted":[],"title_canon_sha256":"333524a3532bdf4b924914c2df3f9e5a1980268c3846d556a9809f1b9f13b30f","abstract_canon_sha256":"9b2df2ec582003be5b427c54bea3a06dfd94254f50e51f843bde009d2a817772"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:19.404113Z","signature_b64":"D5/1qQVxBFoP9Js5QktOlbit05g10G5G88ABXGL20oAeydYW26rmlT1CtNd9kO6p4vd26HbIxnw0WWC7Cc7VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0af2d6cad4faadea982e83cdf94b33c4cd840766ca44f00e7dffec5fbeb3a437","last_reissued_at":"2026-05-17T23:49:19.403487Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:19.403487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Optimal Backlog in Multi-Processor Cup Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Farach-Colton, Michael A. Bender, William Kuszmaul","submitted_at":"2019-04-05T03:40:58Z","abstract_excerpt":"The single- and multi- processor cup games can be used to model natural problems in areas such as processor scheduling, deamortization, and buffer management. At the beginning of the single-processor cup game, $n$ cups are initially empty. In each step of the game, a filler distributes $1$ unit of water among the cups, and then an emptier selects a cup and removes $1 + \\epsilon$ units from that cup. The goal of the emptier is to minimize the amount of water in the fullest cup, also known as the backlog. It is known that the greedy algorithm (i.e., empty the fullest cup) achieves backlog $O(\\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02861","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":"1904.02861","created_at":"2026-05-17T23:49:19.403580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02861v1","created_at":"2026-05-17T23:49:19.403580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02861","created_at":"2026-05-17T23:49:19.403580+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLZNNSWU7KW6","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLZNNSWU7KW6VGBO","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLZNNSWU","created_at":"2026-05-18T12:33:12.712433+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/BLZNNSWU7KW6VGBOQPG7SSZTYT","json":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT.json","graph_json":"https://pith.science/api/pith-number/BLZNNSWU7KW6VGBOQPG7SSZTYT/graph.json","events_json":"https://pith.science/api/pith-number/BLZNNSWU7KW6VGBOQPG7SSZTYT/events.json","paper":"https://pith.science/paper/BLZNNSWU"},"agent_actions":{"view_html":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT","download_json":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT.json","view_paper":"https://pith.science/paper/BLZNNSWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02861&json=true","fetch_graph":"https://pith.science/api/pith-number/BLZNNSWU7KW6VGBOQPG7SSZTYT/graph.json","fetch_events":"https://pith.science/api/pith-number/BLZNNSWU7KW6VGBOQPG7SSZTYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/action/storage_attestation","attest_author":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/action/author_attestation","sign_citation":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/action/citation_signature","submit_replication":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/action/replication_record"}},"created_at":"2026-05-17T23:49:19.403580+00:00","updated_at":"2026-05-17T23:49:19.403580+00:00"}