{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VV6TUSRGE2ADS2EISRT2SKGEWJ","short_pith_number":"pith:VV6TUSRG","schema_version":"1.0","canonical_sha256":"ad7d3a4a2626803968889467a928c4b24e686dacba46525794a42f5a2ae87666","source":{"kind":"arxiv","id":"1604.08234","version":2},"attestation_state":"computed","paper":{"title":"Polynomial-Time Algorithms for Energy Games with Special Weight Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger","submitted_at":"2016-04-27T20:36:13Z","abstract_excerpt":"Energy games belong to a class of turn-based two-player infinite-duration games}played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in ${\\sf NP} \\cap {\\sf co\\mbox{-}NP}$, but are not known to be in ${\\sf P}$. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time.\n  In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and "},"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":"1604.08234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-27T20:36:13Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"15d4757102aa3c746893a2fee1df521326a3d7f53684037b4201b9f52eb3351e","abstract_canon_sha256":"057e11a3895478a3ae6391a39892e6865a4af84c4d4167c7a548b98e3591bac6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.473430Z","signature_b64":"sV7Yn9wzS2v00ioeA59Ozf4NmEzkDhJScFjSHmJL4tnQ1JJXgVaOvQCPIei2CzFl1k+Sm5QtdaRTx4MM3zISDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad7d3a4a2626803968889467a928c4b24e686dacba46525794a42f5a2ae87666","last_reissued_at":"2026-05-18T00:22:16.472798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.472798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-Time Algorithms for Energy Games with Special Weight Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger","submitted_at":"2016-04-27T20:36:13Z","abstract_excerpt":"Energy games belong to a class of turn-based two-player infinite-duration games}played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in ${\\sf NP} \\cap {\\sf co\\mbox{-}NP}$, but are not known to be in ${\\sf P}$. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time.\n  In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08234","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.08234","created_at":"2026-05-18T00:22:16.472887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08234v2","created_at":"2026-05-18T00:22:16.472887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08234","created_at":"2026-05-18T00:22:16.472887+00:00"},{"alias_kind":"pith_short_12","alias_value":"VV6TUSRGE2AD","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VV6TUSRGE2ADS2EI","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VV6TUSRG","created_at":"2026-05-18T12:30:48.956258+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/VV6TUSRGE2ADS2EISRT2SKGEWJ","json":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ.json","graph_json":"https://pith.science/api/pith-number/VV6TUSRGE2ADS2EISRT2SKGEWJ/graph.json","events_json":"https://pith.science/api/pith-number/VV6TUSRGE2ADS2EISRT2SKGEWJ/events.json","paper":"https://pith.science/paper/VV6TUSRG"},"agent_actions":{"view_html":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ","download_json":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ.json","view_paper":"https://pith.science/paper/VV6TUSRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08234&json=true","fetch_graph":"https://pith.science/api/pith-number/VV6TUSRGE2ADS2EISRT2SKGEWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VV6TUSRGE2ADS2EISRT2SKGEWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/action/storage_attestation","attest_author":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/action/author_attestation","sign_citation":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/action/citation_signature","submit_replication":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/action/replication_record"}},"created_at":"2026-05-18T00:22:16.472887+00:00","updated_at":"2026-05-18T00:22:16.472887+00:00"}