{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6HWRV2FW7ZZLNZ4GFOD6CH2UCU","short_pith_number":"pith:6HWRV2FW","schema_version":"1.0","canonical_sha256":"f1ed1ae8b6fe72b6e7862b87e11f5415030d38d440687e6da3bb041924a8cf1f","source":{"kind":"arxiv","id":"1105.5894","version":1},"attestation_state":"computed","paper":{"title":"Regular realizability problems and models of a generalized nondeterminism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"A. Rubtsov, M. Vyalyi","submitted_at":"2011-05-30T07:59:11Z","abstract_excerpt":"Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These notions are closely connected. In this paper we consider regular realizability problems for languages consist- ing of all prefixes of an infinite word. These problems are related to the automata on infinite words and to the decidability of monadic second-order theories. The main contribution is a new decidability condition for regular realizability problems "},"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":"1105.5894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-05-30T07:59:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"abf5fca84db3427c164734228ee7e68c8e39b611ef237db0afcdeef1df24a436","abstract_canon_sha256":"b9f5c126acd46846a3e4adc3552eccfdafb618558029213c310f8b5f56072f71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:49.414593Z","signature_b64":"wrhJ2tMQmzFwjXkXMW3Jise+HikJ8Jqy1sUnBEsw6kUXPPQNPQS17kqHwUxXDk67zFF8F7PaTW97fsNUak7xBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1ed1ae8b6fe72b6e7862b87e11f5415030d38d440687e6da3bb041924a8cf1f","last_reissued_at":"2026-05-18T02:21:49.414097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:49.414097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular realizability problems and models of a generalized nondeterminism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"A. Rubtsov, M. Vyalyi","submitted_at":"2011-05-30T07:59:11Z","abstract_excerpt":"Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These notions are closely connected. In this paper we consider regular realizability problems for languages consist- ing of all prefixes of an infinite word. These problems are related to the automata on infinite words and to the decidability of monadic second-order theories. The main contribution is a new decidability condition for regular realizability problems "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5894","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":""},"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":"1105.5894","created_at":"2026-05-18T02:21:49.414196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5894v1","created_at":"2026-05-18T02:21:49.414196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5894","created_at":"2026-05-18T02:21:49.414196+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HWRV2FW7ZZL","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HWRV2FW7ZZLNZ4G","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HWRV2FW","created_at":"2026-05-18T12:26:22.705136+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/6HWRV2FW7ZZLNZ4GFOD6CH2UCU","json":"https://pith.science/pith/6HWRV2FW7ZZLNZ4GFOD6CH2UCU.json","graph_json":"https://pith.science/api/pith-number/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/graph.json","events_json":"https://pith.science/api/pith-number/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/events.json","paper":"https://pith.science/paper/6HWRV2FW"},"agent_actions":{"view_html":"https://pith.science/pith/6HWRV2FW7ZZLNZ4GFOD6CH2UCU","download_json":"https://pith.science/pith/6HWRV2FW7ZZLNZ4GFOD6CH2UCU.json","view_paper":"https://pith.science/paper/6HWRV2FW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5894&json=true","fetch_graph":"https://pith.science/api/pith-number/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/graph.json","fetch_events":"https://pith.science/api/pith-number/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/action/storage_attestation","attest_author":"https://pith.science/pith/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/action/author_attestation","sign_citation":"https://pith.science/pith/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/action/citation_signature","submit_replication":"https://pith.science/pith/6HWRV2FW7ZZLNZ4GFOD6CH2UCU/action/replication_record"}},"created_at":"2026-05-18T02:21:49.414196+00:00","updated_at":"2026-05-18T02:21:49.414196+00:00"}