{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EXKTXEXCODN42NVX3H5JXGN5L3","short_pith_number":"pith:EXKTXEXC","canonical_record":{"source":{"id":"1508.05371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2015-08-19T14:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"03f3f1cf7aa7c7cb915d890a0583e9d553e34336f17819343bc1de00ba4cf0fb","abstract_canon_sha256":"25731d2b2731b5ef7a2757b9cd94162f29a719a825538763c4483012ab5c572e"},"schema_version":"1.0"},"canonical_sha256":"25d53b92e270dbcd36b7d9fa9b99bd5eefff73b7783a4bd23128fd929f055e5b","source":{"kind":"arxiv","id":"1508.05371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05371","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05371v1","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05371","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"EXKTXEXCODN4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EXKTXEXCODN42NVX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EXKTXEXC","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EXKTXEXCODN42NVX3H5JXGN5L3","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2015-08-19T14:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"03f3f1cf7aa7c7cb915d890a0583e9d553e34336f17819343bc1de00ba4cf0fb","abstract_canon_sha256":"25731d2b2731b5ef7a2757b9cd94162f29a719a825538763c4483012ab5c572e"},"schema_version":"1.0"},"canonical_sha256":"25d53b92e270dbcd36b7d9fa9b99bd5eefff73b7783a4bd23128fd929f055e5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:40.659536Z","signature_b64":"GRbP2ws8iZYJpPMgNjqVfDXqrOdWuLd5JTMNEG9UYkN0S+b+0yv4+jmUOau/FHSxi81tMiYJNp552eXCQaIyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25d53b92e270dbcd36b7d9fa9b99bd5eefff73b7783a4bd23128fd929f055e5b","last_reissued_at":"2026-05-18T01:21:40.658886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:40.658886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05371","source_version":1,"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-18T01:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXWusD2dYUGFbSi8A5ZaepDvBIp6RHX7WI4auUnvs3PVBFYxcVxict88Hc7KVm1z7JBrOYKI2OftX8/ZVjRtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:57:56.855683Z"},"content_sha256":"5c415fe80df8d57a8f5ab3fe8b5e2131d72b55ed63fc8c556395dd38702ade90","schema_version":"1.0","event_id":"sha256:5c415fe80df8d57a8f5ab3fe8b5e2131d72b55ed63fc8c556395dd38702ade90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EXKTXEXCODN42NVX3H5JXGN5L3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Cellular Automata and Pattern Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Biswanath Sethi, Souvik Roy, Sukanta Das","submitted_at":"2015-08-19T14:47:15Z","abstract_excerpt":"This paper designs an efficient two-class pattern classifier utilizing asynchronous cellular automata (ACAs). The two-state three-neighborhood one-dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern classification. To design the classifier, we first identify a set of ACAs that always converge to fixed points from any seeds with following properties - (1) each ACA should have at least two but not huge number of fixed point attractors, and (2) the convergence time of these ACAs are not to be exponential. In order to address the first issue, we propose a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05371","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"},"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-18T01:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcWrPkRRKG7GD/3pWCPOqR1Ts95ujC+Leb9CO+Mn9anKK3PmvBqkNWavGYA+FbZiPXu6IUKtT8CIP7oILqT5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:57:56.856391Z"},"content_sha256":"fc02fcf01a7f3a318143398327ee13b0cefddd1ffced4b0c5eaed87923a4dd37","schema_version":"1.0","event_id":"sha256:fc02fcf01a7f3a318143398327ee13b0cefddd1ffced4b0c5eaed87923a4dd37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXKTXEXCODN42NVX3H5JXGN5L3/bundle.json","state_url":"https://pith.science/pith/EXKTXEXCODN42NVX3H5JXGN5L3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXKTXEXCODN42NVX3H5JXGN5L3/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-05T21:57:56Z","links":{"resolver":"https://pith.science/pith/EXKTXEXCODN42NVX3H5JXGN5L3","bundle":"https://pith.science/pith/EXKTXEXCODN42NVX3H5JXGN5L3/bundle.json","state":"https://pith.science/pith/EXKTXEXCODN42NVX3H5JXGN5L3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXKTXEXCODN42NVX3H5JXGN5L3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EXKTXEXCODN42NVX3H5JXGN5L3","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":"25731d2b2731b5ef7a2757b9cd94162f29a719a825538763c4483012ab5c572e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2015-08-19T14:47:15Z","title_canon_sha256":"03f3f1cf7aa7c7cb915d890a0583e9d553e34336f17819343bc1de00ba4cf0fb"},"schema_version":"1.0","source":{"id":"1508.05371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05371","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05371v1","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05371","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"EXKTXEXCODN4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EXKTXEXCODN42NVX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EXKTXEXC","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:fc02fcf01a7f3a318143398327ee13b0cefddd1ffced4b0c5eaed87923a4dd37","target":"graph","created_at":"2026-05-18T01:21:40Z","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":"This paper designs an efficient two-class pattern classifier utilizing asynchronous cellular automata (ACAs). The two-state three-neighborhood one-dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern classification. To design the classifier, we first identify a set of ACAs that always converge to fixed points from any seeds with following properties - (1) each ACA should have at least two but not huge number of fixed point attractors, and (2) the convergence time of these ACAs are not to be exponential. In order to address the first issue, we propose a ","authors_text":"Biswanath Sethi, Souvik Roy, Sukanta Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2015-08-19T14:47:15Z","title":"Asynchronous Cellular Automata and Pattern Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05371","kind":"arxiv","version":1},"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:5c415fe80df8d57a8f5ab3fe8b5e2131d72b55ed63fc8c556395dd38702ade90","target":"record","created_at":"2026-05-18T01:21:40Z","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":"25731d2b2731b5ef7a2757b9cd94162f29a719a825538763c4483012ab5c572e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2015-08-19T14:47:15Z","title_canon_sha256":"03f3f1cf7aa7c7cb915d890a0583e9d553e34336f17819343bc1de00ba4cf0fb"},"schema_version":"1.0","source":{"id":"1508.05371","kind":"arxiv","version":1}},"canonical_sha256":"25d53b92e270dbcd36b7d9fa9b99bd5eefff73b7783a4bd23128fd929f055e5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25d53b92e270dbcd36b7d9fa9b99bd5eefff73b7783a4bd23128fd929f055e5b","first_computed_at":"2026-05-18T01:21:40.658886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:40.658886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRbP2ws8iZYJpPMgNjqVfDXqrOdWuLd5JTMNEG9UYkN0S+b+0yv4+jmUOau/FHSxi81tMiYJNp552eXCQaIyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:40.659536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c415fe80df8d57a8f5ab3fe8b5e2131d72b55ed63fc8c556395dd38702ade90","sha256:fc02fcf01a7f3a318143398327ee13b0cefddd1ffced4b0c5eaed87923a4dd37"],"state_sha256":"90d7351f1a38d61d54914d79e4249ef5a11fe2e1da9b2ba51fab46a3c10b9a57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Yj3ESUtjQWrjbGGIkS6V1pvcqtuJDXqTHg7B83tP6hmNApjkjcMnKT57GA/m3BcNNfsx7nAiqv9/yyOlWlqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:57:56.860187Z","bundle_sha256":"a2702c76d6746a2adca6b1e4f03e9071458dff5e4e444b4237eb367ca6e90185"}}