{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BLZNNSWU7KW6VGBOQPG7SSZTYT","short_pith_number":"pith:BLZNNSWU","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"},"canonical_sha256":"0af2d6cad4faadea982e83cdf94b33c4cd840766ca44f00e7dffec5fbeb3a437","source":{"kind":"arxiv","id":"1904.02861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02861","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02861v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02861","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"BLZNNSWU7KW6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BLZNNSWU7KW6VGBO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BLZNNSWU","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BLZNNSWU7KW6VGBOQPG7SSZTYT","target":"record","payload":{"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"},"canonical_sha256":"0af2d6cad4faadea982e83cdf94b33c4cd840766ca44f00e7dffec5fbeb3a437","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"},"source_kind":"arxiv","source_id":"1904.02861","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33DaK3sFtdRqVueA6J4jS7nQiXzmWCoP6aFuhxxI9/u46lR4V9xvWGVWQffOzy1PFQ2/PBvPa727l/6bOVl8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:57:17.662055Z"},"content_sha256":"78c17a9a64ccc46e68d04726a5bddadeb4b065c22481ac8f82fc93b125f380bf","schema_version":"1.0","event_id":"sha256:78c17a9a64ccc46e68d04726a5bddadeb4b065c22481ac8f82fc93b125f380bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BLZNNSWU7KW6VGBOQPG7SSZTYT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKsQfHsxrNQuhAs+s1IUi+orOED0/0oxHx5jLwE9g9XGe7RHw/836t8EIZTmJbFw5oQvNG90SES0VYYDseVlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:57:17.662468Z"},"content_sha256":"9ed57efc86272a929fb9f6c20d13a71dea27209c73cfe1c6b30391199531ba1b","schema_version":"1.0","event_id":"sha256:9ed57efc86272a929fb9f6c20d13a71dea27209c73cfe1c6b30391199531ba1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/bundle.json","state_url":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T10:57:17Z","links":{"resolver":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT","bundle":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/bundle.json","state":"https://pith.science/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLZNNSWU7KW6VGBOQPG7SSZTYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BLZNNSWU7KW6VGBOQPG7SSZTYT","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":"9b2df2ec582003be5b427c54bea3a06dfd94254f50e51f843bde009d2a817772","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T03:40:58Z","title_canon_sha256":"333524a3532bdf4b924914c2df3f9e5a1980268c3846d556a9809f1b9f13b30f"},"schema_version":"1.0","source":{"id":"1904.02861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02861","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02861v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02861","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"BLZNNSWU7KW6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BLZNNSWU7KW6VGBO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BLZNNSWU","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:9ed57efc86272a929fb9f6c20d13a71dea27209c73cfe1c6b30391199531ba1b","target":"graph","created_at":"2026-05-17T23:49:19Z","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":"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","authors_text":"Martin Farach-Colton, Michael A. Bender, William Kuszmaul","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T03:40:58Z","title":"Achieving Optimal Backlog in Multi-Processor Cup Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02861","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:78c17a9a64ccc46e68d04726a5bddadeb4b065c22481ac8f82fc93b125f380bf","target":"record","created_at":"2026-05-17T23:49:19Z","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":"9b2df2ec582003be5b427c54bea3a06dfd94254f50e51f843bde009d2a817772","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T03:40:58Z","title_canon_sha256":"333524a3532bdf4b924914c2df3f9e5a1980268c3846d556a9809f1b9f13b30f"},"schema_version":"1.0","source":{"id":"1904.02861","kind":"arxiv","version":1}},"canonical_sha256":"0af2d6cad4faadea982e83cdf94b33c4cd840766ca44f00e7dffec5fbeb3a437","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0af2d6cad4faadea982e83cdf94b33c4cd840766ca44f00e7dffec5fbeb3a437","first_computed_at":"2026-05-17T23:49:19.403487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:19.403487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D5/1qQVxBFoP9Js5QktOlbit05g10G5G88ABXGL20oAeydYW26rmlT1CtNd9kO6p4vd26HbIxnw0WWC7Cc7VBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:19.404113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78c17a9a64ccc46e68d04726a5bddadeb4b065c22481ac8f82fc93b125f380bf","sha256:9ed57efc86272a929fb9f6c20d13a71dea27209c73cfe1c6b30391199531ba1b"],"state_sha256":"29acd9e12aa3a36f451301d7d06b36c98db542e0729ee0ded73ab2febcaf5f0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybM1K/El0zQB6mqkwBSEedVjfSqDJS8o7t3/LkUSl6iTFIqhZLVnvLJ2rJEkpsV7lQhEpxpKte2qt25H7IiFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:57:17.665498Z","bundle_sha256":"455656caa50f34b9a7092a3da39eee58a71df0e125abf3d9ec5a26fdd02f847b"}}