{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IQQYF76SCZBPDEFYHLNVEOH3II","short_pith_number":"pith:IQQYF76S","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"},"canonical_sha256":"442182ffd21642f190b83adb5238fb4239392e656308a062a90c286fc52fd77b","source":{"kind":"arxiv","id":"2202.06656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.06656","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"2202.06656v1","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06656","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"IQQYF76SCZBP","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"pith_short_16","alias_value":"IQQYF76SCZBPDEFY","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"pith_short_8","alias_value":"IQQYF76S","created_at":"2026-07-05T03:56:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IQQYF76SCZBPDEFYHLNVEOH3II","target":"record","payload":{"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"},"canonical_sha256":"442182ffd21642f190b83adb5238fb4239392e656308a062a90c286fc52fd77b","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"},"source_kind":"arxiv","source_id":"2202.06656","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-07-05T03:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5g047I2KRzxdOEDQI1CL9C7mIZus/V3fwNlQaw1TzWhd7OI4N+tSeVeWdVdAQ5FGE4bRF/R4lBsZ3nTKVgTiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:14:43.185306Z"},"content_sha256":"5cdfe2f0c3c9be4287a32facf4d8e06d660daddbe95d34b741ec3303a7c60fd1","schema_version":"1.0","event_id":"sha256:5cdfe2f0c3c9be4287a32facf4d8e06d660daddbe95d34b741ec3303a7c60fd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IQQYF76SCZBPDEFYHLNVEOH3II","target":"graph","payload":{"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"},"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-07-05T03:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouK69EUJmGSW95ziJFmr+Pa8TdgXvO1u9jSQDy65tIrF5JsblgbsMDz37883U/ZVq349ky6shd/2Uhp80umtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:14:43.185925Z"},"content_sha256":"27144dca5b0182b8e2558e756932b6ae79664a0c21664cf97fb081f07823ea34","schema_version":"1.0","event_id":"sha256:27144dca5b0182b8e2558e756932b6ae79664a0c21664cf97fb081f07823ea34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/bundle.json","state_url":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQQYF76SCZBPDEFYHLNVEOH3II/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-08-17T20:14:43Z","links":{"resolver":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II","bundle":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/bundle.json","state":"https://pith.science/pith/IQQYF76SCZBPDEFYHLNVEOH3II/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQQYF76SCZBPDEFYHLNVEOH3II/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IQQYF76SCZBPDEFYHLNVEOH3II","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":"8c043847d3b6720e46a11ec1e6ebdef3a04c47d909c9914495afa37cea688e90","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CG","submitted_at":"2022-02-14T12:22:53Z","title_canon_sha256":"e6b5df21e80cb607bb421d68a06af51a5596028fcae62b6b47adc0334c68764f"},"schema_version":"1.0","source":{"id":"2202.06656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.06656","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"2202.06656v1","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06656","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"IQQYF76SCZBP","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"pith_short_16","alias_value":"IQQYF76SCZBPDEFY","created_at":"2026-07-05T03:56:40Z"},{"alias_kind":"pith_short_8","alias_value":"IQQYF76S","created_at":"2026-07-05T03:56:40Z"}],"graph_snapshots":[{"event_id":"sha256:27144dca5b0182b8e2558e756932b6ae79664a0c21664cf97fb081f07823ea34","target":"graph","created_at":"2026-07-05T03:56:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.06656/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Rolf Hoffmann","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CG","submitted_at":"2022-02-14T12:22:53Z","title":"Forming Point Patterns by a Probabilistic Cellular Automata Rule"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.06656","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:5cdfe2f0c3c9be4287a32facf4d8e06d660daddbe95d34b741ec3303a7c60fd1","target":"record","created_at":"2026-07-05T03:56:40Z","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":"8c043847d3b6720e46a11ec1e6ebdef3a04c47d909c9914495afa37cea688e90","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CG","submitted_at":"2022-02-14T12:22:53Z","title_canon_sha256":"e6b5df21e80cb607bb421d68a06af51a5596028fcae62b6b47adc0334c68764f"},"schema_version":"1.0","source":{"id":"2202.06656","kind":"arxiv","version":1}},"canonical_sha256":"442182ffd21642f190b83adb5238fb4239392e656308a062a90c286fc52fd77b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"442182ffd21642f190b83adb5238fb4239392e656308a062a90c286fc52fd77b","first_computed_at":"2026-07-05T03:56:40.731289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:56:40.731289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dlS2j67PqE1SB4pvZ45owK6pCzHo/ar7eVTVKxdfpMtBp87J/QKZIZXUL0GGNtjgBb9M8J+05rl09QGA6zaHDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:56:40.731733Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.06656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cdfe2f0c3c9be4287a32facf4d8e06d660daddbe95d34b741ec3303a7c60fd1","sha256:27144dca5b0182b8e2558e756932b6ae79664a0c21664cf97fb081f07823ea34"],"state_sha256":"71faacebda087d19e962d27711d09287c70e34bbe92aae7147fe8d6c37920a3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wq9ROSberfAqUe1vqQ4W++g/xBPRloaT/0zpsktJfMo/nCHJK4cEIUWTqvzRC9aQKPbTC2Qy2YEP+1nFNH98CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T20:14:43.195879Z","bundle_sha256":"b0e7a49f996250d8523acd17a69b6207c0c7921d10e812867cd4f6cc7713d701"}}