{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:52YJKWQVFF2YK7VZEUODDO4SYS","short_pith_number":"pith:52YJKWQV","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"},"canonical_sha256":"eeb0955a152975857eb9251c31bb92c4a1705fc7d520f5f6c7295ece1bfbadc5","source":{"kind":"arxiv","id":"1011.1842","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1842","created_at":"2026-05-18T04:34:08Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1842v2","created_at":"2026-05-18T04:34:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1842","created_at":"2026-05-18T04:34:08Z"},{"alias_kind":"pith_short_12","alias_value":"52YJKWQVFF2Y","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"52YJKWQVFF2YK7VZ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"52YJKWQV","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:52YJKWQVFF2YK7VZEUODDO4SYS","target":"record","payload":{"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"},"canonical_sha256":"eeb0955a152975857eb9251c31bb92c4a1705fc7d520f5f6c7295ece1bfbadc5","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"},"source_kind":"arxiv","source_id":"1011.1842","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:34:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pGx1Ke22qDSeGsPeXqhLxaCjrNOfEuLIwxU+qqj8jAmoob3/8hk3ptpDx82wbV/p9lyus4N5O/lvT3YXfYPtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:43:24.222969Z"},"content_sha256":"b92b7467a4e1715a77eaff367b6ce38451b66828e6c2a3742c9ff1cee3ecf227","schema_version":"1.0","event_id":"sha256:b92b7467a4e1715a77eaff367b6ce38451b66828e6c2a3742c9ff1cee3ecf227"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:52YJKWQVFF2YK7VZEUODDO4SYS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:34:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1BIOSClhh5uyvP4BRPV+qa+RB1OmrBfnirhB8k12jqfmrmuEA4gFcQiy2HUhxy+RA7aWuz7R5fZaMScC4VuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:43:24.223401Z"},"content_sha256":"769741b8a757a14dff3027a58366994896c07dcec565664bee71e44ba8297706","schema_version":"1.0","event_id":"sha256:769741b8a757a14dff3027a58366994896c07dcec565664bee71e44ba8297706"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/bundle.json","state_url":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52YJKWQVFF2YK7VZEUODDO4SYS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T22:43:24Z","links":{"resolver":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS","bundle":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/bundle.json","state":"https://pith.science/pith/52YJKWQVFF2YK7VZEUODDO4SYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52YJKWQVFF2YK7VZEUODDO4SYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:52YJKWQVFF2YK7VZEUODDO4SYS","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":"c6e31d2e0e5f6c126cbcc10ffb31fcd65436debc371f705bde746017c8cb9b9c","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-08T16:35:06Z","title_canon_sha256":"d0ae65991c1e66eac0834de806fad27d86f3ab1c6e1cd9e753881294f6b79799"},"schema_version":"1.0","source":{"id":"1011.1842","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1842","created_at":"2026-05-18T04:34:08Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1842v2","created_at":"2026-05-18T04:34:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1842","created_at":"2026-05-18T04:34:08Z"},{"alias_kind":"pith_short_12","alias_value":"52YJKWQVFF2Y","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"52YJKWQVFF2YK7VZ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"52YJKWQV","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:769741b8a757a14dff3027a58366994896c07dcec565664bee71e44ba8297706","target":"graph","created_at":"2026-05-18T04:34:08Z","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"},"paper":{"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","authors_text":"M. Vyalyi, S. Tarasov","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-08T16:35:06Z","title":"Orbits of linear maps and regular languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1842","kind":"arxiv","version":2},"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:b92b7467a4e1715a77eaff367b6ce38451b66828e6c2a3742c9ff1cee3ecf227","target":"record","created_at":"2026-05-18T04:34:08Z","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":"c6e31d2e0e5f6c126cbcc10ffb31fcd65436debc371f705bde746017c8cb9b9c","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-08T16:35:06Z","title_canon_sha256":"d0ae65991c1e66eac0834de806fad27d86f3ab1c6e1cd9e753881294f6b79799"},"schema_version":"1.0","source":{"id":"1011.1842","kind":"arxiv","version":2}},"canonical_sha256":"eeb0955a152975857eb9251c31bb92c4a1705fc7d520f5f6c7295ece1bfbadc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eeb0955a152975857eb9251c31bb92c4a1705fc7d520f5f6c7295ece1bfbadc5","first_computed_at":"2026-05-18T04:34:08.628125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:08.628125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mOBgJYZ7x6BQdgofxSIOJX6hRCPMXpcWffhNYppnvmemBzQKgmOKH53duQ41biyGGSHZhJHfXvZeQ3lFPhdoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:08.628591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1842","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b92b7467a4e1715a77eaff367b6ce38451b66828e6c2a3742c9ff1cee3ecf227","sha256:769741b8a757a14dff3027a58366994896c07dcec565664bee71e44ba8297706"],"state_sha256":"6f16346bbaad2e1f9a7937133328f1c2d1263f15e47d5ce207e07888cbe91deb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJuK18raE28ZDflhg2MgcBhrfbiVBXbueb+foNUKy5m+4sitiRcmXw/wsjqklW49CEoA2RlodrSeN2rde4B1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:43:24.226367Z","bundle_sha256":"5d58ebef97659a56b6cc7268d68916a0054bc6a1d138d702ed0d8e950f6626eb"}}