{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:LDZWOOKJI7FSSYDGGQHHMOFMIV","short_pith_number":"pith:LDZWOOKJ","schema_version":"1.0","canonical_sha256":"58f367394947cb296066340e7638ac4578ec1dad6d6eb2aca45a6c4fbf4280af","source":{"kind":"arxiv","id":"cs/0410017","version":1},"attestation_state":"computed","paper":{"title":"Automated Pattern Detection--An Algorithm for Constructing Optimally Synchronizing Multi-Regular Language Filters","license":"","headline":"","cross_cats":["cond-mat.stat-mech","cs.CL","cs.DS","cs.IR","cs.LG","nlin.AO","nlin.CG","nlin.PS","physics.comp-ph","q-bio.GN"],"primary_cat":"cs.CV","authors_text":"Carl S. McTague, James P. Crutchfield","submitted_at":"2004-10-07T17:20:56Z","abstract_excerpt":"In the computational-mechanics structural analysis of one-dimensional cellular automata the following automata-theoretic analogue of the \\emph{change-point problem} from time series analysis arises: \\emph{Given a string $\\sigma$ and a collection $\\{\\mc{D}_i\\}$ of finite automata, identify the regions of $\\sigma$ that belong to each $\\mc{D}_i$ and, in particular, the boundaries separating them.} We present two methods for solving this \\emph{multi-regular language filtering problem}. The first, although providing the ideal solution, requires a stack, has a worst-case compute time that grows quad"},"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":"cs/0410017","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CV","submitted_at":"2004-10-07T17:20:56Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CL","cs.DS","cs.IR","cs.LG","nlin.AO","nlin.CG","nlin.PS","physics.comp-ph","q-bio.GN"],"title_canon_sha256":"8087db48f8eeaeb79a39ab12070576ad874327b96930faf0746091d60856f4e2","abstract_canon_sha256":"ae6f7ca8e342495ad8690715864782237447b2c36f9fec2db080e21bd589c574"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:49.221901Z","signature_b64":"yrGbRjHbN0LtFO4jBSG/NB6HFSUz/i/esLL84v2QaB/HpH5vSZHSGiGwZfnK35mVaFgCwXWAZAzEAvOsL97kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58f367394947cb296066340e7638ac4578ec1dad6d6eb2aca45a6c4fbf4280af","last_reissued_at":"2026-05-18T01:06:49.221148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:49.221148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Pattern Detection--An Algorithm for Constructing Optimally Synchronizing Multi-Regular Language Filters","license":"","headline":"","cross_cats":["cond-mat.stat-mech","cs.CL","cs.DS","cs.IR","cs.LG","nlin.AO","nlin.CG","nlin.PS","physics.comp-ph","q-bio.GN"],"primary_cat":"cs.CV","authors_text":"Carl S. McTague, James P. Crutchfield","submitted_at":"2004-10-07T17:20:56Z","abstract_excerpt":"In the computational-mechanics structural analysis of one-dimensional cellular automata the following automata-theoretic analogue of the \\emph{change-point problem} from time series analysis arises: \\emph{Given a string $\\sigma$ and a collection $\\{\\mc{D}_i\\}$ of finite automata, identify the regions of $\\sigma$ that belong to each $\\mc{D}_i$ and, in particular, the boundaries separating them.} We present two methods for solving this \\emph{multi-regular language filtering problem}. The first, although providing the ideal solution, requires a stack, has a worst-case compute time that grows quad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0410017","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":"cs/0410017","created_at":"2026-05-18T01:06:49.221277+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0410017v1","created_at":"2026-05-18T01:06:49.221277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0410017","created_at":"2026-05-18T01:06:49.221277+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDZWOOKJI7FS","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDZWOOKJI7FSSYDG","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDZWOOKJ","created_at":"2026-05-18T12:25:52.687210+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/LDZWOOKJI7FSSYDGGQHHMOFMIV","json":"https://pith.science/pith/LDZWOOKJI7FSSYDGGQHHMOFMIV.json","graph_json":"https://pith.science/api/pith-number/LDZWOOKJI7FSSYDGGQHHMOFMIV/graph.json","events_json":"https://pith.science/api/pith-number/LDZWOOKJI7FSSYDGGQHHMOFMIV/events.json","paper":"https://pith.science/paper/LDZWOOKJ"},"agent_actions":{"view_html":"https://pith.science/pith/LDZWOOKJI7FSSYDGGQHHMOFMIV","download_json":"https://pith.science/pith/LDZWOOKJI7FSSYDGGQHHMOFMIV.json","view_paper":"https://pith.science/paper/LDZWOOKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0410017&json=true","fetch_graph":"https://pith.science/api/pith-number/LDZWOOKJI7FSSYDGGQHHMOFMIV/graph.json","fetch_events":"https://pith.science/api/pith-number/LDZWOOKJI7FSSYDGGQHHMOFMIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDZWOOKJI7FSSYDGGQHHMOFMIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDZWOOKJI7FSSYDGGQHHMOFMIV/action/storage_attestation","attest_author":"https://pith.science/pith/LDZWOOKJI7FSSYDGGQHHMOFMIV/action/author_attestation","sign_citation":"https://pith.science/pith/LDZWOOKJI7FSSYDGGQHHMOFMIV/action/citation_signature","submit_replication":"https://pith.science/pith/LDZWOOKJI7FSSYDGGQHHMOFMIV/action/replication_record"}},"created_at":"2026-05-18T01:06:49.221277+00:00","updated_at":"2026-05-18T01:06:49.221277+00:00"}