{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZD6TBO5NPZ66YD3XY66MTKLV3L","short_pith_number":"pith:ZD6TBO5N","schema_version":"1.0","canonical_sha256":"c8fd30bbad7e7dec0f77c7bcc9a975dac45ed38acdb1ab0209596aa8eefee3d7","source":{"kind":"arxiv","id":"1506.06653","version":2},"attestation_state":"computed","paper":{"title":"Solving two-dimensional density classification problem with two probabilistic cellular automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Henryk Fuk\\'s","submitted_at":"2015-06-22T15:35:51Z","abstract_excerpt":"The density classification problem is one of the simplest yet non-trivial computing tasks which seem to be ideally suitable for cellular automata (CA). Unfortunately, there exists no one-dimensional two-state CA which classifies binary strings according to their densities. If, however, in place of simple cells one uses agents which change their behaviour from one rule to another after a fixed number of iterations, the classification can be performed by the traffic rule 184 and the majority rule 232. This two-rule solution cannot be easily generalized to two (or higher) dimensions, because it c"},"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":"1506.06653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2015-06-22T15:35:51Z","cross_cats_sorted":[],"title_canon_sha256":"4737d9d46b0d318415be2fc595fa78a2a0d249e53ae0c68e587a6cac96685763","abstract_canon_sha256":"69e73c8bfb33e570b2f0d3d6d5d4a7e66a2f15c5e9dfe4ced4261ef1af7de44f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:29.506245Z","signature_b64":"k5pT++t6LY2xO8dLlp3JpeQ5uF5v/2bCte+12LPs/Q/VNauSLj/kYxoMKRDfks+D9F65d4nQVoIOAEMzEvCADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8fd30bbad7e7dec0f77c7bcc9a975dac45ed38acdb1ab0209596aa8eefee3d7","last_reissued_at":"2026-05-18T01:20:29.505615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:29.505615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving two-dimensional density classification problem with two probabilistic cellular automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Henryk Fuk\\'s","submitted_at":"2015-06-22T15:35:51Z","abstract_excerpt":"The density classification problem is one of the simplest yet non-trivial computing tasks which seem to be ideally suitable for cellular automata (CA). Unfortunately, there exists no one-dimensional two-state CA which classifies binary strings according to their densities. If, however, in place of simple cells one uses agents which change their behaviour from one rule to another after a fixed number of iterations, the classification can be performed by the traffic rule 184 and the majority rule 232. This two-rule solution cannot be easily generalized to two (or higher) dimensions, because it c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06653","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":"1506.06653","created_at":"2026-05-18T01:20:29.505729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06653v2","created_at":"2026-05-18T01:20:29.505729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06653","created_at":"2026-05-18T01:20:29.505729+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZD6TBO5NPZ66","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZD6TBO5NPZ66YD3X","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZD6TBO5N","created_at":"2026-05-18T12:29:52.810259+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/ZD6TBO5NPZ66YD3XY66MTKLV3L","json":"https://pith.science/pith/ZD6TBO5NPZ66YD3XY66MTKLV3L.json","graph_json":"https://pith.science/api/pith-number/ZD6TBO5NPZ66YD3XY66MTKLV3L/graph.json","events_json":"https://pith.science/api/pith-number/ZD6TBO5NPZ66YD3XY66MTKLV3L/events.json","paper":"https://pith.science/paper/ZD6TBO5N"},"agent_actions":{"view_html":"https://pith.science/pith/ZD6TBO5NPZ66YD3XY66MTKLV3L","download_json":"https://pith.science/pith/ZD6TBO5NPZ66YD3XY66MTKLV3L.json","view_paper":"https://pith.science/paper/ZD6TBO5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06653&json=true","fetch_graph":"https://pith.science/api/pith-number/ZD6TBO5NPZ66YD3XY66MTKLV3L/graph.json","fetch_events":"https://pith.science/api/pith-number/ZD6TBO5NPZ66YD3XY66MTKLV3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZD6TBO5NPZ66YD3XY66MTKLV3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZD6TBO5NPZ66YD3XY66MTKLV3L/action/storage_attestation","attest_author":"https://pith.science/pith/ZD6TBO5NPZ66YD3XY66MTKLV3L/action/author_attestation","sign_citation":"https://pith.science/pith/ZD6TBO5NPZ66YD3XY66MTKLV3L/action/citation_signature","submit_replication":"https://pith.science/pith/ZD6TBO5NPZ66YD3XY66MTKLV3L/action/replication_record"}},"created_at":"2026-05-18T01:20:29.505729+00:00","updated_at":"2026-05-18T01:20:29.505729+00:00"}