{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3BVS5NKWXVNE7S7O3WU3OTGUYK","short_pith_number":"pith:3BVS5NKW","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"},"canonical_sha256":"d86b2eb556bd5a4fcbeedda9b74cd4c2ae72d60b37cf3d30ff91335cb2ab1da6","source":{"kind":"arxiv","id":"2405.02479","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.02479","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"2405.02479v2","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.02479","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"3BVS5NKWXVNE","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"pith_short_16","alias_value":"3BVS5NKWXVNE7S7O","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"pith_short_8","alias_value":"3BVS5NKW","created_at":"2026-07-05T08:20:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3BVS5NKWXVNE7S7O3WU3OTGUYK","target":"record","payload":{"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"},"canonical_sha256":"d86b2eb556bd5a4fcbeedda9b74cd4c2ae72d60b37cf3d30ff91335cb2ab1da6","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"},"source_kind":"arxiv","source_id":"2405.02479","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-07-05T08:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98FbejUlSxmw+11lQYmbjA65QYPxH3vfOXZKGxEuitl5boIm2SJ9u4KLuv2FfEUbBCtrt3UPJkRfWY2nPGqZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:36:15.977619Z"},"content_sha256":"21ed1f02ace4b558df0211d98978184301c6cd20235cae4b207fd93f353e6d7f","schema_version":"1.0","event_id":"sha256:21ed1f02ace4b558df0211d98978184301c6cd20235cae4b207fd93f353e6d7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3BVS5NKWXVNE7S7O3WU3OTGUYK","target":"graph","payload":{"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"},"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-07-05T08:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIZXaYTBXrcLs/XnPB37KB6KgpxzQ3DQNOTZUi1Y4h/umV9sXqOgxQcAgo6zUumAeCxjk+j8CEmeakx9w7vIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:36:15.978125Z"},"content_sha256":"f7c32a5ac1a02a7b8991c2197db6eec7cd9f9742d4e9b98817dbbf1cf5bef274","schema_version":"1.0","event_id":"sha256:f7c32a5ac1a02a7b8991c2197db6eec7cd9f9742d4e9b98817dbbf1cf5bef274"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/bundle.json","state_url":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/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-08-11T02:36:16Z","links":{"resolver":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK","bundle":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/bundle.json","state":"https://pith.science/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BVS5NKWXVNE7S7O3WU3OTGUYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3BVS5NKWXVNE7S7O3WU3OTGUYK","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":"6005c252aa1bacf46318922334033a8eaf4e339ccfaaac4ff459e2ec43dddc9f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-05-03T20:40:38Z","title_canon_sha256":"51603e5f65968fe146b733665ce39d7cd501b87edac2e9ffe3605a0852579a37"},"schema_version":"1.0","source":{"id":"2405.02479","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.02479","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"2405.02479v2","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.02479","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"3BVS5NKWXVNE","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"pith_short_16","alias_value":"3BVS5NKWXVNE7S7O","created_at":"2026-07-05T08:20:54Z"},{"alias_kind":"pith_short_8","alias_value":"3BVS5NKW","created_at":"2026-07-05T08:20:54Z"}],"graph_snapshots":[{"event_id":"sha256:f7c32a5ac1a02a7b8991c2197db6eec7cd9f9742d4e9b98817dbbf1cf5bef274","target":"graph","created_at":"2026-07-05T08:20:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.02479/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ali Asadi, Jakub Svoboda, Krishnendu Chatterjee, Raimundo Saona","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-05-03T20:40:38Z","title":"Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.02479","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:21ed1f02ace4b558df0211d98978184301c6cd20235cae4b207fd93f353e6d7f","target":"record","created_at":"2026-07-05T08:20:54Z","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":"6005c252aa1bacf46318922334033a8eaf4e339ccfaaac4ff459e2ec43dddc9f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-05-03T20:40:38Z","title_canon_sha256":"51603e5f65968fe146b733665ce39d7cd501b87edac2e9ffe3605a0852579a37"},"schema_version":"1.0","source":{"id":"2405.02479","kind":"arxiv","version":2}},"canonical_sha256":"d86b2eb556bd5a4fcbeedda9b74cd4c2ae72d60b37cf3d30ff91335cb2ab1da6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d86b2eb556bd5a4fcbeedda9b74cd4c2ae72d60b37cf3d30ff91335cb2ab1da6","first_computed_at":"2026-07-05T08:20:54.420185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:20:54.420185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O1vdx8uGqFRdiDRVgsLY4YXkvJ0JewWJWPbTL2MG0qhA2nZ2OB+mf4fAvV3oiBA8L11/3T58ZIjpl1EuKz+BBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:20:54.420675Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.02479","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21ed1f02ace4b558df0211d98978184301c6cd20235cae4b207fd93f353e6d7f","sha256:f7c32a5ac1a02a7b8991c2197db6eec7cd9f9742d4e9b98817dbbf1cf5bef274"],"state_sha256":"e3924c009d80441e7171161b23fbfe9b1fa091c1b7835b6bbfdb6cbfefa00ae7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eG1LIZddOTc8PC8dfIllA0YYsDgVuCQWgmmuSIorLtCg9AuC/DDSUijUnYr3iUTnxz35fY4/4oXJLJ4Mfu9zAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:36:16.010191Z","bundle_sha256":"309e729198575cb96a8f3daccf0e03653853dbbe4b03ad46701e10dd915cf82a"}}