{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:LVMEAAPIW33JNCDBIL7A3OM2JD","short_pith_number":"pith:LVMEAAPI","canonical_record":{"source":{"id":"0804.4819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-04-30T13:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"56d1df16d04fb5f03647ec9f019506cda6765860044200f9672820a1f2e93552","abstract_canon_sha256":"991d94f18b046d270eab90cfece331c92b5c2d1cf6a85c22fd289dafa318c6a6"},"schema_version":"1.0"},"canonical_sha256":"5d584001e8b6f696886142fe0db99a48d071939e22391657f19b77e6276adc7e","source":{"kind":"arxiv","id":"0804.4819","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.4819","created_at":"2026-05-18T01:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"0804.4819v2","created_at":"2026-05-18T01:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4819","created_at":"2026-05-18T01:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"LVMEAAPIW33J","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LVMEAAPIW33JNCDB","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LVMEAAPI","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:LVMEAAPIW33JNCDBIL7A3OM2JD","target":"record","payload":{"canonical_record":{"source":{"id":"0804.4819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-04-30T13:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"56d1df16d04fb5f03647ec9f019506cda6765860044200f9672820a1f2e93552","abstract_canon_sha256":"991d94f18b046d270eab90cfece331c92b5c2d1cf6a85c22fd289dafa318c6a6"},"schema_version":"1.0"},"canonical_sha256":"5d584001e8b6f696886142fe0db99a48d071939e22391657f19b77e6276adc7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:28.531791Z","signature_b64":"a6kCNCpejzn0yt5+UrLLxL0YuTtUs8TF/PTiKCPNT5XtUkO/y5STbATRUz7CJXLEnRgdeLCNrM8XLStCDVLjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d584001e8b6f696886142fe0db99a48d071939e22391657f19b77e6276adc7e","last_reissued_at":"2026-05-18T01:18:28.531299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:28.531299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0804.4819","source_version":2,"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-18T01:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xAt3gGitlII22irfjDnNnPKQIkZhUMQs/1MYgRv5Z5SphakkCroXfFhLl5clh6DUWUbeNaw2qYN4fMj4fEjGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:47:37.465100Z"},"content_sha256":"c04b65ec50d67508bda8e9c63884bd72030d884a10abced603246ef580212f02","schema_version":"1.0","event_id":"sha256:c04b65ec50d67508bda8e9c63884bd72030d884a10abced603246ef580212f02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:LVMEAAPIW33JNCDBIL7A3OM2JD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minimum Backlog Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Kr\\\"oller, Joseph S. B. Mitchell, Jukka Suomela, Michael A. Bender, S\\'andor P. Fekete, Valentin Polishchuk, Vincenzo Liberatore","submitted_at":"2008-04-30T13:13:12Z","abstract_excerpt":"We study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP.\n  The discrete MBP is a 2-person game played on a graph $G=(V,E)$. The player is initially located at a vertex of the graph. In each time step, the adversary pours a total of one unit of water into cups that are located on the vertices of the graph, arbitrarily distributing the water among the cups. The player then moves from her current vertex to an adjacent vertex and empties the cup at that vertex. The player's objective is to minimize the ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4819","kind":"arxiv","version":2},"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-18T01:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2AmVtca86l/LT3EEC2CuBvrkO9z6wrz2EvPnkQCNrUL7QG8UaylfieTsiRl9qrDUOT/zSJlgcxMxF/kTB7qVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:47:37.465723Z"},"content_sha256":"9167eb36761657c9834489f92a2ba7a0c82130c5a49b59a68ad25f70a9c9dd5f","schema_version":"1.0","event_id":"sha256:9167eb36761657c9834489f92a2ba7a0c82130c5a49b59a68ad25f70a9c9dd5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVMEAAPIW33JNCDBIL7A3OM2JD/bundle.json","state_url":"https://pith.science/pith/LVMEAAPIW33JNCDBIL7A3OM2JD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVMEAAPIW33JNCDBIL7A3OM2JD/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-28T19:47:37Z","links":{"resolver":"https://pith.science/pith/LVMEAAPIW33JNCDBIL7A3OM2JD","bundle":"https://pith.science/pith/LVMEAAPIW33JNCDBIL7A3OM2JD/bundle.json","state":"https://pith.science/pith/LVMEAAPIW33JNCDBIL7A3OM2JD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVMEAAPIW33JNCDBIL7A3OM2JD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:LVMEAAPIW33JNCDBIL7A3OM2JD","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":"991d94f18b046d270eab90cfece331c92b5c2d1cf6a85c22fd289dafa318c6a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-04-30T13:13:12Z","title_canon_sha256":"56d1df16d04fb5f03647ec9f019506cda6765860044200f9672820a1f2e93552"},"schema_version":"1.0","source":{"id":"0804.4819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.4819","created_at":"2026-05-18T01:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"0804.4819v2","created_at":"2026-05-18T01:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4819","created_at":"2026-05-18T01:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"LVMEAAPIW33J","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LVMEAAPIW33JNCDB","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LVMEAAPI","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:9167eb36761657c9834489f92a2ba7a0c82130c5a49b59a68ad25f70a9c9dd5f","target":"graph","created_at":"2026-05-18T01:18:28Z","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 study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP.\n  The discrete MBP is a 2-person game played on a graph $G=(V,E)$. The player is initially located at a vertex of the graph. In each time step, the adversary pours a total of one unit of water into cups that are located on the vertices of the graph, arbitrarily distributing the water among the cups. The player then moves from her current vertex to an adjacent vertex and empties the cup at that vertex. The player's objective is to minimize the ba","authors_text":"Alexander Kr\\\"oller, Joseph S. B. Mitchell, Jukka Suomela, Michael A. Bender, S\\'andor P. Fekete, Valentin Polishchuk, Vincenzo Liberatore","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-04-30T13:13:12Z","title":"The Minimum Backlog Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4819","kind":"arxiv","version":2},"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:c04b65ec50d67508bda8e9c63884bd72030d884a10abced603246ef580212f02","target":"record","created_at":"2026-05-18T01:18:28Z","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":"991d94f18b046d270eab90cfece331c92b5c2d1cf6a85c22fd289dafa318c6a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-04-30T13:13:12Z","title_canon_sha256":"56d1df16d04fb5f03647ec9f019506cda6765860044200f9672820a1f2e93552"},"schema_version":"1.0","source":{"id":"0804.4819","kind":"arxiv","version":2}},"canonical_sha256":"5d584001e8b6f696886142fe0db99a48d071939e22391657f19b77e6276adc7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d584001e8b6f696886142fe0db99a48d071939e22391657f19b77e6276adc7e","first_computed_at":"2026-05-18T01:18:28.531299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:28.531299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a6kCNCpejzn0yt5+UrLLxL0YuTtUs8TF/PTiKCPNT5XtUkO/y5STbATRUz7CJXLEnRgdeLCNrM8XLStCDVLjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:28.531791Z","signed_message":"canonical_sha256_bytes"},"source_id":"0804.4819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c04b65ec50d67508bda8e9c63884bd72030d884a10abced603246ef580212f02","sha256:9167eb36761657c9834489f92a2ba7a0c82130c5a49b59a68ad25f70a9c9dd5f"],"state_sha256":"46cbe0ddcf1ea70b52d57a58cc978890be15591b774d58e5485e497193c2ba4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XA7M3wCaxQp00cYFBVRpZCJZh4ECS2qWVGkIjUKe2+hlNvOsW/86BJ1whAztoX+MCv3lo1WeyR03yZAlDgQ2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:47:37.468909Z","bundle_sha256":"6f1bbba30ad091e2604da9613b6c312b37c29df81719e9cc48a874113b3151a1"}}