{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GJDR5SD6BU5ORVOCB27UFEMDXD","short_pith_number":"pith:GJDR5SD6","canonical_record":{"source":{"id":"1104.3211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-16T08:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"a001def3082e73b742b69e07bd1a58356e343cd042f8372a928af39ff10e07e4","abstract_canon_sha256":"6e36a08e9686cbf57698f116cc685f4a5a60511b08c7c6e9836c38ea15aa41cf"},"schema_version":"1.0"},"canonical_sha256":"32471ec87e0d3ae8d5c20ebf429183b8e973af7d3f99612e7b5fd009ff748788","source":{"kind":"arxiv","id":"1104.3211","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3211","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3211v1","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3211","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"GJDR5SD6BU5O","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GJDR5SD6BU5ORVOC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GJDR5SD6","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GJDR5SD6BU5ORVOCB27UFEMDXD","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-16T08:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"a001def3082e73b742b69e07bd1a58356e343cd042f8372a928af39ff10e07e4","abstract_canon_sha256":"6e36a08e9686cbf57698f116cc685f4a5a60511b08c7c6e9836c38ea15aa41cf"},"schema_version":"1.0"},"canonical_sha256":"32471ec87e0d3ae8d5c20ebf429183b8e973af7d3f99612e7b5fd009ff748788","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.580794Z","signature_b64":"+WFjitsweHsZZEmtNISNmUz3RuKuViAcZ+0nAjnS/H2qq7zSrVxN6oyjGacr96ItvYbYKe8215jRxXwLr19LCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32471ec87e0d3ae8d5c20ebf429183b8e973af7d3f99612e7b5fd009ff748788","last_reissued_at":"2026-05-18T04:24:05.580141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.580141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3211","source_version":1,"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-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lFaqD8TpFrqFB2j42yjyr/mg7Jm0N21RK0QvsX1cVdSxSUCnuJf5M92T+YECN01/qHtkNbY34YGnsFkP4p+WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:10:41.060280Z"},"content_sha256":"fcd90823c0dd119a815302960d795af222dd90d12f73bae950a47139a4e5013e","schema_version":"1.0","event_id":"sha256:fcd90823c0dd119a815302960d795af222dd90d12f73bae950a47139a4e5013e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GJDR5SD6BU5ORVOCB27UFEMDXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Memoryless Quantitative Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee, Laurent Doyen, Rohit Singh","submitted_at":"2011-04-16T08:41:36Z","abstract_excerpt":"In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Beside their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist.\n  In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3211","kind":"arxiv","version":1},"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-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwPO1uu/709sZQZKJI6BOQWII9wub3I2asW+MGiK+xnmkURWXbPqvk/ZVmy5XZVeuBJofpFgC28bO0UEhmcKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:10:41.060953Z"},"content_sha256":"a9c4b4f073b40b920d81e78c0a59cf907f9f04989cc0f8644f8599bb73d5ff30","schema_version":"1.0","event_id":"sha256:a9c4b4f073b40b920d81e78c0a59cf907f9f04989cc0f8644f8599bb73d5ff30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJDR5SD6BU5ORVOCB27UFEMDXD/bundle.json","state_url":"https://pith.science/pith/GJDR5SD6BU5ORVOCB27UFEMDXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJDR5SD6BU5ORVOCB27UFEMDXD/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-25T16:10:41Z","links":{"resolver":"https://pith.science/pith/GJDR5SD6BU5ORVOCB27UFEMDXD","bundle":"https://pith.science/pith/GJDR5SD6BU5ORVOCB27UFEMDXD/bundle.json","state":"https://pith.science/pith/GJDR5SD6BU5ORVOCB27UFEMDXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJDR5SD6BU5ORVOCB27UFEMDXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GJDR5SD6BU5ORVOCB27UFEMDXD","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":"6e36a08e9686cbf57698f116cc685f4a5a60511b08c7c6e9836c38ea15aa41cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-16T08:41:36Z","title_canon_sha256":"a001def3082e73b742b69e07bd1a58356e343cd042f8372a928af39ff10e07e4"},"schema_version":"1.0","source":{"id":"1104.3211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3211","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3211v1","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3211","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"GJDR5SD6BU5O","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GJDR5SD6BU5ORVOC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GJDR5SD6","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:a9c4b4f073b40b920d81e78c0a59cf907f9f04989cc0f8644f8599bb73d5ff30","target":"graph","created_at":"2026-05-18T04:24:05Z","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":"In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Beside their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist.\n  In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This ne","authors_text":"Krishnendu Chatterjee, Laurent Doyen, Rohit Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-16T08:41:36Z","title":"On Memoryless Quantitative Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3211","kind":"arxiv","version":1},"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:fcd90823c0dd119a815302960d795af222dd90d12f73bae950a47139a4e5013e","target":"record","created_at":"2026-05-18T04:24:05Z","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":"6e36a08e9686cbf57698f116cc685f4a5a60511b08c7c6e9836c38ea15aa41cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-16T08:41:36Z","title_canon_sha256":"a001def3082e73b742b69e07bd1a58356e343cd042f8372a928af39ff10e07e4"},"schema_version":"1.0","source":{"id":"1104.3211","kind":"arxiv","version":1}},"canonical_sha256":"32471ec87e0d3ae8d5c20ebf429183b8e973af7d3f99612e7b5fd009ff748788","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32471ec87e0d3ae8d5c20ebf429183b8e973af7d3f99612e7b5fd009ff748788","first_computed_at":"2026-05-18T04:24:05.580141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:05.580141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+WFjitsweHsZZEmtNISNmUz3RuKuViAcZ+0nAjnS/H2qq7zSrVxN6oyjGacr96ItvYbYKe8215jRxXwLr19LCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:05.580794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcd90823c0dd119a815302960d795af222dd90d12f73bae950a47139a4e5013e","sha256:a9c4b4f073b40b920d81e78c0a59cf907f9f04989cc0f8644f8599bb73d5ff30"],"state_sha256":"a686b5f06ec1971f236adab2c96ab6e6d8c5eacdcc43e8cb810e6ad9c750640f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p29SXJGznnds/5Fp+clh5ylFJ5z8d34ntyq9yLZKhImlhdvXMVTvBfgFXsziNBdwQcHpWUUqggPfC6y0zsWxBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:10:41.064576Z","bundle_sha256":"5c49fb74329f8011308c6ee332118f9fe44e2b3c4de1debf0e7420bf4ea52c44"}}