{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Q6TVSCRDD4CEYUVFQQTR2IGOEB","short_pith_number":"pith:Q6TVSCRD","schema_version":"1.0","canonical_sha256":"87a7590a231f044c52a584271d20ce206d9ef47b86be73134ec362647e1d8575","source":{"kind":"arxiv","id":"1605.03149","version":1},"attestation_state":"computed","paper":{"title":"The complexity of downward closure comparisons","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2016-05-10T18:49:09Z","abstract_excerpt":"The downward closure of a language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of every language is regular. Moreover, recent results show that downward closures are computable for quite powerful system models.\n  One advantage of abstracting a language by its downward closure is that then equivalence and inclusion become decidable. In this work, we study the complexity of these two problems. More precisely, we consider the following decision problems: Given languages $K$ and $L$ from classes $\\mathcal{C}$ and $\\mathcal{D}$,"},"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":"1605.03149","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-05-10T18:49:09Z","cross_cats_sorted":[],"title_canon_sha256":"d62baa8e6114dec49916e08786713f3c4aaee176ec323d42a5453938df73a034","abstract_canon_sha256":"ff30f524b42994673a05dee280ca2e05e572b8d633e70fab1ca800d37420fb1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:07.416133Z","signature_b64":"uaaMekyTmjmYd9yg1XPm+DSbPvwRVECvw6x0SE8rt1Y8Xf+KNlQiYFpNUjxFZQzCQkHke+BBvfMm1Yh657oJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87a7590a231f044c52a584271d20ce206d9ef47b86be73134ec362647e1d8575","last_reissued_at":"2026-05-18T01:15:07.415351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:07.415351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of downward closure comparisons","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2016-05-10T18:49:09Z","abstract_excerpt":"The downward closure of a language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of every language is regular. Moreover, recent results show that downward closures are computable for quite powerful system models.\n  One advantage of abstracting a language by its downward closure is that then equivalence and inclusion become decidable. In this work, we study the complexity of these two problems. More precisely, we consider the following decision problems: Given languages $K$ and $L$ from classes $\\mathcal{C}$ and $\\mathcal{D}$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03149","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":"1605.03149","created_at":"2026-05-18T01:15:07.415471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03149v1","created_at":"2026-05-18T01:15:07.415471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03149","created_at":"2026-05-18T01:15:07.415471+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6TVSCRDD4CE","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6TVSCRDD4CEYUVF","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6TVSCRD","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/Q6TVSCRDD4CEYUVFQQTR2IGOEB","json":"https://pith.science/pith/Q6TVSCRDD4CEYUVFQQTR2IGOEB.json","graph_json":"https://pith.science/api/pith-number/Q6TVSCRDD4CEYUVFQQTR2IGOEB/graph.json","events_json":"https://pith.science/api/pith-number/Q6TVSCRDD4CEYUVFQQTR2IGOEB/events.json","paper":"https://pith.science/paper/Q6TVSCRD"},"agent_actions":{"view_html":"https://pith.science/pith/Q6TVSCRDD4CEYUVFQQTR2IGOEB","download_json":"https://pith.science/pith/Q6TVSCRDD4CEYUVFQQTR2IGOEB.json","view_paper":"https://pith.science/paper/Q6TVSCRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03149&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6TVSCRDD4CEYUVFQQTR2IGOEB/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6TVSCRDD4CEYUVFQQTR2IGOEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6TVSCRDD4CEYUVFQQTR2IGOEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6TVSCRDD4CEYUVFQQTR2IGOEB/action/storage_attestation","attest_author":"https://pith.science/pith/Q6TVSCRDD4CEYUVFQQTR2IGOEB/action/author_attestation","sign_citation":"https://pith.science/pith/Q6TVSCRDD4CEYUVFQQTR2IGOEB/action/citation_signature","submit_replication":"https://pith.science/pith/Q6TVSCRDD4CEYUVFQQTR2IGOEB/action/replication_record"}},"created_at":"2026-05-18T01:15:07.415471+00:00","updated_at":"2026-05-18T01:15:07.415471+00:00"}