{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6IYG663HRBBFT5EMX6U4DO4G3I","short_pith_number":"pith:6IYG663H","schema_version":"1.0","canonical_sha256":"f2306f7b67884259f48cbfa9c1bb86da11d4d48d5fcc3ec92ca51e61c82f27d0","source":{"kind":"arxiv","id":"1302.4248","version":3},"attestation_state":"computed","paper":{"title":"Looking at Mean-Payoff and Total-Payoff through Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Jean-Fran\\c{c}ois Raskin, Krishnendu Chatterjee, Laurent Doyen, Mickael Randour","submitted_at":"2013-02-18T12:43:08Z","abstract_excerpt":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show "},"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":"1302.4248","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-02-18T12:43:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"23acd6f1c6f05273e6fcb4f16dfcd4ead4ef62e96842dca2aa4d8f1847878f28","abstract_canon_sha256":"ebdbd3ca2ed8ebc9349cec961886c552af7e3f780b2d7dfc41ae57d418da297a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:46.335167Z","signature_b64":"t36qjhxvsbkmer+jkun3lk9MgiQ14bgPbOSMrD9FUu5bmYOpV6ZVWtSsLb0ubyXN6bereUjh9wbphtBXrYL9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2306f7b67884259f48cbfa9c1bb86da11d4d48d5fcc3ec92ca51e61c82f27d0","last_reissued_at":"2026-05-18T02:38:46.334647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:46.334647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Looking at Mean-Payoff and Total-Payoff through Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Jean-Fran\\c{c}ois Raskin, Krishnendu Chatterjee, Laurent Doyen, Mickael Randour","submitted_at":"2013-02-18T12:43:08Z","abstract_excerpt":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4248","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":"1302.4248","created_at":"2026-05-18T02:38:46.334728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4248v3","created_at":"2026-05-18T02:38:46.334728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4248","created_at":"2026-05-18T02:38:46.334728+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IYG663HRBBF","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IYG663HRBBFT5EM","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IYG663H","created_at":"2026-05-18T12:27:36.564083+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/6IYG663HRBBFT5EMX6U4DO4G3I","json":"https://pith.science/pith/6IYG663HRBBFT5EMX6U4DO4G3I.json","graph_json":"https://pith.science/api/pith-number/6IYG663HRBBFT5EMX6U4DO4G3I/graph.json","events_json":"https://pith.science/api/pith-number/6IYG663HRBBFT5EMX6U4DO4G3I/events.json","paper":"https://pith.science/paper/6IYG663H"},"agent_actions":{"view_html":"https://pith.science/pith/6IYG663HRBBFT5EMX6U4DO4G3I","download_json":"https://pith.science/pith/6IYG663HRBBFT5EMX6U4DO4G3I.json","view_paper":"https://pith.science/paper/6IYG663H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4248&json=true","fetch_graph":"https://pith.science/api/pith-number/6IYG663HRBBFT5EMX6U4DO4G3I/graph.json","fetch_events":"https://pith.science/api/pith-number/6IYG663HRBBFT5EMX6U4DO4G3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IYG663HRBBFT5EMX6U4DO4G3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IYG663HRBBFT5EMX6U4DO4G3I/action/storage_attestation","attest_author":"https://pith.science/pith/6IYG663HRBBFT5EMX6U4DO4G3I/action/author_attestation","sign_citation":"https://pith.science/pith/6IYG663HRBBFT5EMX6U4DO4G3I/action/citation_signature","submit_replication":"https://pith.science/pith/6IYG663HRBBFT5EMX6U4DO4G3I/action/replication_record"}},"created_at":"2026-05-18T02:38:46.334728+00:00","updated_at":"2026-05-18T02:38:46.334728+00:00"}