{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PHOGDUO5B4LCLLZV55VGRMHOG4","short_pith_number":"pith:PHOGDUO5","schema_version":"1.0","canonical_sha256":"79dc61d1dd0f1625af35ef6a68b0ee3713de49c3fb35e941179c3c2eeb35e3a9","source":{"kind":"arxiv","id":"2608.08017","version":1},"attestation_state":"computed","paper":{"title":"Existence and computation of monomial families of near-optimal strategies for recursive games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.OC"],"primary_cat":"cs.GT","authors_text":"Peter Bro Miltersen","submitted_at":"2026-08-08T08:55:35Z","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"},"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":"2608.08017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-08-08T08:55:35Z","cross_cats_sorted":["cs.SC","math.OC"],"title_canon_sha256":"5cd10b1d248c7afff9c757e48c4596ea42965d54c82e13d9f2768b72decd483b","abstract_canon_sha256":"cef15d4abb08ffc973034b7bea4055225cd6dabe828dbfe8b2c1c71aefb1754b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:21:24.645881Z","signature_b64":"SolEHLF97+d4FalQaojc4dA+6Ul3hTY9VDLwLQ1SGz8yLTHJUaB8tMfLMXoDjX9P2QR0L2Lks+Ff+hsm4+3WAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79dc61d1dd0f1625af35ef6a68b0ee3713de49c3fb35e941179c3c2eeb35e3a9","last_reissued_at":"2026-08-11T01:21:24.643351Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:21:24.643351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Existence and computation of monomial families of near-optimal strategies for recursive games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.OC"],"primary_cat":"cs.GT","authors_text":"Peter Bro Miltersen","submitted_at":"2026-08-08T08:55:35Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08017","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.08017/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":"2608.08017","created_at":"2026-08-11T01:21:24.644161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08017v1","created_at":"2026-08-11T01:21:24.644161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08017","created_at":"2026-08-11T01:21:24.644161+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHOGDUO5B4LC","created_at":"2026-08-11T01:21:24.644161+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHOGDUO5B4LCLLZV","created_at":"2026-08-11T01:21:24.644161+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHOGDUO5","created_at":"2026-08-11T01:21:24.644161+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/PHOGDUO5B4LCLLZV55VGRMHOG4","json":"https://pith.science/pith/PHOGDUO5B4LCLLZV55VGRMHOG4.json","graph_json":"https://pith.science/api/pith-number/PHOGDUO5B4LCLLZV55VGRMHOG4/graph.json","events_json":"https://pith.science/api/pith-number/PHOGDUO5B4LCLLZV55VGRMHOG4/events.json","paper":"https://pith.science/paper/PHOGDUO5"},"agent_actions":{"view_html":"https://pith.science/pith/PHOGDUO5B4LCLLZV55VGRMHOG4","download_json":"https://pith.science/pith/PHOGDUO5B4LCLLZV55VGRMHOG4.json","view_paper":"https://pith.science/paper/PHOGDUO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08017&json=true","fetch_graph":"https://pith.science/api/pith-number/PHOGDUO5B4LCLLZV55VGRMHOG4/graph.json","fetch_events":"https://pith.science/api/pith-number/PHOGDUO5B4LCLLZV55VGRMHOG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHOGDUO5B4LCLLZV55VGRMHOG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHOGDUO5B4LCLLZV55VGRMHOG4/action/storage_attestation","attest_author":"https://pith.science/pith/PHOGDUO5B4LCLLZV55VGRMHOG4/action/author_attestation","sign_citation":"https://pith.science/pith/PHOGDUO5B4LCLLZV55VGRMHOG4/action/citation_signature","submit_replication":"https://pith.science/pith/PHOGDUO5B4LCLLZV55VGRMHOG4/action/replication_record"}},"created_at":"2026-08-11T01:21:24.644161+00:00","updated_at":"2026-08-11T01:21:24.644161+00:00"}