{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:65MDF5GUTSTHKYXXQ7RE4M6I4Q","short_pith_number":"pith:65MDF5GU","schema_version":"1.0","canonical_sha256":"f75832f4d49ca67562f787e24e33c8e41ab03b0f16fe5f4eaa8ac6d5e2bdf7f9","source":{"kind":"arxiv","id":"1202.3957","version":2},"attestation_state":"computed","paper":{"title":"Alternating register automata on finite words and trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.DB","authors_text":"Diego Figueira (INRIA & ENS Cachan, LSV)","submitted_at":"2012-02-17T16:38:10Z","abstract_excerpt":"We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating control over data words or trees, with one register for storing data and comparing them for equality. This is a continuation of the study started by Demri, Lazic and Jurdzinski. From the standpoint of register automata models, this work aims at two objectives: (1) simplifying the existent decidability pr"},"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":"1202.3957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-02-17T16:38:10Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"413dc1253007706bb24c6ea4466fb1d990c286cb0a31c13e4a356821357b3337","abstract_canon_sha256":"fadd7bdb09db37a64969440bd1934505d56a5d869480413069fc4dd325abb5be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.001007Z","signature_b64":"srU6EoQjEhAHlh4BZdFcdrQLNzJAzUyfBfoGuhwYxzecFyraP95hRcdCBYp9XG0qRQ6lGdna/WmXfpcD1tOSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f75832f4d49ca67562f787e24e33c8e41ab03b0f16fe5f4eaa8ac6d5e2bdf7f9","last_reissued_at":"2026-05-18T01:37:39.000341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.000341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating register automata on finite words and trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.DB","authors_text":"Diego Figueira (INRIA & ENS Cachan, LSV)","submitted_at":"2012-02-17T16:38:10Z","abstract_excerpt":"We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating control over data words or trees, with one register for storing data and comparing them for equality. This is a continuation of the study started by Demri, Lazic and Jurdzinski. From the standpoint of register automata models, this work aims at two objectives: (1) simplifying the existent decidability pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3957","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":"1202.3957","created_at":"2026-05-18T01:37:39.000440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3957v2","created_at":"2026-05-18T01:37:39.000440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3957","created_at":"2026-05-18T01:37:39.000440+00:00"},{"alias_kind":"pith_short_12","alias_value":"65MDF5GUTSTH","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"65MDF5GUTSTHKYXX","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"65MDF5GU","created_at":"2026-05-18T12:26:56.085431+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/65MDF5GUTSTHKYXXQ7RE4M6I4Q","json":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q.json","graph_json":"https://pith.science/api/pith-number/65MDF5GUTSTHKYXXQ7RE4M6I4Q/graph.json","events_json":"https://pith.science/api/pith-number/65MDF5GUTSTHKYXXQ7RE4M6I4Q/events.json","paper":"https://pith.science/paper/65MDF5GU"},"agent_actions":{"view_html":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q","download_json":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q.json","view_paper":"https://pith.science/paper/65MDF5GU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3957&json=true","fetch_graph":"https://pith.science/api/pith-number/65MDF5GUTSTHKYXXQ7RE4M6I4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/65MDF5GUTSTHKYXXQ7RE4M6I4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/action/storage_attestation","attest_author":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/action/author_attestation","sign_citation":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/action/citation_signature","submit_replication":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/action/replication_record"}},"created_at":"2026-05-18T01:37:39.000440+00:00","updated_at":"2026-05-18T01:37:39.000440+00:00"}