{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WNYRFUWD4HUYC6OVYPH5BLX7BG","short_pith_number":"pith:WNYRFUWD","schema_version":"1.0","canonical_sha256":"b37112d2c3e1e98179d5c3cfd0aeff0986447b5ab07d8fbe97c685ae41afc50a","source":{"kind":"arxiv","id":"1804.08883","version":5},"attestation_state":"computed","paper":{"title":"Covering and separation for logical fragments with modular predicates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Pascal Weil, Thomas Place, Varun Ramanathan","submitted_at":"2018-04-24T08:03:58Z","abstract_excerpt":"For every class $\\mathscr{C}$ of word languages, one may associate a decision problem called $\\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\\mathscr{C}$ containing the first language, while being disjoint from the second one. Usually, finding an algorithm deciding $\\mathscr{C}$-separation yields a deep insight on $\\mathscr{C}$.\n  We consider classes defined by fragments of first-order logic. Given such a fragment, one may often build a larger class by adding more predicates to its signature. In the paper, we investigate the operation of"},"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":"1804.08883","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-04-24T08:03:58Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"722d3d664270ec8e34497646e6c0cd0dfe697f52c6a34bc489e8e1b7887709ba","abstract_canon_sha256":"506f24fc5fd8dd58d51421e9c88fad84f46f35b7b182d8ca983208df13c5b0b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:24.084451Z","signature_b64":"KSDiHdLdU1m2j47H1Eckg/x3CL6D3KFM8/LcKhFww72EhWaAj/yj2n2sQPSmAZW+WtBUG060zy6GJ0bHexGUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b37112d2c3e1e98179d5c3cfd0aeff0986447b5ab07d8fbe97c685ae41afc50a","last_reissued_at":"2026-07-05T06:23:24.084062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:24.084062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering and separation for logical fragments with modular predicates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Pascal Weil, Thomas Place, Varun Ramanathan","submitted_at":"2018-04-24T08:03:58Z","abstract_excerpt":"For every class $\\mathscr{C}$ of word languages, one may associate a decision problem called $\\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\\mathscr{C}$ containing the first language, while being disjoint from the second one. Usually, finding an algorithm deciding $\\mathscr{C}$-separation yields a deep insight on $\\mathscr{C}$.\n  We consider classes defined by fragments of first-order logic. Given such a fragment, one may often build a larger class by adding more predicates to its signature. In the paper, we investigate the operation of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08883","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1804.08883/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1804.08883","created_at":"2026-07-05T06:23:24.084126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08883v5","created_at":"2026-07-05T06:23:24.084126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08883","created_at":"2026-07-05T06:23:24.084126+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNYRFUWD4HUY","created_at":"2026-07-05T06:23:24.084126+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNYRFUWD4HUYC6OV","created_at":"2026-07-05T06:23:24.084126+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNYRFUWD","created_at":"2026-07-05T06:23:24.084126+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/WNYRFUWD4HUYC6OVYPH5BLX7BG","json":"https://pith.science/pith/WNYRFUWD4HUYC6OVYPH5BLX7BG.json","graph_json":"https://pith.science/api/pith-number/WNYRFUWD4HUYC6OVYPH5BLX7BG/graph.json","events_json":"https://pith.science/api/pith-number/WNYRFUWD4HUYC6OVYPH5BLX7BG/events.json","paper":"https://pith.science/paper/WNYRFUWD"},"agent_actions":{"view_html":"https://pith.science/pith/WNYRFUWD4HUYC6OVYPH5BLX7BG","download_json":"https://pith.science/pith/WNYRFUWD4HUYC6OVYPH5BLX7BG.json","view_paper":"https://pith.science/paper/WNYRFUWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08883&json=true","fetch_graph":"https://pith.science/api/pith-number/WNYRFUWD4HUYC6OVYPH5BLX7BG/graph.json","fetch_events":"https://pith.science/api/pith-number/WNYRFUWD4HUYC6OVYPH5BLX7BG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNYRFUWD4HUYC6OVYPH5BLX7BG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNYRFUWD4HUYC6OVYPH5BLX7BG/action/storage_attestation","attest_author":"https://pith.science/pith/WNYRFUWD4HUYC6OVYPH5BLX7BG/action/author_attestation","sign_citation":"https://pith.science/pith/WNYRFUWD4HUYC6OVYPH5BLX7BG/action/citation_signature","submit_replication":"https://pith.science/pith/WNYRFUWD4HUYC6OVYPH5BLX7BG/action/replication_record"}},"created_at":"2026-07-05T06:23:24.084126+00:00","updated_at":"2026-07-05T06:23:24.084126+00:00"}