{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PS7MQLUTB76WUZ3QBFQ4RF2SJK","short_pith_number":"pith:PS7MQLUT","schema_version":"1.0","canonical_sha256":"7cbec82e930ffd6a67700961c897524a9be996056f557b36c3fb28623c38b941","source":{"kind":"arxiv","id":"1411.4796","version":3},"attestation_state":"computed","paper":{"title":"Weighted automata on infinite words in the context of Attacker-Defender games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LO"],"primary_cat":"cs.FL","authors_text":"Igor Potapov, Reino Niskanen, Tero Harju, Vesa Halava","submitted_at":"2014-11-18T10:24:35Z","abstract_excerpt":"We consider infinite-state Attacker-Defender games with reachability objectives. The results of the paper are twofold. Firstly we prove a new language-theoretic result for weighted automata on infinite words and show its encoding into the framework of Attacker-Defender games. Secondly we use this novel concept to prove undecidability for checking existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games."},"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":"1411.4796","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-11-18T10:24:35Z","cross_cats_sorted":["cs.GT","cs.LO"],"title_canon_sha256":"82c68336a33396bf26ffea8ab4e5d884ffd69dc94781a84fe92b62e5804b4542","abstract_canon_sha256":"cd1195f39651758972059b85eacd4638722e1a12ec8818896a84e5d3226bb21e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:51.698497Z","signature_b64":"0PSxtJiugAlmh+v1bCODThGOGP79K1MQSPcOZB5yZZCZEfenFUxrIamKwf/V8PQg/WLYyiWiSJ6r0flSEK7rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cbec82e930ffd6a67700961c897524a9be996056f557b36c3fb28623c38b941","last_reissued_at":"2026-05-18T02:17:51.697883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:51.697883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted automata on infinite words in the context of Attacker-Defender games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LO"],"primary_cat":"cs.FL","authors_text":"Igor Potapov, Reino Niskanen, Tero Harju, Vesa Halava","submitted_at":"2014-11-18T10:24:35Z","abstract_excerpt":"We consider infinite-state Attacker-Defender games with reachability objectives. The results of the paper are twofold. Firstly we prove a new language-theoretic result for weighted automata on infinite words and show its encoding into the framework of Attacker-Defender games. Secondly we use this novel concept to prove undecidability for checking existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4796","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.4796","created_at":"2026-05-18T02:17:51.697974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4796v3","created_at":"2026-05-18T02:17:51.697974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4796","created_at":"2026-05-18T02:17:51.697974+00:00"},{"alias_kind":"pith_short_12","alias_value":"PS7MQLUTB76W","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PS7MQLUTB76WUZ3Q","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PS7MQLUT","created_at":"2026-05-18T12:28:43.426989+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/PS7MQLUTB76WUZ3QBFQ4RF2SJK","json":"https://pith.science/pith/PS7MQLUTB76WUZ3QBFQ4RF2SJK.json","graph_json":"https://pith.science/api/pith-number/PS7MQLUTB76WUZ3QBFQ4RF2SJK/graph.json","events_json":"https://pith.science/api/pith-number/PS7MQLUTB76WUZ3QBFQ4RF2SJK/events.json","paper":"https://pith.science/paper/PS7MQLUT"},"agent_actions":{"view_html":"https://pith.science/pith/PS7MQLUTB76WUZ3QBFQ4RF2SJK","download_json":"https://pith.science/pith/PS7MQLUTB76WUZ3QBFQ4RF2SJK.json","view_paper":"https://pith.science/paper/PS7MQLUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4796&json=true","fetch_graph":"https://pith.science/api/pith-number/PS7MQLUTB76WUZ3QBFQ4RF2SJK/graph.json","fetch_events":"https://pith.science/api/pith-number/PS7MQLUTB76WUZ3QBFQ4RF2SJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PS7MQLUTB76WUZ3QBFQ4RF2SJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PS7MQLUTB76WUZ3QBFQ4RF2SJK/action/storage_attestation","attest_author":"https://pith.science/pith/PS7MQLUTB76WUZ3QBFQ4RF2SJK/action/author_attestation","sign_citation":"https://pith.science/pith/PS7MQLUTB76WUZ3QBFQ4RF2SJK/action/citation_signature","submit_replication":"https://pith.science/pith/PS7MQLUTB76WUZ3QBFQ4RF2SJK/action/replication_record"}},"created_at":"2026-05-18T02:17:51.697974+00:00","updated_at":"2026-05-18T02:17:51.697974+00:00"}