{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VV6TUSRGE2ADS2EISRT2SKGEWJ","short_pith_number":"pith:VV6TUSRG","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"},"canonical_sha256":"ad7d3a4a2626803968889467a928c4b24e686dacba46525794a42f5a2ae87666","source":{"kind":"arxiv","id":"1604.08234","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08234","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08234v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08234","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"VV6TUSRGE2AD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VV6TUSRGE2ADS2EI","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VV6TUSRG","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VV6TUSRGE2ADS2EISRT2SKGEWJ","target":"record","payload":{"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"},"canonical_sha256":"ad7d3a4a2626803968889467a928c4b24e686dacba46525794a42f5a2ae87666","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"},"source_kind":"arxiv","source_id":"1604.08234","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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+DRGPYRotdkdtNEdndZ4pDAMbq7GtjcYyyZYU6RJZ/oJXGSginIuMVaN4Qx9mZfqSeXt6b8ar27OTwTFFoZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:42:40.030547Z"},"content_sha256":"ef40b00b6a0f7975dc4aa44a6114f74cceedc0b87c7cc3e9ece36b666369f702","schema_version":"1.0","event_id":"sha256:ef40b00b6a0f7975dc4aa44a6114f74cceedc0b87c7cc3e9ece36b666369f702"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VV6TUSRGE2ADS2EISRT2SKGEWJ","target":"graph","payload":{"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"},"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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5MgI0NIhlgs4hpSnv4uCrFjjKA8LTXzR2zQfL023zkwCtYl6fkx/Nng6qLTfkDO8KFba4cS5fzldDhbSA2xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:42:40.031214Z"},"content_sha256":"a970c3466c69e2ef9d24f063259eb29acb8c8d8d5750aea835a4a5d0a44bc9f6","schema_version":"1.0","event_id":"sha256:a970c3466c69e2ef9d24f063259eb29acb8c8d8d5750aea835a4a5d0a44bc9f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/bundle.json","state_url":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/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-25T17:42:40Z","links":{"resolver":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ","bundle":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/bundle.json","state":"https://pith.science/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VV6TUSRGE2ADS2EISRT2SKGEWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VV6TUSRGE2ADS2EISRT2SKGEWJ","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":"057e11a3895478a3ae6391a39892e6865a4af84c4d4167c7a548b98e3591bac6","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-27T20:36:13Z","title_canon_sha256":"15d4757102aa3c746893a2fee1df521326a3d7f53684037b4201b9f52eb3351e"},"schema_version":"1.0","source":{"id":"1604.08234","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08234","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08234v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08234","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"VV6TUSRGE2AD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VV6TUSRGE2ADS2EI","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VV6TUSRG","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:a970c3466c69e2ef9d24f063259eb29acb8c8d8d5750aea835a4a5d0a44bc9f6","target":"graph","created_at":"2026-05-18T00:22:16Z","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":"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 ","authors_text":"Danupon Nanongkai, Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-27T20:36:13Z","title":"Polynomial-Time Algorithms for Energy Games with Special Weight Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08234","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:ef40b00b6a0f7975dc4aa44a6114f74cceedc0b87c7cc3e9ece36b666369f702","target":"record","created_at":"2026-05-18T00:22:16Z","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":"057e11a3895478a3ae6391a39892e6865a4af84c4d4167c7a548b98e3591bac6","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-27T20:36:13Z","title_canon_sha256":"15d4757102aa3c746893a2fee1df521326a3d7f53684037b4201b9f52eb3351e"},"schema_version":"1.0","source":{"id":"1604.08234","kind":"arxiv","version":2}},"canonical_sha256":"ad7d3a4a2626803968889467a928c4b24e686dacba46525794a42f5a2ae87666","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad7d3a4a2626803968889467a928c4b24e686dacba46525794a42f5a2ae87666","first_computed_at":"2026-05-18T00:22:16.472798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.472798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sV7Yn9wzS2v00ioeA59Ozf4NmEzkDhJScFjSHmJL4tnQ1JJXgVaOvQCPIei2CzFl1k+Sm5QtdaRTx4MM3zISDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.473430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08234","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef40b00b6a0f7975dc4aa44a6114f74cceedc0b87c7cc3e9ece36b666369f702","sha256:a970c3466c69e2ef9d24f063259eb29acb8c8d8d5750aea835a4a5d0a44bc9f6"],"state_sha256":"ecc369cf64077517b1e7b1a23478c391561a3c0b6c5b68837ffc6f6d4251df13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ECsz4fSDXvnueQehkXtxteprr7P01KZUjXDZulixK3e1u4VLqw9eDWxz00W4AdtkJiXNoV/L1reHtcpU7LW+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:42:40.035012Z","bundle_sha256":"acbe90bbbfb0bb4947b2f8b00d789a6796b5d0454eaa2b6a45b16e3ec811e50e"}}