{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NIS3JPOA6CKPF64Z2A6Q33BGD6","short_pith_number":"pith:NIS3JPOA","schema_version":"1.0","canonical_sha256":"6a25b4bdc0f094f2fb99d03d0dec261fa4c2df69ed744786bf7178a0b553b850","source":{"kind":"arxiv","id":"2402.00867","version":1},"attestation_state":"computed","paper":{"title":"AToM: Amortized Text-to-Mesh using 2D Diffusion","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Aliaksandr Siarohin, Bernard Ghanem, Chaoyang Wang, Guocheng Qian, Hsin-Ying Lee, Igor Gilitschenski, Ivan Skorokhodov, Jian Ren, Junli Cao, Kfir Aberman, Michael Vasilkovsky, Peiye Zhuang, Sergey Tulyakov, Yash Kant, Yuwei Fang","submitted_at":"2024-02-01T18:59:56Z","abstract_excerpt":"We introduce Amortized Text-to-Mesh (AToM), a feed-forward text-to-mesh framework optimized across multiple text prompts simultaneously. In contrast to existing text-to-3D methods that often entail time-consuming per-prompt optimization and commonly output representations other than polygonal meshes, AToM directly generates high-quality textured meshes in less than 1 second with around 10 times reduction in the training cost, and generalizes to unseen prompts. Our key idea is a novel triplane-based text-to-mesh architecture with a two-stage amortized optimization strategy that ensures stable t"},"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":"2402.00867","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2024-02-01T18:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"5759c1f8449a5abde72efab566960096cc5be5dbfc137bcefd644496d7b2fdc9","abstract_canon_sha256":"80b4dfd5ad6b36d8112e305a8c39e3554c59c84a1e40da11fceed0376847ac66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:18.563149Z","signature_b64":"iLasBBnsMOc4sprO0FhSVI6o+UAPahsgZsEgdsUUgC2z7OuXOWpcslqll7sFxVDVW71MoKonPYm7tAKGUSZSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a25b4bdc0f094f2fb99d03d0dec261fa4c2df69ed744786bf7178a0b553b850","last_reissued_at":"2026-07-05T07:40:18.562643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:18.562643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AToM: Amortized Text-to-Mesh using 2D Diffusion","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Aliaksandr Siarohin, Bernard Ghanem, Chaoyang Wang, Guocheng Qian, Hsin-Ying Lee, Igor Gilitschenski, Ivan Skorokhodov, Jian Ren, Junli Cao, Kfir Aberman, Michael Vasilkovsky, Peiye Zhuang, Sergey Tulyakov, Yash Kant, Yuwei Fang","submitted_at":"2024-02-01T18:59:56Z","abstract_excerpt":"We introduce Amortized Text-to-Mesh (AToM), a feed-forward text-to-mesh framework optimized across multiple text prompts simultaneously. In contrast to existing text-to-3D methods that often entail time-consuming per-prompt optimization and commonly output representations other than polygonal meshes, AToM directly generates high-quality textured meshes in less than 1 second with around 10 times reduction in the training cost, and generalizes to unseen prompts. Our key idea is a novel triplane-based text-to-mesh architecture with a two-stage amortized optimization strategy that ensures stable t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.00867","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/2402.00867/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":"2402.00867","created_at":"2026-07-05T07:40:18.562707+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.00867v1","created_at":"2026-07-05T07:40:18.562707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.00867","created_at":"2026-07-05T07:40:18.562707+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIS3JPOA6CKP","created_at":"2026-07-05T07:40:18.562707+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIS3JPOA6CKPF64Z","created_at":"2026-07-05T07:40:18.562707+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIS3JPOA","created_at":"2026-07-05T07:40:18.562707+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13036","citing_title":"Lyra 2.0: Explorable Generative 3D Worlds","ref_index":76,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6","json":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6.json","graph_json":"https://pith.science/api/pith-number/NIS3JPOA6CKPF64Z2A6Q33BGD6/graph.json","events_json":"https://pith.science/api/pith-number/NIS3JPOA6CKPF64Z2A6Q33BGD6/events.json","paper":"https://pith.science/paper/NIS3JPOA"},"agent_actions":{"view_html":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6","download_json":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6.json","view_paper":"https://pith.science/paper/NIS3JPOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.00867&json=true","fetch_graph":"https://pith.science/api/pith-number/NIS3JPOA6CKPF64Z2A6Q33BGD6/graph.json","fetch_events":"https://pith.science/api/pith-number/NIS3JPOA6CKPF64Z2A6Q33BGD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6/action/storage_attestation","attest_author":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6/action/author_attestation","sign_citation":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6/action/citation_signature","submit_replication":"https://pith.science/pith/NIS3JPOA6CKPF64Z2A6Q33BGD6/action/replication_record"}},"created_at":"2026-07-05T07:40:18.562707+00:00","updated_at":"2026-07-05T07:40:18.562707+00:00"}