{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3BVS5NKWXVNE7S7O3WU3OTGUYK","short_pith_number":"pith:3BVS5NKW","schema_version":"1.0","canonical_sha256":"d86b2eb556bd5a4fcbeedda9b74cd4c2ae72d60b37cf3d30ff91335cb2ab1da6","source":{"kind":"arxiv","id":"2405.02479","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ali Asadi, Jakub Svoboda, Krishnendu Chatterjee, Raimundo Saona","submitted_at":"2024-05-03T20:40:38Z","abstract_excerpt":"Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided by a player that owns the current vertex. Each edge is assigned an integer weight and the payoff of a play is the discounted-sum of the weights of the play. The goal of player 1 is to maximize the discounted-sum payoff against the adversarial player 2. These games lie in NP and coNP and are among the rare combinatorial problems that belong to this complexity"},"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":"2405.02479","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-05-03T20:40:38Z","cross_cats_sorted":[],"title_canon_sha256":"51603e5f65968fe146b733665ce39d7cd501b87edac2e9ffe3605a0852579a37","abstract_canon_sha256":"6005c252aa1bacf46318922334033a8eaf4e339ccfaaac4ff459e2ec43dddc9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:54.420675Z","signature_b64":"O1vdx8uGqFRdiDRVgsLY4YXkvJ0JewWJWPbTL2MG0qhA2nZ2OB+mf4fAvV3oiBA8L11/3T58ZIjpl1EuKz+BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d86b2eb556bd5a4fcbeedda9b74cd4c2ae72d60b37cf3d30ff91335cb2ab1da6","last_reissued_at":"2026-07-05T08:20:54.420185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:54.420185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ali Asadi, Jakub Svoboda, Krishnendu Chatterjee, Raimundo Saona","submitted_at":"2024-05-03T20:40:38Z","abstract_excerpt":"Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided by a player that owns the current vertex. Each edge is assigned an integer weight and the payoff of a play is the discounted-sum of the weights of the play. The goal of player 1 is to maximize the discounted-sum payoff against the adversarial player 2. These games lie in NP and coNP and are among the rare combinatorial problems that belong to this complexity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.02479","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.02479/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.02479","created_at":"2026-07-05T08:20:54.420263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.02479v2","created_at":"2026-07-05T08:20:54.420263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.02479","created_at":"2026-07-05T08:20:54.420263+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BVS5NKWXVNE","created_at":"2026-07-05T08:20:54.420263+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BVS5NKWXVNE7S7O","created_at":"2026-07-05T08:20:54.420263+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BVS5NKW","created_at":"2026-07-05T08:20:54.420263+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/3BVS5NKWXVNE7S7O3WU3OTGUYK","json":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK.json","graph_json":"https://pith.science/api/pith-number/3BVS5NKWXVNE7S7O3WU3OTGUYK/graph.json","events_json":"https://pith.science/api/pith-number/3BVS5NKWXVNE7S7O3WU3OTGUYK/events.json","paper":"https://pith.science/paper/3BVS5NKW"},"agent_actions":{"view_html":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK","download_json":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK.json","view_paper":"https://pith.science/paper/3BVS5NKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.02479&json=true","fetch_graph":"https://pith.science/api/pith-number/3BVS5NKWXVNE7S7O3WU3OTGUYK/graph.json","fetch_events":"https://pith.science/api/pith-number/3BVS5NKWXVNE7S7O3WU3OTGUYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/action/storage_attestation","attest_author":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/action/author_attestation","sign_citation":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/action/citation_signature","submit_replication":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/action/replication_record"}},"created_at":"2026-07-05T08:20:54.420263+00:00","updated_at":"2026-07-05T08:20:54.420263+00:00"}