{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PBN3AU3FAXHMQO2HYJTVGZIRZF","short_pith_number":"pith:PBN3AU3F","schema_version":"1.0","canonical_sha256":"785bb0536505cec83b47c267536511c96dbc47b3f307239d580e4c47a6986f06","source":{"kind":"arxiv","id":"2502.08884","version":3},"attestation_state":"computed","paper":{"title":"ShapeLib: Designing a library of programmatic 3D shape abstractions with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GR"],"primary_cat":"cs.CV","authors_text":"Daniel Ritchie, Niloy J. Mitra, Paul Guerrero, R. Kenny Jones","submitted_at":"2025-02-13T01:52:02Z","abstract_excerpt":"We present ShapeLib, the first method that uses the priors of Large Language Models (LLMs) to design libraries of programmatic 3D shape abstractions. Our system accepts two forms of user-provided design intent: high-level text descriptions of functions to include in the output library and a small seed set of exemplar shapes. We discover a library of abstractions that matches this design intent with a guided LLM workflow that first proposes different ways of applying and implementing functions, and then validates these functions are helpful in representing seed set shapes. To extend beyond the "},"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":"2502.08884","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-02-13T01:52:02Z","cross_cats_sorted":["cs.AI","cs.GR"],"title_canon_sha256":"b4ce2564c45bb1459d7db5098dc7f66d408c2b167ca1fcee94ebbfec7eb2c3d5","abstract_canon_sha256":"c0e7e367d64d264b3cb72f564cd722ee4e7d931ca77b63ebf2c36532a1c3eaf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:05.156126Z","signature_b64":"vLkA+xXE51MFsHiB8NHD2u9U6a2g2XS3Tx6ArJoBO/IiYjq+26SssrijylaSTlfhfiuue1CzJTWGz+ibDcS0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"785bb0536505cec83b47c267536511c96dbc47b3f307239d580e4c47a6986f06","last_reissued_at":"2026-06-02T02:04:05.155583Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:05.155583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ShapeLib: Designing a library of programmatic 3D shape abstractions with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GR"],"primary_cat":"cs.CV","authors_text":"Daniel Ritchie, Niloy J. Mitra, Paul Guerrero, R. Kenny Jones","submitted_at":"2025-02-13T01:52:02Z","abstract_excerpt":"We present ShapeLib, the first method that uses the priors of Large Language Models (LLMs) to design libraries of programmatic 3D shape abstractions. Our system accepts two forms of user-provided design intent: high-level text descriptions of functions to include in the output library and a small seed set of exemplar shapes. We discover a library of abstractions that matches this design intent with a guided LLM workflow that first proposes different ways of applying and implementing functions, and then validates these functions are helpful in representing seed set shapes. To extend beyond the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08884","kind":"arxiv","version":3},"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/2502.08884/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":"2502.08884","created_at":"2026-06-02T02:04:05.155641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08884v3","created_at":"2026-06-02T02:04:05.155641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08884","created_at":"2026-06-02T02:04:05.155641+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBN3AU3FAXHM","created_at":"2026-06-02T02:04:05.155641+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBN3AU3FAXHMQO2H","created_at":"2026-06-02T02:04:05.155641+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBN3AU3F","created_at":"2026-06-02T02:04:05.155641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.26943","citing_title":"ProcFunc: Function-Oriented Abstractions for Procedural 3D Generation in Python","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF","json":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF.json","graph_json":"https://pith.science/api/pith-number/PBN3AU3FAXHMQO2HYJTVGZIRZF/graph.json","events_json":"https://pith.science/api/pith-number/PBN3AU3FAXHMQO2HYJTVGZIRZF/events.json","paper":"https://pith.science/paper/PBN3AU3F"},"agent_actions":{"view_html":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF","download_json":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF.json","view_paper":"https://pith.science/paper/PBN3AU3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08884&json=true","fetch_graph":"https://pith.science/api/pith-number/PBN3AU3FAXHMQO2HYJTVGZIRZF/graph.json","fetch_events":"https://pith.science/api/pith-number/PBN3AU3FAXHMQO2HYJTVGZIRZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF/action/storage_attestation","attest_author":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF/action/author_attestation","sign_citation":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF/action/citation_signature","submit_replication":"https://pith.science/pith/PBN3AU3FAXHMQO2HYJTVGZIRZF/action/replication_record"}},"created_at":"2026-06-02T02:04:05.155641+00:00","updated_at":"2026-06-02T02:04:05.155641+00:00"}