{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XK7LJKDPQL6NQZRIXQVQUBTAXK","short_pith_number":"pith:XK7LJKDP","canonical_record":{"source":{"id":"1202.0796","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-03T18:51:15Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"df6b4e4a165cc802a5e7bd2383bb96c33fb5aa998f262137f2934bdbf26b968b","abstract_canon_sha256":"6cdc45f3a4b6d44fb19f059139ada7109b617080d1f5f6ef758cfa0d02b9c3f3"},"schema_version":"1.0"},"canonical_sha256":"babeb4a86f82fcd86628bc2b0a0660ba8357b7941b38acb857988ad75b2b0833","source":{"kind":"arxiv","id":"1202.0796","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0796","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0796v2","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0796","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"XK7LJKDPQL6N","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XK7LJKDPQL6NQZRI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XK7LJKDP","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XK7LJKDPQL6NQZRIXQVQUBTAXK","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0796","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-03T18:51:15Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"df6b4e4a165cc802a5e7bd2383bb96c33fb5aa998f262137f2934bdbf26b968b","abstract_canon_sha256":"6cdc45f3a4b6d44fb19f059139ada7109b617080d1f5f6ef758cfa0d02b9c3f3"},"schema_version":"1.0"},"canonical_sha256":"babeb4a86f82fcd86628bc2b0a0660ba8357b7941b38acb857988ad75b2b0833","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:37.262750Z","signature_b64":"8RzUO0MqYrMUkfOZ/r70O/XTjC1VcOEuMW7ni4a9oS50S1hdKXvLKG1N1wj57FKMelF0jDPV66OdcmjClCvZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"babeb4a86f82fcd86628bc2b0a0660ba8357b7941b38acb857988ad75b2b0833","last_reissued_at":"2026-05-18T03:54:37.262014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:37.262014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0796","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-18T03:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhpGCmAs2lJzkTiS6T3c05PeP9FWEo/zTODBMtYwJUtZoFvUuooS1M3OK9sI4RhEzLzmTRwz2DAvpjT8CGgVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:26:53.050763Z"},"content_sha256":"e33f3cc8519e2d98085704ce35d6eb209a8a2526ede98daef1ea63fec1ff5aba","schema_version":"1.0","event_id":"sha256:e33f3cc8519e2d98085704ce35d6eb209a8a2526ede98daef1ea63fec1ff5aba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XK7LJKDPQL6NQZRIXQVQUBTAXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Controller Synthesis for Consumption Games with Multiple Resource Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.GT","authors_text":"Anton\\'in Ku\\v{c}era, Krishnendu Chatterjee, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil","submitted_at":"2012-02-03T18:51:15Z","abstract_excerpt":"We introduce consumption games, a model for discrete interactive system with multiple resources that are consumed or reloaded independently. More precisely, a consumption game is a finite-state graph where each transition is labeled by a vector of resource updates, where every update is a non-positive number or omega. The omega updates model the reloading of a given resource. Each vertex belongs either to player \\Box or player \\Diamond, where the aim of player \\Box is to play so that the resources are never exhausted. We consider several natural algorithmic problems about consumption games, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0796","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-18T03:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNh3tML1iisQs3pOrGmMMuwRQDbFI/TMh00kSL/znYTyEiNxOREkkA5wycQ3Le7gorMds4rgJoQyQRvwT4rBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:26:53.051501Z"},"content_sha256":"3fe2edec53577e6ced6664540bbf93fecda9a3a0aff05e37c4720b0d63d4f579","schema_version":"1.0","event_id":"sha256:3fe2edec53577e6ced6664540bbf93fecda9a3a0aff05e37c4720b0d63d4f579"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XK7LJKDPQL6NQZRIXQVQUBTAXK/bundle.json","state_url":"https://pith.science/pith/XK7LJKDPQL6NQZRIXQVQUBTAXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XK7LJKDPQL6NQZRIXQVQUBTAXK/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-25T15:26:53Z","links":{"resolver":"https://pith.science/pith/XK7LJKDPQL6NQZRIXQVQUBTAXK","bundle":"https://pith.science/pith/XK7LJKDPQL6NQZRIXQVQUBTAXK/bundle.json","state":"https://pith.science/pith/XK7LJKDPQL6NQZRIXQVQUBTAXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XK7LJKDPQL6NQZRIXQVQUBTAXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XK7LJKDPQL6NQZRIXQVQUBTAXK","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":"6cdc45f3a4b6d44fb19f059139ada7109b617080d1f5f6ef758cfa0d02b9c3f3","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-03T18:51:15Z","title_canon_sha256":"df6b4e4a165cc802a5e7bd2383bb96c33fb5aa998f262137f2934bdbf26b968b"},"schema_version":"1.0","source":{"id":"1202.0796","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0796","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0796v2","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0796","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"XK7LJKDPQL6N","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XK7LJKDPQL6NQZRI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XK7LJKDP","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:3fe2edec53577e6ced6664540bbf93fecda9a3a0aff05e37c4720b0d63d4f579","target":"graph","created_at":"2026-05-18T03:54:37Z","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 introduce consumption games, a model for discrete interactive system with multiple resources that are consumed or reloaded independently. More precisely, a consumption game is a finite-state graph where each transition is labeled by a vector of resource updates, where every update is a non-positive number or omega. The omega updates model the reloading of a given resource. Each vertex belongs either to player \\Box or player \\Diamond, where the aim of player \\Box is to play so that the resources are never exhausted. We consider several natural algorithmic problems about consumption games, an","authors_text":"Anton\\'in Ku\\v{c}era, Krishnendu Chatterjee, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-03T18:51:15Z","title":"Efficient Controller Synthesis for Consumption Games with Multiple Resource Types"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0796","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:e33f3cc8519e2d98085704ce35d6eb209a8a2526ede98daef1ea63fec1ff5aba","target":"record","created_at":"2026-05-18T03:54:37Z","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":"6cdc45f3a4b6d44fb19f059139ada7109b617080d1f5f6ef758cfa0d02b9c3f3","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-03T18:51:15Z","title_canon_sha256":"df6b4e4a165cc802a5e7bd2383bb96c33fb5aa998f262137f2934bdbf26b968b"},"schema_version":"1.0","source":{"id":"1202.0796","kind":"arxiv","version":2}},"canonical_sha256":"babeb4a86f82fcd86628bc2b0a0660ba8357b7941b38acb857988ad75b2b0833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"babeb4a86f82fcd86628bc2b0a0660ba8357b7941b38acb857988ad75b2b0833","first_computed_at":"2026-05-18T03:54:37.262014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:37.262014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8RzUO0MqYrMUkfOZ/r70O/XTjC1VcOEuMW7ni4a9oS50S1hdKXvLKG1N1wj57FKMelF0jDPV66OdcmjClCvZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:37.262750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0796","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e33f3cc8519e2d98085704ce35d6eb209a8a2526ede98daef1ea63fec1ff5aba","sha256:3fe2edec53577e6ced6664540bbf93fecda9a3a0aff05e37c4720b0d63d4f579"],"state_sha256":"858ab9a15610154f6593c9aa827078ca8196a37bafc63fdeacc8f477b4fc5c47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/ngFbidlq25BX6JeH5Tvnspx7Ioz6aSTPhFx84qau4pa0FoD5v0kQKTMCOk7sm6hLjpLc89uNCiaMkpUHRlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:26:53.055423Z","bundle_sha256":"036242533ea8c49074047612ca35795fcd41cae313b9b640d93714d5ff120a6c"}}