{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RDKOLYZGV4TG37K46NLTXHIKR4","short_pith_number":"pith:RDKOLYZG","schema_version":"1.0","canonical_sha256":"88d4e5e326af266dfd5cf3573b9d0a8f20a0c14f4a44bb3a1c7c51a3a04ebda4","source":{"kind":"arxiv","id":"1401.2714","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Logics for UL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Paritosh K. Pandya, Simoni S. Shah","submitted_at":"2014-01-13T05:31:59Z","abstract_excerpt":"The class of Unambiguous Star-Free Regular Languages (UL) was defined by Schutzenberger as the class of languages defined by Unambiguous Polynomials. UL has been variously characterized (over finite words) by logics such as TL[X_a,Y_a], UITL, TL[F,P], FO2[<], the variety DA of monoids, as well as partially-ordered two-way DFA (po2DFA). We revisit this language class with emphasis on notion of unambiguity and develop on the concept of Deterministic Logics for UL. The formulas of deterministic logics uniquely parse a word in order to evaluate satisfaction. We show that several deterministic logi"},"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":"1401.2714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-13T05:31:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"21f1738b873f10ce9da7755ef0be3996473fccfaaa1df8b987d29223f65048f7","abstract_canon_sha256":"725ce0ad4ced57781758d8dd2cc8f74e9383c88c7c67fd77aef9947e84ffddb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:32.441564Z","signature_b64":"hz7Q0tQ4Q3jFWo+fBDVXvuaHGneC8zLhHveIxYAPt0kCsC9hKEqIiLYX0YyJFORwRTxgy6g4SULTBt4y6iqSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88d4e5e326af266dfd5cf3573b9d0a8f20a0c14f4a44bb3a1c7c51a3a04ebda4","last_reissued_at":"2026-05-18T03:02:32.440923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:32.440923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Logics for UL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Paritosh K. Pandya, Simoni S. Shah","submitted_at":"2014-01-13T05:31:59Z","abstract_excerpt":"The class of Unambiguous Star-Free Regular Languages (UL) was defined by Schutzenberger as the class of languages defined by Unambiguous Polynomials. UL has been variously characterized (over finite words) by logics such as TL[X_a,Y_a], UITL, TL[F,P], FO2[<], the variety DA of monoids, as well as partially-ordered two-way DFA (po2DFA). We revisit this language class with emphasis on notion of unambiguity and develop on the concept of Deterministic Logics for UL. The formulas of deterministic logics uniquely parse a word in order to evaluate satisfaction. We show that several deterministic logi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2714","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":"1401.2714","created_at":"2026-05-18T03:02:32.441035+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2714v1","created_at":"2026-05-18T03:02:32.441035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2714","created_at":"2026-05-18T03:02:32.441035+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDKOLYZGV4TG","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDKOLYZGV4TG37K4","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDKOLYZG","created_at":"2026-05-18T12:28:46.137349+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/RDKOLYZGV4TG37K46NLTXHIKR4","json":"https://pith.science/pith/RDKOLYZGV4TG37K46NLTXHIKR4.json","graph_json":"https://pith.science/api/pith-number/RDKOLYZGV4TG37K46NLTXHIKR4/graph.json","events_json":"https://pith.science/api/pith-number/RDKOLYZGV4TG37K46NLTXHIKR4/events.json","paper":"https://pith.science/paper/RDKOLYZG"},"agent_actions":{"view_html":"https://pith.science/pith/RDKOLYZGV4TG37K46NLTXHIKR4","download_json":"https://pith.science/pith/RDKOLYZGV4TG37K46NLTXHIKR4.json","view_paper":"https://pith.science/paper/RDKOLYZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2714&json=true","fetch_graph":"https://pith.science/api/pith-number/RDKOLYZGV4TG37K46NLTXHIKR4/graph.json","fetch_events":"https://pith.science/api/pith-number/RDKOLYZGV4TG37K46NLTXHIKR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDKOLYZGV4TG37K46NLTXHIKR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDKOLYZGV4TG37K46NLTXHIKR4/action/storage_attestation","attest_author":"https://pith.science/pith/RDKOLYZGV4TG37K46NLTXHIKR4/action/author_attestation","sign_citation":"https://pith.science/pith/RDKOLYZGV4TG37K46NLTXHIKR4/action/citation_signature","submit_replication":"https://pith.science/pith/RDKOLYZGV4TG37K46NLTXHIKR4/action/replication_record"}},"created_at":"2026-05-18T03:02:32.441035+00:00","updated_at":"2026-05-18T03:02:32.441035+00:00"}