{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MMXIQAI4RADKWXLVLWUKZ4WPIJ","short_pith_number":"pith:MMXIQAI4","schema_version":"1.0","canonical_sha256":"632e88011c8806ab5d755da8acf2cf424fe50e7b0eee7632479349bee4b16134","source":{"kind":"arxiv","id":"1604.04402","version":1},"attestation_state":"computed","paper":{"title":"Two-dimensional traffic rules and the density classification problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Ir\\`ene Marcovici, Nazim Fat\\`es (MAIA), Siamak Taati (University of Groningen)","submitted_at":"2016-04-15T08:38:01Z","abstract_excerpt":"The density classification problem is the computational problem of finding the majority in a given array of votes in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density classification problem. On the other hand, it was shown that a probabilistic mixture of the traffic rule and the majority rule solves the one-dimensional problem correctly with a probability arbitrarily close to one. We investigate the possibility of a similar approach in two dimensions. We show that in two dimensions, the particle spacing problem, which is solved in one"},"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":"1604.04402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2016-04-15T08:38:01Z","cross_cats_sorted":[],"title_canon_sha256":"535438f4a7e75047f8454dd6bb90081e24cd6c62f35c9104d737ddacfdefdd99","abstract_canon_sha256":"3bafb0c68f8794f30fc0c07df943b57c7448e95160652d88de6e0ec5ae444c1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:04.215851Z","signature_b64":"QRvF+GFIaTdWxmUP5ndDRAvbZtGhvf6d91hujC4/alCIfkZ2P6uIoz8sxpmdPIufchTjqfWHWj5si9/cLBZRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"632e88011c8806ab5d755da8acf2cf424fe50e7b0eee7632479349bee4b16134","last_reissued_at":"2026-05-18T01:17:04.215091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:04.215091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-dimensional traffic rules and the density classification problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Ir\\`ene Marcovici, Nazim Fat\\`es (MAIA), Siamak Taati (University of Groningen)","submitted_at":"2016-04-15T08:38:01Z","abstract_excerpt":"The density classification problem is the computational problem of finding the majority in a given array of votes in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density classification problem. On the other hand, it was shown that a probabilistic mixture of the traffic rule and the majority rule solves the one-dimensional problem correctly with a probability arbitrarily close to one. We investigate the possibility of a similar approach in two dimensions. We show that in two dimensions, the particle spacing problem, which is solved in one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04402","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":"1604.04402","created_at":"2026-05-18T01:17:04.215214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04402v1","created_at":"2026-05-18T01:17:04.215214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04402","created_at":"2026-05-18T01:17:04.215214+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMXIQAI4RADK","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMXIQAI4RADKWXLV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMXIQAI4","created_at":"2026-05-18T12:30:32.724797+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/MMXIQAI4RADKWXLVLWUKZ4WPIJ","json":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ.json","graph_json":"https://pith.science/api/pith-number/MMXIQAI4RADKWXLVLWUKZ4WPIJ/graph.json","events_json":"https://pith.science/api/pith-number/MMXIQAI4RADKWXLVLWUKZ4WPIJ/events.json","paper":"https://pith.science/paper/MMXIQAI4"},"agent_actions":{"view_html":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ","download_json":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ.json","view_paper":"https://pith.science/paper/MMXIQAI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04402&json=true","fetch_graph":"https://pith.science/api/pith-number/MMXIQAI4RADKWXLVLWUKZ4WPIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MMXIQAI4RADKWXLVLWUKZ4WPIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/action/storage_attestation","attest_author":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/action/author_attestation","sign_citation":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/action/citation_signature","submit_replication":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/action/replication_record"}},"created_at":"2026-05-18T01:17:04.215214+00:00","updated_at":"2026-05-18T01:17:04.215214+00:00"}