{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NGU25WEXJRWQLMSB44MHPFEAHF","short_pith_number":"pith:NGU25WEX","schema_version":"1.0","canonical_sha256":"69a9aed8974c6d05b241e718779480396f179fccb76ea8a76ec7ec38d1f4337b","source":{"kind":"arxiv","id":"1802.06141","version":1},"attestation_state":"computed","paper":{"title":"A generic characterization of Pol(C)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marc Zeitoun, Thomas Place","submitted_at":"2018-02-16T21:57:41Z","abstract_excerpt":"We investigate the polynomial closure operation (C -> Pol(C)) defined on classes of regular languages. We present an interesting and useful connection relating the separation problem for the class C and the membership problem for it polynomial closure Pol(C). This connection is formulated as an algebraic characterization of Pol(C) which holds when C is an arbitrary \\pvari of regular languages and whose statement is parameterized by C-separation. Its main application is an effective reduction from Pol(C)-membership to C-separation. Thus, as soon as one designs a C-separation algorithm, this yie"},"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":"1802.06141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-02-16T21:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"f1f65f2fd5a068daace112442a9ac6ae5600bcbc74b30f8b68efabc706709172","abstract_canon_sha256":"23ec7ee7de3a993653eb6fc2e046f78d80c27f17e07d3187377bb6bc24ac7991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:04.338535Z","signature_b64":"TWpx3I0mNTyGcOpwGMceJe/wwF1HC+P7rLNCJQJ8pZSAcolTkJ7sSgenfz3ZROefHg43/i7aVbqqjH67XK8iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69a9aed8974c6d05b241e718779480396f179fccb76ea8a76ec7ec38d1f4337b","last_reissued_at":"2026-05-18T00:23:04.337808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:04.337808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generic characterization of Pol(C)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marc Zeitoun, Thomas Place","submitted_at":"2018-02-16T21:57:41Z","abstract_excerpt":"We investigate the polynomial closure operation (C -> Pol(C)) defined on classes of regular languages. We present an interesting and useful connection relating the separation problem for the class C and the membership problem for it polynomial closure Pol(C). This connection is formulated as an algebraic characterization of Pol(C) which holds when C is an arbitrary \\pvari of regular languages and whose statement is parameterized by C-separation. Its main application is an effective reduction from Pol(C)-membership to C-separation. Thus, as soon as one designs a C-separation algorithm, this yie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06141","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":"1802.06141","created_at":"2026-05-18T00:23:04.337917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06141v1","created_at":"2026-05-18T00:23:04.337917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06141","created_at":"2026-05-18T00:23:04.337917+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGU25WEXJRWQ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGU25WEXJRWQLMSB","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGU25WEX","created_at":"2026-05-18T12:32:40.477152+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/NGU25WEXJRWQLMSB44MHPFEAHF","json":"https://pith.science/pith/NGU25WEXJRWQLMSB44MHPFEAHF.json","graph_json":"https://pith.science/api/pith-number/NGU25WEXJRWQLMSB44MHPFEAHF/graph.json","events_json":"https://pith.science/api/pith-number/NGU25WEXJRWQLMSB44MHPFEAHF/events.json","paper":"https://pith.science/paper/NGU25WEX"},"agent_actions":{"view_html":"https://pith.science/pith/NGU25WEXJRWQLMSB44MHPFEAHF","download_json":"https://pith.science/pith/NGU25WEXJRWQLMSB44MHPFEAHF.json","view_paper":"https://pith.science/paper/NGU25WEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06141&json=true","fetch_graph":"https://pith.science/api/pith-number/NGU25WEXJRWQLMSB44MHPFEAHF/graph.json","fetch_events":"https://pith.science/api/pith-number/NGU25WEXJRWQLMSB44MHPFEAHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGU25WEXJRWQLMSB44MHPFEAHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGU25WEXJRWQLMSB44MHPFEAHF/action/storage_attestation","attest_author":"https://pith.science/pith/NGU25WEXJRWQLMSB44MHPFEAHF/action/author_attestation","sign_citation":"https://pith.science/pith/NGU25WEXJRWQLMSB44MHPFEAHF/action/citation_signature","submit_replication":"https://pith.science/pith/NGU25WEXJRWQLMSB44MHPFEAHF/action/replication_record"}},"created_at":"2026-05-18T00:23:04.337917+00:00","updated_at":"2026-05-18T00:23:04.337917+00:00"}