{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3PKPCLO4FE6ZE6ANYWFLBQKUJO","short_pith_number":"pith:3PKPCLO4","schema_version":"1.0","canonical_sha256":"dbd4f12ddc293d92780dc58ab0c1544b878defc9cad17e33a9a10516001a390e","source":{"kind":"arxiv","id":"1707.06267","version":1},"attestation_state":"computed","paper":{"title":"Shape Generation using Spatially Partitioned Point Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Matheus Gadelha, Rui Wang, Subhransu Maji","submitted_at":"2017-07-19T19:32:47Z","abstract_excerpt":"We propose a method to generate 3D shapes using point clouds. Given a point-cloud representation of a 3D shape, our method builds a kd-tree to spatially partition the points. This orders them consistently across all shapes, resulting in reasonably good correspondences across all shapes. We then use PCA analysis to derive a linear shape basis across the spatially partitioned points, and optimize the point ordering by iteratively minimizing the PCA reconstruction error. Even with the spatial sorting, the point clouds are inherently noisy and the resulting distribution over the shape coefficients"},"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":"1707.06267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-19T19:32:47Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"8796019cf0e5e347bdf957c50689f4bac2335b39ee8ea3b9eed40e44b5bfc902","abstract_canon_sha256":"08a1d87213720971a94ea1fdcac1d806e6a129d1143c404d55e3a35261353010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:54.315423Z","signature_b64":"y4GU3aPRLgZ/mIZgli1d0k/UYZcccqLzHgko5cK5SL/ByBXmSqb7d9r4Jv0lX81Evu2pS+wt3M0zKZct2iKACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbd4f12ddc293d92780dc58ab0c1544b878defc9cad17e33a9a10516001a390e","last_reissued_at":"2026-05-18T00:39:54.314682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:54.314682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shape Generation using Spatially Partitioned Point Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Matheus Gadelha, Rui Wang, Subhransu Maji","submitted_at":"2017-07-19T19:32:47Z","abstract_excerpt":"We propose a method to generate 3D shapes using point clouds. Given a point-cloud representation of a 3D shape, our method builds a kd-tree to spatially partition the points. This orders them consistently across all shapes, resulting in reasonably good correspondences across all shapes. We then use PCA analysis to derive a linear shape basis across the spatially partitioned points, and optimize the point ordering by iteratively minimizing the PCA reconstruction error. Even with the spatial sorting, the point clouds are inherently noisy and the resulting distribution over the shape coefficients"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06267","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":"1707.06267","created_at":"2026-05-18T00:39:54.314805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06267v1","created_at":"2026-05-18T00:39:54.314805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06267","created_at":"2026-05-18T00:39:54.314805+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PKPCLO4FE6Z","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PKPCLO4FE6ZE6AN","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PKPCLO4","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09186","citing_title":"Efficient Learning on Point Clouds with Basis Point Sets","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO","json":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO.json","graph_json":"https://pith.science/api/pith-number/3PKPCLO4FE6ZE6ANYWFLBQKUJO/graph.json","events_json":"https://pith.science/api/pith-number/3PKPCLO4FE6ZE6ANYWFLBQKUJO/events.json","paper":"https://pith.science/paper/3PKPCLO4"},"agent_actions":{"view_html":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO","download_json":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO.json","view_paper":"https://pith.science/paper/3PKPCLO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06267&json=true","fetch_graph":"https://pith.science/api/pith-number/3PKPCLO4FE6ZE6ANYWFLBQKUJO/graph.json","fetch_events":"https://pith.science/api/pith-number/3PKPCLO4FE6ZE6ANYWFLBQKUJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO/action/storage_attestation","attest_author":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO/action/author_attestation","sign_citation":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO/action/citation_signature","submit_replication":"https://pith.science/pith/3PKPCLO4FE6ZE6ANYWFLBQKUJO/action/replication_record"}},"created_at":"2026-05-18T00:39:54.314805+00:00","updated_at":"2026-05-18T00:39:54.314805+00:00"}