{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IQQYF76SCZBPDEFYHLNVEOH3II","short_pith_number":"pith:IQQYF76S","schema_version":"1.0","canonical_sha256":"442182ffd21642f190b83adb5238fb4239392e656308a062a90c286fc52fd77b","source":{"kind":"arxiv","id":"2202.06656","version":1},"attestation_state":"computed","paper":{"title":"Forming Point Patterns by a Probabilistic Cellular Automata Rule","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Rolf Hoffmann","submitted_at":"2022-02-14T12:22:53Z","abstract_excerpt":"The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have to be separated by 0-cells, and every 0-cell can find at least one point in its Moore-neighborhood. Probabilistic rules are designed that can solve this task with asynchronous updating and cyclic boundary condition. The task is considered as a tiling problem, where point tiles are used to cover the space with overlaps. A point tile consists of a center pixel (the kernel with value 1) and 8 surrounding pixels forming "},"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":"2202.06656","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CG","submitted_at":"2022-02-14T12:22:53Z","cross_cats_sorted":[],"title_canon_sha256":"e6b5df21e80cb607bb421d68a06af51a5596028fcae62b6b47adc0334c68764f","abstract_canon_sha256":"8c043847d3b6720e46a11ec1e6ebdef3a04c47d909c9914495afa37cea688e90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:40.731733Z","signature_b64":"dlS2j67PqE1SB4pvZ45owK6pCzHo/ar7eVTVKxdfpMtBp87J/QKZIZXUL0GGNtjgBb9M8J+05rl09QGA6zaHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"442182ffd21642f190b83adb5238fb4239392e656308a062a90c286fc52fd77b","last_reissued_at":"2026-07-05T03:56:40.731289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:40.731289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forming Point Patterns by a Probabilistic Cellular Automata Rule","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Rolf Hoffmann","submitted_at":"2022-02-14T12:22:53Z","abstract_excerpt":"The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have to be separated by 0-cells, and every 0-cell can find at least one point in its Moore-neighborhood. Probabilistic rules are designed that can solve this task with asynchronous updating and cyclic boundary condition. The task is considered as a tiling problem, where point tiles are used to cover the space with overlaps. A point tile consists of a center pixel (the kernel with value 1) and 8 surrounding pixels forming "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.06656","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.06656/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2202.06656","created_at":"2026-07-05T03:56:40.731357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.06656v1","created_at":"2026-07-05T03:56:40.731357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06656","created_at":"2026-07-05T03:56:40.731357+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQQYF76SCZBP","created_at":"2026-07-05T03:56:40.731357+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQQYF76SCZBPDEFY","created_at":"2026-07-05T03:56:40.731357+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQQYF76S","created_at":"2026-07-05T03:56:40.731357+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05246","citing_title":"Optimizing Wealth by a Game within Cellular Automata","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II","json":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II.json","graph_json":"https://pith.science/api/pith-number/IQQYF76SCZBPDEFYHLNVEOH3II/graph.json","events_json":"https://pith.science/api/pith-number/IQQYF76SCZBPDEFYHLNVEOH3II/events.json","paper":"https://pith.science/paper/IQQYF76S"},"agent_actions":{"view_html":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II","download_json":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II.json","view_paper":"https://pith.science/paper/IQQYF76S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.06656&json=true","fetch_graph":"https://pith.science/api/pith-number/IQQYF76SCZBPDEFYHLNVEOH3II/graph.json","fetch_events":"https://pith.science/api/pith-number/IQQYF76SCZBPDEFYHLNVEOH3II/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/action/storage_attestation","attest_author":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/action/author_attestation","sign_citation":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/action/citation_signature","submit_replication":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/action/replication_record"}},"created_at":"2026-07-05T03:56:40.731357+00:00","updated_at":"2026-07-05T03:56:40.731357+00:00"}