{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MFGIGLDFRHNPF6KOGIE4NXEPTQ","short_pith_number":"pith:MFGIGLDF","schema_version":"1.0","canonical_sha256":"614c832c6589daf2f94e3209c6dc8f9c038bc1ff1b9741c80bdf951c25995057","source":{"kind":"arxiv","id":"1110.1221","version":1},"attestation_state":"computed","paper":{"title":"Feasible Automata for Two-Variable Logic with Successor on Data Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ahmet Kara, Thomas Schwentick, Tony Tan","submitted_at":"2011-10-06T10:54:25Z","abstract_excerpt":"We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain. The model is (semantically) a restriction of data automata, introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data automata. It is strictly less expressive than data automata and the expressive power is incomparable with register automata. The expressive power of weak data automata corresponds exactly to existential monadic second order logic with successor +1 and data value equality \\sim, EMSO2(+1,\\sim). It foll"},"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":"1110.1221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-06T10:54:25Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d4f18b1bda01a59878ad6189922b68168b7178dbb570ccce2b528a47f701dfd1","abstract_canon_sha256":"ed7daff0e13e49fcaf1e64423e9e4fde094963208ff6c7d3510f466868f925ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:35.486632Z","signature_b64":"RWIeU6aZ5tjFJyhMVnM2v2LCEU95v4clENdC9o+B0Z4Lq8bwn0S+lgPCNw8z3yL/heyevgzsVy9K71UfYWDkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"614c832c6589daf2f94e3209c6dc8f9c038bc1ff1b9741c80bdf951c25995057","last_reissued_at":"2026-05-18T02:21:35.486027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:35.486027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feasible Automata for Two-Variable Logic with Successor on Data Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ahmet Kara, Thomas Schwentick, Tony Tan","submitted_at":"2011-10-06T10:54:25Z","abstract_excerpt":"We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain. The model is (semantically) a restriction of data automata, introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data automata. It is strictly less expressive than data automata and the expressive power is incomparable with register automata. The expressive power of weak data automata corresponds exactly to existential monadic second order logic with successor +1 and data value equality \\sim, EMSO2(+1,\\sim). It foll"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1221","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":"1110.1221","created_at":"2026-05-18T02:21:35.486126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1221v1","created_at":"2026-05-18T02:21:35.486126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1221","created_at":"2026-05-18T02:21:35.486126+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFGIGLDFRHNP","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFGIGLDFRHNPF6KO","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFGIGLDF","created_at":"2026-05-18T12:26:34.985390+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/MFGIGLDFRHNPF6KOGIE4NXEPTQ","json":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ.json","graph_json":"https://pith.science/api/pith-number/MFGIGLDFRHNPF6KOGIE4NXEPTQ/graph.json","events_json":"https://pith.science/api/pith-number/MFGIGLDFRHNPF6KOGIE4NXEPTQ/events.json","paper":"https://pith.science/paper/MFGIGLDF"},"agent_actions":{"view_html":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ","download_json":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ.json","view_paper":"https://pith.science/paper/MFGIGLDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1221&json=true","fetch_graph":"https://pith.science/api/pith-number/MFGIGLDFRHNPF6KOGIE4NXEPTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MFGIGLDFRHNPF6KOGIE4NXEPTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/action/storage_attestation","attest_author":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/action/author_attestation","sign_citation":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/action/citation_signature","submit_replication":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/action/replication_record"}},"created_at":"2026-05-18T02:21:35.486126+00:00","updated_at":"2026-05-18T02:21:35.486126+00:00"}