{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HIT44DIX7BRFH6PXT3FD6RQWC5","short_pith_number":"pith:HIT44DIX","schema_version":"1.0","canonical_sha256":"3a27ce0d17f86253f9f79eca3f46161750103c5e22403579c1fb0d5283d47c6c","source":{"kind":"arxiv","id":"1610.07858","version":3},"attestation_state":"computed","paper":{"title":"Bounding Average-energy Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT"],"primary_cat":"cs.LO","authors_text":"Martin Zimmermann, Mickael Randour, Nicolas Markey, Patricia Bouyer, Piotr Hofman","submitted_at":"2016-10-25T13:22:10Z","abstract_excerpt":"We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound constraint on the energy level (but no upper bound) remained open; in particular, so far there was no known upper bound on the memory that is required for winning strategies.\n  By reducing average-energy games with lower-bounded energy to infinite-state mean-payoff games and analyzing the density of low-energy configurations, we show an almost tight doubly-exponen"},"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":"1610.07858","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-25T13:22:10Z","cross_cats_sorted":["cs.FL","cs.GT"],"title_canon_sha256":"6c60c24a6ccb95baa8b0745ede7f2db67fc4f9fc66d98ee35994ec30c936c47c","abstract_canon_sha256":"40b265b7aa657eb59ac5576a800ede94067e894f312c91ea3c5fcf04bec81736"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.050340Z","signature_b64":"F1Nwpko3CSE51wZGAgq5bmYuLYsr5dtgFZl+1g7ddphSwA6eR9nGP+c7nzt217KuiTokr9cXSlU9ADkE6xj+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a27ce0d17f86253f9f79eca3f46161750103c5e22403579c1fb0d5283d47c6c","last_reissued_at":"2026-05-18T00:52:55.049606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.049606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding Average-energy Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT"],"primary_cat":"cs.LO","authors_text":"Martin Zimmermann, Mickael Randour, Nicolas Markey, Patricia Bouyer, Piotr Hofman","submitted_at":"2016-10-25T13:22:10Z","abstract_excerpt":"We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound constraint on the energy level (but no upper bound) remained open; in particular, so far there was no known upper bound on the memory that is required for winning strategies.\n  By reducing average-energy games with lower-bounded energy to infinite-state mean-payoff games and analyzing the density of low-energy configurations, we show an almost tight doubly-exponen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07858","kind":"arxiv","version":3},"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":"1610.07858","created_at":"2026-05-18T00:52:55.049761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07858v3","created_at":"2026-05-18T00:52:55.049761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07858","created_at":"2026-05-18T00:52:55.049761+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIT44DIX7BRF","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIT44DIX7BRFH6PX","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIT44DIX","created_at":"2026-05-18T12:30:19.053100+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/HIT44DIX7BRFH6PXT3FD6RQWC5","json":"https://pith.science/pith/HIT44DIX7BRFH6PXT3FD6RQWC5.json","graph_json":"https://pith.science/api/pith-number/HIT44DIX7BRFH6PXT3FD6RQWC5/graph.json","events_json":"https://pith.science/api/pith-number/HIT44DIX7BRFH6PXT3FD6RQWC5/events.json","paper":"https://pith.science/paper/HIT44DIX"},"agent_actions":{"view_html":"https://pith.science/pith/HIT44DIX7BRFH6PXT3FD6RQWC5","download_json":"https://pith.science/pith/HIT44DIX7BRFH6PXT3FD6RQWC5.json","view_paper":"https://pith.science/paper/HIT44DIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07858&json=true","fetch_graph":"https://pith.science/api/pith-number/HIT44DIX7BRFH6PXT3FD6RQWC5/graph.json","fetch_events":"https://pith.science/api/pith-number/HIT44DIX7BRFH6PXT3FD6RQWC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIT44DIX7BRFH6PXT3FD6RQWC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIT44DIX7BRFH6PXT3FD6RQWC5/action/storage_attestation","attest_author":"https://pith.science/pith/HIT44DIX7BRFH6PXT3FD6RQWC5/action/author_attestation","sign_citation":"https://pith.science/pith/HIT44DIX7BRFH6PXT3FD6RQWC5/action/citation_signature","submit_replication":"https://pith.science/pith/HIT44DIX7BRFH6PXT3FD6RQWC5/action/replication_record"}},"created_at":"2026-05-18T00:52:55.049761+00:00","updated_at":"2026-05-18T00:52:55.049761+00:00"}