{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7BWREESHGVXI6Y3OCE2U7SXJVV","short_pith_number":"pith:7BWREESH","schema_version":"1.0","canonical_sha256":"f86d121247356e8f636e11354fcae9ad5b460f66d868218687f825bacfe4845a","source":{"kind":"arxiv","id":"1409.3588","version":2},"attestation_state":"computed","paper":{"title":"Density Classification Quality of the Traffic-majority Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Markus Redeker","submitted_at":"2014-09-11T20:32:37Z","abstract_excerpt":"The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular automata have been found. One of them is a set of stochastic transition rules depending on a parameter $\\eta$, the traffic-majority rules.\n  Here I derive a simplified model for these cellular automata. It is valid for a subset of the initial configurations and uses random walks and generating functions. I compare its prediction with computer simulations and show that it expresses recognition quality and time correct"},"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":"1409.3588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2014-09-11T20:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"c37c1b6bf1266b1395c2992022d73b16bd2aedaf5bddc85de40cd83edafb6fbf","abstract_canon_sha256":"77d43730361ab4050a167fc688fd8882a41b12fb23d4b04dd794789433c2b78b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:14.653709Z","signature_b64":"6zdh/UR4XZJHkWr7gk5d0BJBkaHDTepKOup983YH+amskKcCp8L+SKWdPowtNiMlvmxqdbMFDhQ3KON44HnsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f86d121247356e8f636e11354fcae9ad5b460f66d868218687f825bacfe4845a","last_reissued_at":"2026-05-17T23:40:14.653011Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:14.653011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density Classification Quality of the Traffic-majority Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Markus Redeker","submitted_at":"2014-09-11T20:32:37Z","abstract_excerpt":"The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular automata have been found. One of them is a set of stochastic transition rules depending on a parameter $\\eta$, the traffic-majority rules.\n  Here I derive a simplified model for these cellular automata. It is valid for a subset of the initial configurations and uses random walks and generating functions. I compare its prediction with computer simulations and show that it expresses recognition quality and time correct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3588","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":"1409.3588","created_at":"2026-05-17T23:40:14.653126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3588v2","created_at":"2026-05-17T23:40:14.653126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3588","created_at":"2026-05-17T23:40:14.653126+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BWREESHGVXI","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BWREESHGVXI6Y3O","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BWREESH","created_at":"2026-05-18T12:28:16.859392+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/7BWREESHGVXI6Y3OCE2U7SXJVV","json":"https://pith.science/pith/7BWREESHGVXI6Y3OCE2U7SXJVV.json","graph_json":"https://pith.science/api/pith-number/7BWREESHGVXI6Y3OCE2U7SXJVV/graph.json","events_json":"https://pith.science/api/pith-number/7BWREESHGVXI6Y3OCE2U7SXJVV/events.json","paper":"https://pith.science/paper/7BWREESH"},"agent_actions":{"view_html":"https://pith.science/pith/7BWREESHGVXI6Y3OCE2U7SXJVV","download_json":"https://pith.science/pith/7BWREESHGVXI6Y3OCE2U7SXJVV.json","view_paper":"https://pith.science/paper/7BWREESH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3588&json=true","fetch_graph":"https://pith.science/api/pith-number/7BWREESHGVXI6Y3OCE2U7SXJVV/graph.json","fetch_events":"https://pith.science/api/pith-number/7BWREESHGVXI6Y3OCE2U7SXJVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BWREESHGVXI6Y3OCE2U7SXJVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BWREESHGVXI6Y3OCE2U7SXJVV/action/storage_attestation","attest_author":"https://pith.science/pith/7BWREESHGVXI6Y3OCE2U7SXJVV/action/author_attestation","sign_citation":"https://pith.science/pith/7BWREESHGVXI6Y3OCE2U7SXJVV/action/citation_signature","submit_replication":"https://pith.science/pith/7BWREESHGVXI6Y3OCE2U7SXJVV/action/replication_record"}},"created_at":"2026-05-17T23:40:14.653126+00:00","updated_at":"2026-05-17T23:40:14.653126+00:00"}