{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MSD3ZIMS3A7HNSTKJAGWBYMDAR","short_pith_number":"pith:MSD3ZIMS","schema_version":"1.0","canonical_sha256":"6487bca192d83e76ca6a480d60e183047b5cdb0b6820f46ece08ee8d83139db8","source":{"kind":"arxiv","id":"1410.2022","version":3},"attestation_state":"computed","paper":{"title":"Logics with rigidly guarded data tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Clemens Ley (Independent researcher), Gabriele Puppis (LaBRI - CNRS), Thomas Colcombet (LIAFA - CNRS)","submitted_at":"2014-10-08T08:39:41Z","abstract_excerpt":"The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we introduce a variant of monadic second-order logic with data equality tests that captures precisely the data languages recognizable by orbit finite data monoids. We also establish, following this time the approach of Schutzenberger, McNaughton and Papert, that the first-order fragment of this logic defines exactly the data languages recognizable by aperiodic orbit finite data monoids. Finally, we consider another var"},"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":"1410.2022","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-08T08:39:41Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ec079670c8b7a3201618d93479e4d3a17134879dc869702831d8f851948b2e41","abstract_canon_sha256":"8c00d311c357b8b3220fa8adcfe3a2bc7e5c2580a922103bc8664fbe06a0747f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.927506Z","signature_b64":"4nr+ZaNfa68x5xprgRBN0nJdDYEDJY3FW3drMG4OaJSV0Qil+KmcKaAFNfyfpkE+BGfZtMx7JOJdE5/cq+wfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6487bca192d83e76ca6a480d60e183047b5cdb0b6820f46ece08ee8d83139db8","last_reissued_at":"2026-05-18T00:53:10.927019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.927019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logics with rigidly guarded data tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Clemens Ley (Independent researcher), Gabriele Puppis (LaBRI - CNRS), Thomas Colcombet (LIAFA - CNRS)","submitted_at":"2014-10-08T08:39:41Z","abstract_excerpt":"The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we introduce a variant of monadic second-order logic with data equality tests that captures precisely the data languages recognizable by orbit finite data monoids. We also establish, following this time the approach of Schutzenberger, McNaughton and Papert, that the first-order fragment of this logic defines exactly the data languages recognizable by aperiodic orbit finite data monoids. Finally, we consider another var"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2022","kind":"arxiv","version":3},"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":"1410.2022","created_at":"2026-05-18T00:53:10.927089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2022v3","created_at":"2026-05-18T00:53:10.927089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2022","created_at":"2026-05-18T00:53:10.927089+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSD3ZIMS3A7H","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSD3ZIMS3A7HNSTK","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSD3ZIMS","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.11190","citing_title":"Minimization of Streaming Transducers","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11190","citing_title":"Minimization of Streaming Transducers","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR","json":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR.json","graph_json":"https://pith.science/api/pith-number/MSD3ZIMS3A7HNSTKJAGWBYMDAR/graph.json","events_json":"https://pith.science/api/pith-number/MSD3ZIMS3A7HNSTKJAGWBYMDAR/events.json","paper":"https://pith.science/paper/MSD3ZIMS"},"agent_actions":{"view_html":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR","download_json":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR.json","view_paper":"https://pith.science/paper/MSD3ZIMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2022&json=true","fetch_graph":"https://pith.science/api/pith-number/MSD3ZIMS3A7HNSTKJAGWBYMDAR/graph.json","fetch_events":"https://pith.science/api/pith-number/MSD3ZIMS3A7HNSTKJAGWBYMDAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR/action/storage_attestation","attest_author":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR/action/author_attestation","sign_citation":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR/action/citation_signature","submit_replication":"https://pith.science/pith/MSD3ZIMS3A7HNSTKJAGWBYMDAR/action/replication_record"}},"created_at":"2026-05-18T00:53:10.927089+00:00","updated_at":"2026-05-18T00:53:10.927089+00:00"}