{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7OSUMYLV3YGJBYVE35U6FRBHVE","short_pith_number":"pith:7OSUMYLV","schema_version":"1.0","canonical_sha256":"fba5466175de0c90e2a4df69e2c427a9267077c4cddeea400a1b2926c3a174d5","source":{"kind":"arxiv","id":"1902.04957","version":1},"attestation_state":"computed","paper":{"title":"Separation and covering for group based concatenation hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marc Zeitoun, Thomas Place","submitted_at":"2019-02-13T15:44:43Z","abstract_excerpt":"Concatenation hierarchies are classifications of regular languages. All such hierarchies are built through the same construction process: start from an initial class of languages and build new levels using two generic operations. Concatenation hierarchies have gathered a lot of interest since the 70s, thanks to an alternate logical definition: each concatenation hierarchy is the quantification alternation hierarchy within a variant of first-order logic over words.\n  Our goal is to understand such hierarchies. We look at two decision problems: membership and separation. For a class of languages"},"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":"1902.04957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-13T15:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"24eb195bcfe0dc39841f58490cc2e196f0676ed22ee15a365289efba067edcd4","abstract_canon_sha256":"16788cd88fa0bbda1d9aae8290e418df824e1ccee139cc04792a3484f1666a79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:03.798543Z","signature_b64":"mTo31Ot5mwY6bWizcAkRm7jSMQWRKS9OQMe4a/HfWtbfJ1CkV4ubW4f5gHxF1mFUqGB1cD/9JA9VTiaVgw6vBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba5466175de0c90e2a4df69e2c427a9267077c4cddeea400a1b2926c3a174d5","last_reissued_at":"2026-05-17T23:54:03.798076Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:03.798076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separation and covering for group based concatenation hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marc Zeitoun, Thomas Place","submitted_at":"2019-02-13T15:44:43Z","abstract_excerpt":"Concatenation hierarchies are classifications of regular languages. All such hierarchies are built through the same construction process: start from an initial class of languages and build new levels using two generic operations. Concatenation hierarchies have gathered a lot of interest since the 70s, thanks to an alternate logical definition: each concatenation hierarchy is the quantification alternation hierarchy within a variant of first-order logic over words.\n  Our goal is to understand such hierarchies. We look at two decision problems: membership and separation. For a class of languages"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04957","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":"1902.04957","created_at":"2026-05-17T23:54:03.798151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04957v1","created_at":"2026-05-17T23:54:03.798151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04957","created_at":"2026-05-17T23:54:03.798151+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OSUMYLV3YGJ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OSUMYLV3YGJBYVE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OSUMYLV","created_at":"2026-05-18T12:33:12.712433+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/7OSUMYLV3YGJBYVE35U6FRBHVE","json":"https://pith.science/pith/7OSUMYLV3YGJBYVE35U6FRBHVE.json","graph_json":"https://pith.science/api/pith-number/7OSUMYLV3YGJBYVE35U6FRBHVE/graph.json","events_json":"https://pith.science/api/pith-number/7OSUMYLV3YGJBYVE35U6FRBHVE/events.json","paper":"https://pith.science/paper/7OSUMYLV"},"agent_actions":{"view_html":"https://pith.science/pith/7OSUMYLV3YGJBYVE35U6FRBHVE","download_json":"https://pith.science/pith/7OSUMYLV3YGJBYVE35U6FRBHVE.json","view_paper":"https://pith.science/paper/7OSUMYLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04957&json=true","fetch_graph":"https://pith.science/api/pith-number/7OSUMYLV3YGJBYVE35U6FRBHVE/graph.json","fetch_events":"https://pith.science/api/pith-number/7OSUMYLV3YGJBYVE35U6FRBHVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OSUMYLV3YGJBYVE35U6FRBHVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OSUMYLV3YGJBYVE35U6FRBHVE/action/storage_attestation","attest_author":"https://pith.science/pith/7OSUMYLV3YGJBYVE35U6FRBHVE/action/author_attestation","sign_citation":"https://pith.science/pith/7OSUMYLV3YGJBYVE35U6FRBHVE/action/citation_signature","submit_replication":"https://pith.science/pith/7OSUMYLV3YGJBYVE35U6FRBHVE/action/replication_record"}},"created_at":"2026-05-17T23:54:03.798151+00:00","updated_at":"2026-05-17T23:54:03.798151+00:00"}