{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LTEXXVFEBJAJN7N5SWJO4Q3THI","short_pith_number":"pith:LTEXXVFE","schema_version":"1.0","canonical_sha256":"5cc97bd4a40a4096fdbd9592ee43733a1e3670b01f77ff443c523fbf40543ca0","source":{"kind":"arxiv","id":"1112.3758","version":2},"attestation_state":"computed","paper":{"title":"Filtrations of Formal Languages by Arithmetic Progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hamoon Mousavi, Jeffrey Shallit","submitted_at":"2011-12-16T10:59:14Z","abstract_excerpt":"A filtration of a formal language L by a sequence s maps L to the set of words formed by taking the letters of words of L indexed only by s. We consider the languages resulting from filtering by all arithmetic progressions. If L is regular, it is easy to see that only finitely many distinct languages result. By contrast, there exist CFL's that give infinitely many distinct languages as a result. We use our technique to show that the operation diag, which extracts the diagonal of words of square length arranged in a square array, preserves regularity but does not preserve context-freeness."},"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":"1112.3758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-16T10:59:14Z","cross_cats_sorted":[],"title_canon_sha256":"2756087f8ba6a0752db8dfa9069e9086df908953d3a5f82f2cb4e530dedd73cd","abstract_canon_sha256":"643fddd5b000a1dc1c855538571a31a6065fc451b44de00fca700bc31ec3ce94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:01.295518Z","signature_b64":"bhhUP4eaAQ0bvZY5GSggXQcwwwK03eJTjymBHm3t8WXD/bq4LP64XGssJcaMDlmA510HK1OYvQhQJLHihE6jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cc97bd4a40a4096fdbd9592ee43733a1e3670b01f77ff443c523fbf40543ca0","last_reissued_at":"2026-05-18T03:59:01.294753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:01.294753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Filtrations of Formal Languages by Arithmetic Progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hamoon Mousavi, Jeffrey Shallit","submitted_at":"2011-12-16T10:59:14Z","abstract_excerpt":"A filtration of a formal language L by a sequence s maps L to the set of words formed by taking the letters of words of L indexed only by s. We consider the languages resulting from filtering by all arithmetic progressions. If L is regular, it is easy to see that only finitely many distinct languages result. By contrast, there exist CFL's that give infinitely many distinct languages as a result. We use our technique to show that the operation diag, which extracts the diagonal of words of square length arranged in a square array, preserves regularity but does not preserve context-freeness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3758","kind":"arxiv","version":2},"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":"1112.3758","created_at":"2026-05-18T03:59:01.294860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3758v2","created_at":"2026-05-18T03:59:01.294860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3758","created_at":"2026-05-18T03:59:01.294860+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTEXXVFEBJAJ","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTEXXVFEBJAJN7N5","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTEXXVFE","created_at":"2026-05-18T12:26:34.985390+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/LTEXXVFEBJAJN7N5SWJO4Q3THI","json":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI.json","graph_json":"https://pith.science/api/pith-number/LTEXXVFEBJAJN7N5SWJO4Q3THI/graph.json","events_json":"https://pith.science/api/pith-number/LTEXXVFEBJAJN7N5SWJO4Q3THI/events.json","paper":"https://pith.science/paper/LTEXXVFE"},"agent_actions":{"view_html":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI","download_json":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI.json","view_paper":"https://pith.science/paper/LTEXXVFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3758&json=true","fetch_graph":"https://pith.science/api/pith-number/LTEXXVFEBJAJN7N5SWJO4Q3THI/graph.json","fetch_events":"https://pith.science/api/pith-number/LTEXXVFEBJAJN7N5SWJO4Q3THI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/action/storage_attestation","attest_author":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/action/author_attestation","sign_citation":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/action/citation_signature","submit_replication":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/action/replication_record"}},"created_at":"2026-05-18T03:59:01.294860+00:00","updated_at":"2026-05-18T03:59:01.294860+00:00"}