{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PHOGDUO5B4LCLLZV55VGRMHOG4","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":"cef15d4abb08ffc973034b7bea4055225cd6dabe828dbfe8b2c1c71aefb1754b","cross_cats_sorted":["cs.SC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-08T08:55:35Z","title_canon_sha256":"5cd10b1d248c7afff9c757e48c4596ea42965d54c82e13d9f2768b72decd483b"},"schema_version":"1.0","source":{"id":"2608.08017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08017","created_at":"2026-08-11T01:21:24Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08017v1","created_at":"2026-08-11T01:21:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08017","created_at":"2026-08-11T01:21:24Z"},{"alias_kind":"pith_short_12","alias_value":"PHOGDUO5B4LC","created_at":"2026-08-11T01:21:24Z"},{"alias_kind":"pith_short_16","alias_value":"PHOGDUO5B4LCLLZV","created_at":"2026-08-11T01:21:24Z"},{"alias_kind":"pith_short_8","alias_value":"PHOGDUO5","created_at":"2026-08-11T01:21:24Z"}],"graph_snapshots":[{"event_id":"sha256:39088fbf90b88002305f77e42cc7967ed0c79c5c2da375388f5fcdc47e4361e4","target":"graph","created_at":"2026-08-11T01:21:24Z","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/2608.08017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a finite recursive game in the sense of Everett, both players have stationary epsilon-optimal strategies for every epsilon>0. Frederiksen and Miltersen strengthened this result by showing that the strategies for all sufficiently small epsilon can be encoded by finitely many monomials: at every state, all but possibly one of the action probabilities are constants times integer powers of epsilon. The resulting finite symbolic object specifies a strategy for every sufficiently small accuracy. Their proof uses semialgebraic selection and Puiseux series.\n  We give an alternative elementary proof","authors_text":"Peter Bro Miltersen","cross_cats":["cs.SC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08017","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:644ea9beaee4c871434afff124d546455cffbf0e1e93b02c82e57dc060ba894f","target":"record","created_at":"2026-08-11T01:21:24Z","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":"cef15d4abb08ffc973034b7bea4055225cd6dabe828dbfe8b2c1c71aefb1754b","cross_cats_sorted":["cs.SC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-08T08:55:35Z","title_canon_sha256":"5cd10b1d248c7afff9c757e48c4596ea42965d54c82e13d9f2768b72decd483b"},"schema_version":"1.0","source":{"id":"2608.08017","kind":"arxiv","version":1}},"canonical_sha256":"79dc61d1dd0f1625af35ef6a68b0ee3713de49c3fb35e941179c3c2eeb35e3a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79dc61d1dd0f1625af35ef6a68b0ee3713de49c3fb35e941179c3c2eeb35e3a9","first_computed_at":"2026-08-11T01:21:24.643351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:21:24.643351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SolEHLF97+d4FalQaojc4dA+6Ul3hTY9VDLwLQ1SGz8yLTHJUaB8tMfLMXoDjX9P2QR0L2Lks+Ff+hsm4+3WAA==","signature_status":"signed_v1","signed_at":"2026-08-11T01:21:24.645881Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.08017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:644ea9beaee4c871434afff124d546455cffbf0e1e93b02c82e57dc060ba894f","sha256:39088fbf90b88002305f77e42cc7967ed0c79c5c2da375388f5fcdc47e4361e4"],"state_sha256":"a5407515dff66c13d677709bdf55f112561b22eb18d524605c9dfa14a4083d0e"}