{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WIKFLAHTQG4O6MXHT5FQ6GEXPU","short_pith_number":"pith:WIKFLAHT","schema_version":"1.0","canonical_sha256":"b2145580f381b8ef32e79f4b0f18977d055a9b105b4f644f3ea705ca009d40ca","source":{"kind":"arxiv","id":"2103.04130","version":1},"attestation_state":"computed","paper":{"title":"Learning to Generate 3D Shapes with Generative Cellular Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Changwoon Choi, Dongsu Zhang, Jeonghwan Kim, Young Min Kim","submitted_at":"2021-03-06T14:59:35Z","abstract_excerpt":"We present a probabilistic 3D generative model, named Generative Cellular Automata, which is able to produce diverse and high quality shapes. We formulate the shape generation process as sampling from the transition kernel of a Markov chain, where the sampling chain eventually evolves to the full shape of the learned distribution. The transition kernel employs the local update rules of cellular automata, effectively reducing the search space in a high-resolution 3D grid space by exploiting the connectivity and sparsity of 3D shapes. Our progressive generation only focuses on the sparse set of "},"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":"2103.04130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-03-06T14:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"179f2b1e2d890b67c5613464c2e7535b4878340700d851da57db625218eeb8e8","abstract_canon_sha256":"98fd8aa1d301e289fe146ca4ec74b143b9a42e0432a196b2573cbb561eb0c4a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:21:02.685137Z","signature_b64":"r0EvFxjr4zjTsYkGcgoCLSRi2drFsFL8b4MO9vyy8Rr0T2C9yJyxhhKB2qGqPMiV5hd561GUg0sCdLN3Rh2ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2145580f381b8ef32e79f4b0f18977d055a9b105b4f644f3ea705ca009d40ca","last_reissued_at":"2026-07-05T02:21:02.684722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:21:02.684722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Generate 3D Shapes with Generative Cellular Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Changwoon Choi, Dongsu Zhang, Jeonghwan Kim, Young Min Kim","submitted_at":"2021-03-06T14:59:35Z","abstract_excerpt":"We present a probabilistic 3D generative model, named Generative Cellular Automata, which is able to produce diverse and high quality shapes. We formulate the shape generation process as sampling from the transition kernel of a Markov chain, where the sampling chain eventually evolves to the full shape of the learned distribution. The transition kernel employs the local update rules of cellular automata, effectively reducing the search space in a high-resolution 3D grid space by exploiting the connectivity and sparsity of 3D shapes. Our progressive generation only focuses on the sparse set of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04130","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/2103.04130/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":"2103.04130","created_at":"2026-07-05T02:21:02.684791+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.04130v1","created_at":"2026-07-05T02:21:02.684791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04130","created_at":"2026-07-05T02:21:02.684791+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIKFLAHTQG4O","created_at":"2026-07-05T02:21:02.684791+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIKFLAHTQG4O6MXH","created_at":"2026-07-05T02:21:02.684791+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIKFLAHT","created_at":"2026-07-05T02:21:02.684791+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01492","citing_title":"A Continuous-Time Consistency Model for 3D Point Cloud Generation","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU","json":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU.json","graph_json":"https://pith.science/api/pith-number/WIKFLAHTQG4O6MXHT5FQ6GEXPU/graph.json","events_json":"https://pith.science/api/pith-number/WIKFLAHTQG4O6MXHT5FQ6GEXPU/events.json","paper":"https://pith.science/paper/WIKFLAHT"},"agent_actions":{"view_html":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU","download_json":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU.json","view_paper":"https://pith.science/paper/WIKFLAHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.04130&json=true","fetch_graph":"https://pith.science/api/pith-number/WIKFLAHTQG4O6MXHT5FQ6GEXPU/graph.json","fetch_events":"https://pith.science/api/pith-number/WIKFLAHTQG4O6MXHT5FQ6GEXPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU/action/storage_attestation","attest_author":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU/action/author_attestation","sign_citation":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU/action/citation_signature","submit_replication":"https://pith.science/pith/WIKFLAHTQG4O6MXHT5FQ6GEXPU/action/replication_record"}},"created_at":"2026-07-05T02:21:02.684791+00:00","updated_at":"2026-07-05T02:21:02.684791+00:00"}