{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TFGDQ77NHBGLPYCQPDM7K44KN7","short_pith_number":"pith:TFGDQ77N","schema_version":"1.0","canonical_sha256":"994c387fed384cb7e05078d9f5738a6fe12dcbaea77ffb86bc3a6f1682deddec","source":{"kind":"arxiv","id":"2502.05840","version":3},"attestation_state":"computed","paper":{"title":"The memory of $\\omega$-regular and BC($\\Sigma_2^0$) objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Antonio Casares, Pierre Ohlmann","submitted_at":"2025-02-09T10:23:17Z","abstract_excerpt":"In the context of 2-player zero-sum infinite-duration games played on (potentially infinite) graphs, the memory of an objective is the smallest integer k such that in any game won by Eve, she has a strategy with <= k states of memory. For omega-regular objectives, checking whether the memory equals a given number k was not known to be decidable. In this work, we focus on objectives in BC(Sigma0^2), i.e. recognised by a potentially infinite deterministic parity automaton. We provide a class of automata that recognise objectives with memory <= k, leading to the following results: (1) For omega-r"},"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":"2502.05840","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-02-09T10:23:17Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4cac1e7920e9bc6e34c7231713c9162d0d304c28506fb28f00957d552c46268b","abstract_canon_sha256":"654cebe9384aa1273bebc981452d712d9e6844e4e1a0c8eb7f00ac63a824e7ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:46.357969Z","signature_b64":"g0oFRCLtxtFNx1nrFd2j3mrJVTHThzY4r+uFZikSyS5Iqto9p1JZH8rYA+7as7/MOVpBa7VR1tg1LZJL1/W/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"994c387fed384cb7e05078d9f5738a6fe12dcbaea77ffb86bc3a6f1682deddec","last_reissued_at":"2026-06-02T02:04:46.357469Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:46.357469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The memory of $\\omega$-regular and BC($\\Sigma_2^0$) objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Antonio Casares, Pierre Ohlmann","submitted_at":"2025-02-09T10:23:17Z","abstract_excerpt":"In the context of 2-player zero-sum infinite-duration games played on (potentially infinite) graphs, the memory of an objective is the smallest integer k such that in any game won by Eve, she has a strategy with <= k states of memory. For omega-regular objectives, checking whether the memory equals a given number k was not known to be decidable. In this work, we focus on objectives in BC(Sigma0^2), i.e. recognised by a potentially infinite deterministic parity automaton. We provide a class of automata that recognise objectives with memory <= k, leading to the following results: (1) For omega-r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05840","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.05840/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":"2502.05840","created_at":"2026-06-02T02:04:46.357532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05840v3","created_at":"2026-06-02T02:04:46.357532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05840","created_at":"2026-06-02T02:04:46.357532+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFGDQ77NHBGL","created_at":"2026-06-02T02:04:46.357532+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFGDQ77NHBGLPYCQ","created_at":"2026-06-02T02:04:46.357532+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFGDQ77N","created_at":"2026-06-02T02:04:46.357532+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/TFGDQ77NHBGLPYCQPDM7K44KN7","json":"https://pith.science/pith/TFGDQ77NHBGLPYCQPDM7K44KN7.json","graph_json":"https://pith.science/api/pith-number/TFGDQ77NHBGLPYCQPDM7K44KN7/graph.json","events_json":"https://pith.science/api/pith-number/TFGDQ77NHBGLPYCQPDM7K44KN7/events.json","paper":"https://pith.science/paper/TFGDQ77N"},"agent_actions":{"view_html":"https://pith.science/pith/TFGDQ77NHBGLPYCQPDM7K44KN7","download_json":"https://pith.science/pith/TFGDQ77NHBGLPYCQPDM7K44KN7.json","view_paper":"https://pith.science/paper/TFGDQ77N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05840&json=true","fetch_graph":"https://pith.science/api/pith-number/TFGDQ77NHBGLPYCQPDM7K44KN7/graph.json","fetch_events":"https://pith.science/api/pith-number/TFGDQ77NHBGLPYCQPDM7K44KN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFGDQ77NHBGLPYCQPDM7K44KN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFGDQ77NHBGLPYCQPDM7K44KN7/action/storage_attestation","attest_author":"https://pith.science/pith/TFGDQ77NHBGLPYCQPDM7K44KN7/action/author_attestation","sign_citation":"https://pith.science/pith/TFGDQ77NHBGLPYCQPDM7K44KN7/action/citation_signature","submit_replication":"https://pith.science/pith/TFGDQ77NHBGLPYCQPDM7K44KN7/action/replication_record"}},"created_at":"2026-06-02T02:04:46.357532+00:00","updated_at":"2026-06-02T02:04:46.357532+00:00"}