{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MMXIQAI4RADKWXLVLWUKZ4WPIJ","short_pith_number":"pith:MMXIQAI4","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"},"canonical_sha256":"632e88011c8806ab5d755da8acf2cf424fe50e7b0eee7632479349bee4b16134","source":{"kind":"arxiv","id":"1604.04402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04402","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04402v1","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04402","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"MMXIQAI4RADK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MMXIQAI4RADKWXLV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MMXIQAI4","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MMXIQAI4RADKWXLVLWUKZ4WPIJ","target":"record","payload":{"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"},"canonical_sha256":"632e88011c8806ab5d755da8acf2cf424fe50e7b0eee7632479349bee4b16134","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"},"source_kind":"arxiv","source_id":"1604.04402","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:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Y8/zc6RktPE0Teobflz29XaD1gHCfAWqaY926VqbIhgYmqsh0/qBbMvmf4tJa+yPxIqtAkyanKkYXdCglwXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:50:15.689144Z"},"content_sha256":"8212da6d062171444b019752489160dd3707d5dfc736b55238f7e308497e6b4b","schema_version":"1.0","event_id":"sha256:8212da6d062171444b019752489160dd3707d5dfc736b55238f7e308497e6b4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MMXIQAI4RADKWXLVLWUKZ4WPIJ","target":"graph","payload":{"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"},"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:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2JD7SU+NkO2W656bYu7LdnRM/B2P7VzU8whHaJSvNyQOnztGd1JzvuxesJxTSFvYuvdYMtM5aKmpGF+sOgcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:50:15.689816Z"},"content_sha256":"b94c2af64c20dac0332313cf16eba685f3e775325863419c180c5ecd8f3ee236","schema_version":"1.0","event_id":"sha256:b94c2af64c20dac0332313cf16eba685f3e775325863419c180c5ecd8f3ee236"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/bundle.json","state_url":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/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-06T12:50:15Z","links":{"resolver":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ","bundle":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/bundle.json","state":"https://pith.science/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMXIQAI4RADKWXLVLWUKZ4WPIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MMXIQAI4RADKWXLVLWUKZ4WPIJ","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":"3bafb0c68f8794f30fc0c07df943b57c7448e95160652d88de6e0ec5ae444c1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2016-04-15T08:38:01Z","title_canon_sha256":"535438f4a7e75047f8454dd6bb90081e24cd6c62f35c9104d737ddacfdefdd99"},"schema_version":"1.0","source":{"id":"1604.04402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04402","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04402v1","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04402","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"MMXIQAI4RADK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MMXIQAI4RADKWXLV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MMXIQAI4","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:b94c2af64c20dac0332313cf16eba685f3e775325863419c180c5ecd8f3ee236","target":"graph","created_at":"2026-05-18T01:17:04Z","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":"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","authors_text":"Ir\\`ene Marcovici, Nazim Fat\\`es (MAIA), Siamak Taati (University of Groningen)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2016-04-15T08:38:01Z","title":"Two-dimensional traffic rules and the density classification problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04402","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:8212da6d062171444b019752489160dd3707d5dfc736b55238f7e308497e6b4b","target":"record","created_at":"2026-05-18T01:17:04Z","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":"3bafb0c68f8794f30fc0c07df943b57c7448e95160652d88de6e0ec5ae444c1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2016-04-15T08:38:01Z","title_canon_sha256":"535438f4a7e75047f8454dd6bb90081e24cd6c62f35c9104d737ddacfdefdd99"},"schema_version":"1.0","source":{"id":"1604.04402","kind":"arxiv","version":1}},"canonical_sha256":"632e88011c8806ab5d755da8acf2cf424fe50e7b0eee7632479349bee4b16134","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"632e88011c8806ab5d755da8acf2cf424fe50e7b0eee7632479349bee4b16134","first_computed_at":"2026-05-18T01:17:04.215091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:04.215091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QRvF+GFIaTdWxmUP5ndDRAvbZtGhvf6d91hujC4/alCIfkZ2P6uIoz8sxpmdPIufchTjqfWHWj5si9/cLBZRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:04.215851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8212da6d062171444b019752489160dd3707d5dfc736b55238f7e308497e6b4b","sha256:b94c2af64c20dac0332313cf16eba685f3e775325863419c180c5ecd8f3ee236"],"state_sha256":"1030b9cc52cb5bf32322543cc784ca7618742cd322bd3cb68c7bba5b6dc06889"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3EV3S/prAHk5m6NAYqSnJIZN6FLUkqRzYH7MFMc1WssP6s0cx6BlLR9NDaZwBCsdmuTwo2Rs90QLiyW6xM+yBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:50:15.693804Z","bundle_sha256":"f7ae38d9484f5975fc98cfee0169e45970d034c2d6d6c1630fc53467517a9e60"}}