{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3ACXC66YUD3NAJUTEK7FCVIUZH","short_pith_number":"pith:3ACXC66Y","schema_version":"1.0","canonical_sha256":"d805717bd8a0f6d0269322be515514c9d0cd7ef3ffc5d1ef40b9ab7f9ad7edac","source":{"kind":"arxiv","id":"1111.4582","version":1},"attestation_state":"computed","paper":{"title":"Density classification on infinite lattices and trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","nlin.CG"],"primary_cat":"math.PR","authors_text":"Ana Busic, Irene Marcovici, Jean Mairesse, Nazim Fates","submitted_at":"2011-11-19T21:15:40Z","abstract_excerpt":"Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular automaton or a finite-range interacting particle system that evolves on this graph and decides whether p is smaller or larger than 1/2. Precisely, the trajectories should converge to the uniform configuration with only 0's if p<1/2, and only 1's if p>1/2. We present solutions to that problem on the d-dimensional lattice, for any d>1, and on the regular infinite tree"},"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":"1111.4582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-19T21:15:40Z","cross_cats_sorted":["cs.DM","nlin.CG"],"title_canon_sha256":"1eed4713e5f1a991baf562bc2b15d5980136a0a908a04cee3c1b39cbc9c98fd5","abstract_canon_sha256":"8ec0e0f3e79013748366b7548f1b2360297be16db09e65b440a68b7d528fbc1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:03.043240Z","signature_b64":"CCJ9YDGZaPGxZHlzMlYRLiDBYZJONMzo7bum/Kkj9UFEbfKR0UOJBZji8/u2Ersp3WZ6pt5eJxvl7zaIs3s+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d805717bd8a0f6d0269322be515514c9d0cd7ef3ffc5d1ef40b9ab7f9ad7edac","last_reissued_at":"2026-05-18T04:08:03.042792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:03.042792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density classification on infinite lattices and trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","nlin.CG"],"primary_cat":"math.PR","authors_text":"Ana Busic, Irene Marcovici, Jean Mairesse, Nazim Fates","submitted_at":"2011-11-19T21:15:40Z","abstract_excerpt":"Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular automaton or a finite-range interacting particle system that evolves on this graph and decides whether p is smaller or larger than 1/2. Precisely, the trajectories should converge to the uniform configuration with only 0's if p<1/2, and only 1's if p>1/2. We present solutions to that problem on the d-dimensional lattice, for any d>1, and on the regular infinite tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4582","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":"1111.4582","created_at":"2026-05-18T04:08:03.042856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4582v1","created_at":"2026-05-18T04:08:03.042856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4582","created_at":"2026-05-18T04:08:03.042856+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ACXC66YUD3N","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ACXC66YUD3NAJUT","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ACXC66Y","created_at":"2026-05-18T12:26:18.847500+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/3ACXC66YUD3NAJUTEK7FCVIUZH","json":"https://pith.science/pith/3ACXC66YUD3NAJUTEK7FCVIUZH.json","graph_json":"https://pith.science/api/pith-number/3ACXC66YUD3NAJUTEK7FCVIUZH/graph.json","events_json":"https://pith.science/api/pith-number/3ACXC66YUD3NAJUTEK7FCVIUZH/events.json","paper":"https://pith.science/paper/3ACXC66Y"},"agent_actions":{"view_html":"https://pith.science/pith/3ACXC66YUD3NAJUTEK7FCVIUZH","download_json":"https://pith.science/pith/3ACXC66YUD3NAJUTEK7FCVIUZH.json","view_paper":"https://pith.science/paper/3ACXC66Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4582&json=true","fetch_graph":"https://pith.science/api/pith-number/3ACXC66YUD3NAJUTEK7FCVIUZH/graph.json","fetch_events":"https://pith.science/api/pith-number/3ACXC66YUD3NAJUTEK7FCVIUZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ACXC66YUD3NAJUTEK7FCVIUZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ACXC66YUD3NAJUTEK7FCVIUZH/action/storage_attestation","attest_author":"https://pith.science/pith/3ACXC66YUD3NAJUTEK7FCVIUZH/action/author_attestation","sign_citation":"https://pith.science/pith/3ACXC66YUD3NAJUTEK7FCVIUZH/action/citation_signature","submit_replication":"https://pith.science/pith/3ACXC66YUD3NAJUTEK7FCVIUZH/action/replication_record"}},"created_at":"2026-05-18T04:08:03.042856+00:00","updated_at":"2026-05-18T04:08:03.042856+00:00"}