{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:52YJKWQVFF2YK7VZEUODDO4SYS","short_pith_number":"pith:52YJKWQV","schema_version":"1.0","canonical_sha256":"eeb0955a152975857eb9251c31bb92c4a1705fc7d520f5f6c7295ece1bfbadc5","source":{"kind":"arxiv","id":"1011.1842","version":2},"attestation_state":"computed","paper":{"title":"Orbits of linear maps and regular languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.FL","authors_text":"M. Vyalyi, S. Tarasov","submitted_at":"2010-11-08T16:35:06Z","abstract_excerpt":"We settle the equivalence between the problem of hitting a polyhedral set by the orbit of a linear map and the intersection of a regular language and a language of permutations of binary words (the permutation filter realizability problem). The decidability of the both problems is presently unknown and the first one is a straightforward generalization of the famous Skolem problem and the nonnegativity problem in the theory of linear recurrent sequences. To show a `borderline' status of the permutation filter realizability problem with respect to computability we present some decidable and unde"},"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":"1011.1842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-08T16:35:06Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"d0ae65991c1e66eac0834de806fad27d86f3ab1c6e1cd9e753881294f6b79799","abstract_canon_sha256":"c6e31d2e0e5f6c126cbcc10ffb31fcd65436debc371f705bde746017c8cb9b9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:08.628591Z","signature_b64":"mOBgJYZ7x6BQdgofxSIOJX6hRCPMXpcWffhNYppnvmemBzQKgmOKH53duQ41biyGGSHZhJHfXvZeQ3lFPhdoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeb0955a152975857eb9251c31bb92c4a1705fc7d520f5f6c7295ece1bfbadc5","last_reissued_at":"2026-05-18T04:34:08.628125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:08.628125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orbits of linear maps and regular languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.FL","authors_text":"M. Vyalyi, S. Tarasov","submitted_at":"2010-11-08T16:35:06Z","abstract_excerpt":"We settle the equivalence between the problem of hitting a polyhedral set by the orbit of a linear map and the intersection of a regular language and a language of permutations of binary words (the permutation filter realizability problem). The decidability of the both problems is presently unknown and the first one is a straightforward generalization of the famous Skolem problem and the nonnegativity problem in the theory of linear recurrent sequences. To show a `borderline' status of the permutation filter realizability problem with respect to computability we present some decidable and unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1842","kind":"arxiv","version":2},"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":"1011.1842","created_at":"2026-05-18T04:34:08.628187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1842v2","created_at":"2026-05-18T04:34:08.628187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1842","created_at":"2026-05-18T04:34:08.628187+00:00"},{"alias_kind":"pith_short_12","alias_value":"52YJKWQVFF2Y","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"52YJKWQVFF2YK7VZ","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"52YJKWQV","created_at":"2026-05-18T12:26:04.259169+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/52YJKWQVFF2YK7VZEUODDO4SYS","json":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS.json","graph_json":"https://pith.science/api/pith-number/52YJKWQVFF2YK7VZEUODDO4SYS/graph.json","events_json":"https://pith.science/api/pith-number/52YJKWQVFF2YK7VZEUODDO4SYS/events.json","paper":"https://pith.science/paper/52YJKWQV"},"agent_actions":{"view_html":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS","download_json":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS.json","view_paper":"https://pith.science/paper/52YJKWQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1842&json=true","fetch_graph":"https://pith.science/api/pith-number/52YJKWQVFF2YK7VZEUODDO4SYS/graph.json","fetch_events":"https://pith.science/api/pith-number/52YJKWQVFF2YK7VZEUODDO4SYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/action/storage_attestation","attest_author":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/action/author_attestation","sign_citation":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/action/citation_signature","submit_replication":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/action/replication_record"}},"created_at":"2026-05-18T04:34:08.628187+00:00","updated_at":"2026-05-18T04:34:08.628187+00:00"}