{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LTEXXVFEBJAJN7N5SWJO4Q3THI","short_pith_number":"pith:LTEXXVFE","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"},"canonical_sha256":"5cc97bd4a40a4096fdbd9592ee43733a1e3670b01f77ff443c523fbf40543ca0","source":{"kind":"arxiv","id":"1112.3758","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3758","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3758v2","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3758","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"LTEXXVFEBJAJ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LTEXXVFEBJAJN7N5","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LTEXXVFE","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LTEXXVFEBJAJN7N5SWJO4Q3THI","target":"record","payload":{"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"},"canonical_sha256":"5cc97bd4a40a4096fdbd9592ee43733a1e3670b01f77ff443c523fbf40543ca0","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"},"source_kind":"arxiv","source_id":"1112.3758","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybS6IppyHMpasJn04YDLGmA47iEvTxP5l1b1Kv3l/g6frZtBFcKubVFeFiL8OWNmoUNzffMHS3eNK2hiomdPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:20:46.091113Z"},"content_sha256":"f2343160e576ef86e20cf68f4dc56c2cf4f2a12bdfa15618885b70505d2762de","schema_version":"1.0","event_id":"sha256:f2343160e576ef86e20cf68f4dc56c2cf4f2a12bdfa15618885b70505d2762de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LTEXXVFEBJAJN7N5SWJO4Q3THI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00iA+tcrGlG0Hmk/5IEjM623vZFDjR+5DR2NetLcKH5aEXzsD/1+aGnBAIjxuYjj4YMAYPkWVOpfrp+OjVCtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:20:46.091817Z"},"content_sha256":"bde852fb404692e7f06ac6a7a2d99a29c57f64e7bb10d7a5a43fe2d62af97b24","schema_version":"1.0","event_id":"sha256:bde852fb404692e7f06ac6a7a2d99a29c57f64e7bb10d7a5a43fe2d62af97b24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/bundle.json","state_url":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T22:20:46Z","links":{"resolver":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI","bundle":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/bundle.json","state":"https://pith.science/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTEXXVFEBJAJN7N5SWJO4Q3THI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LTEXXVFEBJAJN7N5SWJO4Q3THI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"643fddd5b000a1dc1c855538571a31a6065fc451b44de00fca700bc31ec3ce94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-16T10:59:14Z","title_canon_sha256":"2756087f8ba6a0752db8dfa9069e9086df908953d3a5f82f2cb4e530dedd73cd"},"schema_version":"1.0","source":{"id":"1112.3758","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3758","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3758v2","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3758","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"LTEXXVFEBJAJ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LTEXXVFEBJAJN7N5","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LTEXXVFE","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:bde852fb404692e7f06ac6a7a2d99a29c57f64e7bb10d7a5a43fe2d62af97b24","target":"graph","created_at":"2026-05-18T03:59:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Hamoon Mousavi, Jeffrey Shallit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-16T10:59:14Z","title":"Filtrations of Formal Languages by Arithmetic Progressions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3758","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f2343160e576ef86e20cf68f4dc56c2cf4f2a12bdfa15618885b70505d2762de","target":"record","created_at":"2026-05-18T03:59:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"643fddd5b000a1dc1c855538571a31a6065fc451b44de00fca700bc31ec3ce94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-16T10:59:14Z","title_canon_sha256":"2756087f8ba6a0752db8dfa9069e9086df908953d3a5f82f2cb4e530dedd73cd"},"schema_version":"1.0","source":{"id":"1112.3758","kind":"arxiv","version":2}},"canonical_sha256":"5cc97bd4a40a4096fdbd9592ee43733a1e3670b01f77ff443c523fbf40543ca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cc97bd4a40a4096fdbd9592ee43733a1e3670b01f77ff443c523fbf40543ca0","first_computed_at":"2026-05-18T03:59:01.294753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:01.294753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bhhUP4eaAQ0bvZY5GSggXQcwwwK03eJTjymBHm3t8WXD/bq4LP64XGssJcaMDlmA510HK1OYvQhQJLHihE6jCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:01.295518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3758","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2343160e576ef86e20cf68f4dc56c2cf4f2a12bdfa15618885b70505d2762de","sha256:bde852fb404692e7f06ac6a7a2d99a29c57f64e7bb10d7a5a43fe2d62af97b24"],"state_sha256":"c6a0746c1649018ea4e33c75aac33ff7c70bd96864f74c96a1437f247f22616b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKM2Zor9XSvTJUJIZUMV6gxzMw33kh+JlkwJ5673EhVUfXaQgzRewR4kI52lYRWPSb6l2Tj9Vbjri99/sKg5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:20:46.095405Z","bundle_sha256":"7d500ce326353e2a467caee8ca3304c817e01fa9e274712a528b82b27b4d0f85"}}