{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7NKOC3G3XJTBCJW4XSSTS7QUNX","short_pith_number":"pith:7NKOC3G3","schema_version":"1.0","canonical_sha256":"fb54e16cdbba661126dcbca5397e146dfa6a8e8dd9ba0f7606b93685dd5bfaa1","source":{"kind":"arxiv","id":"1805.01829","version":1},"attestation_state":"computed","paper":{"title":"Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Joshua Young, Nelma Moreira, Rogerio Reis, Stavros Konstantinidis","submitted_at":"2018-05-04T15:46:07Z","abstract_excerpt":"We are interested in regular expressions and transducers that represent word relations in an alphabet-invariant way---for example, the set of all word pairs u,v where v is a prefix of u independently of what the alphabet is. Current software systems of formal language objects do not have a mechanism to define such objects. We define transducers in which transition labels involve what we call set specifications, some of which are alphabet invariant. In fact, we give a more broad definition of automata-type objects, called labelled graphs, where each transition label can be any string, as long a"},"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":"1805.01829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-04T15:46:07Z","cross_cats_sorted":[],"title_canon_sha256":"0cdbe47e88b18f3288d8b0ce10baa28c087461f5a5db839fc47e668d41f10d09","abstract_canon_sha256":"5dac708aef6d4b7e10ad2dd7e3ca57c6f18700bfc116cf271811c7aa01e18d84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:46.542991Z","signature_b64":"gUrQcl9p7RpXCVvtSIHgIpPHkgt5hfbkzsYgloBJcHLuPIHd30yQwMnjyKuawxAPUNwASiUhNdsOY/9K1hdzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb54e16cdbba661126dcbca5397e146dfa6a8e8dd9ba0f7606b93685dd5bfaa1","last_reissued_at":"2026-05-18T00:16:46.542361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:46.542361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Joshua Young, Nelma Moreira, Rogerio Reis, Stavros Konstantinidis","submitted_at":"2018-05-04T15:46:07Z","abstract_excerpt":"We are interested in regular expressions and transducers that represent word relations in an alphabet-invariant way---for example, the set of all word pairs u,v where v is a prefix of u independently of what the alphabet is. Current software systems of formal language objects do not have a mechanism to define such objects. We define transducers in which transition labels involve what we call set specifications, some of which are alphabet invariant. In fact, we give a more broad definition of automata-type objects, called labelled graphs, where each transition label can be any string, as long a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01829","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":"1805.01829","created_at":"2026-05-18T00:16:46.542478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01829v1","created_at":"2026-05-18T00:16:46.542478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01829","created_at":"2026-05-18T00:16:46.542478+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NKOC3G3XJTB","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NKOC3G3XJTBCJW4","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NKOC3G3","created_at":"2026-05-18T12:32:11.075285+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/7NKOC3G3XJTBCJW4XSSTS7QUNX","json":"https://pith.science/pith/7NKOC3G3XJTBCJW4XSSTS7QUNX.json","graph_json":"https://pith.science/api/pith-number/7NKOC3G3XJTBCJW4XSSTS7QUNX/graph.json","events_json":"https://pith.science/api/pith-number/7NKOC3G3XJTBCJW4XSSTS7QUNX/events.json","paper":"https://pith.science/paper/7NKOC3G3"},"agent_actions":{"view_html":"https://pith.science/pith/7NKOC3G3XJTBCJW4XSSTS7QUNX","download_json":"https://pith.science/pith/7NKOC3G3XJTBCJW4XSSTS7QUNX.json","view_paper":"https://pith.science/paper/7NKOC3G3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01829&json=true","fetch_graph":"https://pith.science/api/pith-number/7NKOC3G3XJTBCJW4XSSTS7QUNX/graph.json","fetch_events":"https://pith.science/api/pith-number/7NKOC3G3XJTBCJW4XSSTS7QUNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NKOC3G3XJTBCJW4XSSTS7QUNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NKOC3G3XJTBCJW4XSSTS7QUNX/action/storage_attestation","attest_author":"https://pith.science/pith/7NKOC3G3XJTBCJW4XSSTS7QUNX/action/author_attestation","sign_citation":"https://pith.science/pith/7NKOC3G3XJTBCJW4XSSTS7QUNX/action/citation_signature","submit_replication":"https://pith.science/pith/7NKOC3G3XJTBCJW4XSSTS7QUNX/action/replication_record"}},"created_at":"2026-05-18T00:16:46.542478+00:00","updated_at":"2026-05-18T00:16:46.542478+00:00"}