{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PJXLN2IVGIVU7UIDMJSUVAV6QB","short_pith_number":"pith:PJXLN2IV","schema_version":"1.0","canonical_sha256":"7a6eb6e915322b4fd10362654a82be807bbc56a832f5ee6f639df6c494ca5394","source":{"kind":"arxiv","id":"1612.06233","version":1},"attestation_state":"computed","paper":{"title":"Regular Separability of Parikh Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Charles Paperman, Lorenzo Clemente, S{\\l}awomir Lasota, Wojciech Czerwi\\'nski","submitted_at":"2016-12-19T15:49:27Z","abstract_excerpt":"We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of a given automaton regular?) is undecidable for this model, we show surprising decidability of the regular separability problem: given two Parikh automata, is there a regular language that contains one of them and is disjoint from the other?"},"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":"1612.06233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-12-19T15:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"3a84f8ba957af37d66134f2ad2d0c9446cf07313becf10bc269d2e5c8fa8a20e","abstract_canon_sha256":"f433b859c099669bf31243957033dfb9293027ebc5fda046510379d7d194b96c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:42.855126Z","signature_b64":"wXy8xpk8H7ORAh9/na5nZsghLui5vziMqetPLkSQMcZEUQA8TPDO4Ik52U6EkczZGMyiK4JbT2xGa1TaiM9BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a6eb6e915322b4fd10362654a82be807bbc56a832f5ee6f639df6c494ca5394","last_reissued_at":"2026-05-18T00:54:42.854777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:42.854777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular Separability of Parikh Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Charles Paperman, Lorenzo Clemente, S{\\l}awomir Lasota, Wojciech Czerwi\\'nski","submitted_at":"2016-12-19T15:49:27Z","abstract_excerpt":"We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of a given automaton regular?) is undecidable for this model, we show surprising decidability of the regular separability problem: given two Parikh automata, is there a regular language that contains one of them and is disjoint from the other?"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06233","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":"1612.06233","created_at":"2026-05-18T00:54:42.854834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06233v1","created_at":"2026-05-18T00:54:42.854834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06233","created_at":"2026-05-18T00:54:42.854834+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJXLN2IVGIVU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJXLN2IVGIVU7UID","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJXLN2IV","created_at":"2026-05-18T12:30:39.010887+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/PJXLN2IVGIVU7UIDMJSUVAV6QB","json":"https://pith.science/pith/PJXLN2IVGIVU7UIDMJSUVAV6QB.json","graph_json":"https://pith.science/api/pith-number/PJXLN2IVGIVU7UIDMJSUVAV6QB/graph.json","events_json":"https://pith.science/api/pith-number/PJXLN2IVGIVU7UIDMJSUVAV6QB/events.json","paper":"https://pith.science/paper/PJXLN2IV"},"agent_actions":{"view_html":"https://pith.science/pith/PJXLN2IVGIVU7UIDMJSUVAV6QB","download_json":"https://pith.science/pith/PJXLN2IVGIVU7UIDMJSUVAV6QB.json","view_paper":"https://pith.science/paper/PJXLN2IV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06233&json=true","fetch_graph":"https://pith.science/api/pith-number/PJXLN2IVGIVU7UIDMJSUVAV6QB/graph.json","fetch_events":"https://pith.science/api/pith-number/PJXLN2IVGIVU7UIDMJSUVAV6QB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJXLN2IVGIVU7UIDMJSUVAV6QB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJXLN2IVGIVU7UIDMJSUVAV6QB/action/storage_attestation","attest_author":"https://pith.science/pith/PJXLN2IVGIVU7UIDMJSUVAV6QB/action/author_attestation","sign_citation":"https://pith.science/pith/PJXLN2IVGIVU7UIDMJSUVAV6QB/action/citation_signature","submit_replication":"https://pith.science/pith/PJXLN2IVGIVU7UIDMJSUVAV6QB/action/replication_record"}},"created_at":"2026-05-18T00:54:42.854834+00:00","updated_at":"2026-05-18T00:54:42.854834+00:00"}