{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2IWMTVRCGCZG3CLZ54TEDCUGST","short_pith_number":"pith:2IWMTVRC","schema_version":"1.0","canonical_sha256":"d22cc9d62230b26d8979ef26418a8694f45efe8504c547e0eee437aa89c91b84","source":{"kind":"arxiv","id":"1909.05736","version":4},"attestation_state":"computed","paper":{"title":"CvxNet: Learnable Convex Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Andrea Tagliasacchi, Boyang Deng, Geoffrey Hinton, Kyle Genova, Sofien Bouaziz, Soroosh Yazdani","submitted_at":"2019-09-12T14:59:52Z","abstract_excerpt":"Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This decomposition is fundamental in computer graphics, where it provides one of the most common ways to approximate geometry, for example, in real-time physics simulation. A convex object also has the property of being simultaneously an explicit and implicit representation: one can interpret it explicitly as a mesh derived by computing the vertices of a convex hull, or impl"},"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":"1909.05736","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-12T14:59:52Z","cross_cats_sorted":["cs.GR","cs.LG"],"title_canon_sha256":"9353da2c63f2b5f27ebc9a7d7996b29dbcb32ab66f57edc14249c5ba0b4e08d3","abstract_canon_sha256":"de9eac3f3897dfe1c9a7f55e2442a152bdc80f471c71aae03ed1880cf3c00390"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:30.248814Z","signature_b64":"xKtIObExvMI9v8g6efDQ0QQ74SAhO8G1KNGmEECGIoeA6YdGQrdfOiBEjlNYm6wvt8DFKkfrhUXGqMCFQkYrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d22cc9d62230b26d8979ef26418a8694f45efe8504c547e0eee437aa89c91b84","last_reissued_at":"2026-07-05T00:54:30.248404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:30.248404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CvxNet: Learnable Convex Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Andrea Tagliasacchi, Boyang Deng, Geoffrey Hinton, Kyle Genova, Sofien Bouaziz, Soroosh Yazdani","submitted_at":"2019-09-12T14:59:52Z","abstract_excerpt":"Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This decomposition is fundamental in computer graphics, where it provides one of the most common ways to approximate geometry, for example, in real-time physics simulation. A convex object also has the property of being simultaneously an explicit and implicit representation: one can interpret it explicitly as a mesh derived by computing the vertices of a convex hull, or impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05736","kind":"arxiv","version":4},"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/1909.05736/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":"1909.05736","created_at":"2026-07-05T00:54:30.248464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05736v4","created_at":"2026-07-05T00:54:30.248464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05736","created_at":"2026-07-05T00:54:30.248464+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IWMTVRCGCZG","created_at":"2026-07-05T00:54:30.248464+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IWMTVRCGCZG3CLZ","created_at":"2026-07-05T00:54:30.248464+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IWMTVRC","created_at":"2026-07-05T00:54:30.248464+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/2IWMTVRCGCZG3CLZ54TEDCUGST","json":"https://pith.science/pith/2IWMTVRCGCZG3CLZ54TEDCUGST.json","graph_json":"https://pith.science/api/pith-number/2IWMTVRCGCZG3CLZ54TEDCUGST/graph.json","events_json":"https://pith.science/api/pith-number/2IWMTVRCGCZG3CLZ54TEDCUGST/events.json","paper":"https://pith.science/paper/2IWMTVRC"},"agent_actions":{"view_html":"https://pith.science/pith/2IWMTVRCGCZG3CLZ54TEDCUGST","download_json":"https://pith.science/pith/2IWMTVRCGCZG3CLZ54TEDCUGST.json","view_paper":"https://pith.science/paper/2IWMTVRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05736&json=true","fetch_graph":"https://pith.science/api/pith-number/2IWMTVRCGCZG3CLZ54TEDCUGST/graph.json","fetch_events":"https://pith.science/api/pith-number/2IWMTVRCGCZG3CLZ54TEDCUGST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IWMTVRCGCZG3CLZ54TEDCUGST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IWMTVRCGCZG3CLZ54TEDCUGST/action/storage_attestation","attest_author":"https://pith.science/pith/2IWMTVRCGCZG3CLZ54TEDCUGST/action/author_attestation","sign_citation":"https://pith.science/pith/2IWMTVRCGCZG3CLZ54TEDCUGST/action/citation_signature","submit_replication":"https://pith.science/pith/2IWMTVRCGCZG3CLZ54TEDCUGST/action/replication_record"}},"created_at":"2026-07-05T00:54:30.248464+00:00","updated_at":"2026-07-05T00:54:30.248464+00:00"}