{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MNHSF75CJWUPFAMPVZRDBVX2S4","short_pith_number":"pith:MNHSF75C","schema_version":"1.0","canonical_sha256":"634f22ffa24da8f2818fae6230d6fa97003e6dc51a779d4752e9659b8e6241d1","source":{"kind":"arxiv","id":"1710.02329","version":2},"attestation_state":"computed","paper":{"title":"Synchronizing Data Words for Register Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Karin Quaas, Mahsa Shirmohammadi","submitted_at":"2017-10-06T09:53:13Z","abstract_excerpt":"Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data words in RAs: does there exist a data word that sends all states of the RA to a single state?\n  For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data from the infinite data domain is sufficient to synchronize. We show that the synchronization problem for DRAs is in general PSPACE-complete, and it is NLOGSPACE-complete for 1-DRAs. For nondeterministic RAs (NRAs), we "},"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":"1710.02329","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-06T09:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"8ee17a2fbb2e73f94178c2d37c329fea7e6c669c46e4c36813f4b82bde32103f","abstract_canon_sha256":"4b97384b20b029a90a971891e97c3cf149b889ceca9d59fc5c198d82fc9e4a47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.043336Z","signature_b64":"ALWLEt6fuFZOnCQbhXnt+7FUSGRL6LMizYiq1Vwv5p/gadJClOOGpb3qxdoyrFQNYCJPuE7sdh+7zp1FI95RCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"634f22ffa24da8f2818fae6230d6fa97003e6dc51a779d4752e9659b8e6241d1","last_reissued_at":"2026-05-17T23:43:54.042608Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.042608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronizing Data Words for Register Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Karin Quaas, Mahsa Shirmohammadi","submitted_at":"2017-10-06T09:53:13Z","abstract_excerpt":"Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data words in RAs: does there exist a data word that sends all states of the RA to a single state?\n  For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data from the infinite data domain is sufficient to synchronize. We show that the synchronization problem for DRAs is in general PSPACE-complete, and it is NLOGSPACE-complete for 1-DRAs. For nondeterministic RAs (NRAs), we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02329","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":"1710.02329","created_at":"2026-05-17T23:43:54.042717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02329v2","created_at":"2026-05-17T23:43:54.042717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02329","created_at":"2026-05-17T23:43:54.042717+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNHSF75CJWUP","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNHSF75CJWUPFAMP","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNHSF75C","created_at":"2026-05-18T12:31:31.346846+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/MNHSF75CJWUPFAMPVZRDBVX2S4","json":"https://pith.science/pith/MNHSF75CJWUPFAMPVZRDBVX2S4.json","graph_json":"https://pith.science/api/pith-number/MNHSF75CJWUPFAMPVZRDBVX2S4/graph.json","events_json":"https://pith.science/api/pith-number/MNHSF75CJWUPFAMPVZRDBVX2S4/events.json","paper":"https://pith.science/paper/MNHSF75C"},"agent_actions":{"view_html":"https://pith.science/pith/MNHSF75CJWUPFAMPVZRDBVX2S4","download_json":"https://pith.science/pith/MNHSF75CJWUPFAMPVZRDBVX2S4.json","view_paper":"https://pith.science/paper/MNHSF75C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02329&json=true","fetch_graph":"https://pith.science/api/pith-number/MNHSF75CJWUPFAMPVZRDBVX2S4/graph.json","fetch_events":"https://pith.science/api/pith-number/MNHSF75CJWUPFAMPVZRDBVX2S4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNHSF75CJWUPFAMPVZRDBVX2S4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNHSF75CJWUPFAMPVZRDBVX2S4/action/storage_attestation","attest_author":"https://pith.science/pith/MNHSF75CJWUPFAMPVZRDBVX2S4/action/author_attestation","sign_citation":"https://pith.science/pith/MNHSF75CJWUPFAMPVZRDBVX2S4/action/citation_signature","submit_replication":"https://pith.science/pith/MNHSF75CJWUPFAMPVZRDBVX2S4/action/replication_record"}},"created_at":"2026-05-17T23:43:54.042717+00:00","updated_at":"2026-05-17T23:43:54.042717+00:00"}