{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AJEOX7PPP4K2QBEFKFDIQPE77X","short_pith_number":"pith:AJEOX7PP","schema_version":"1.0","canonical_sha256":"0248ebfdef7f15a804855146883c9ffde6fff895a02ad970ddde67f2fff8a057","source":{"kind":"arxiv","id":"2502.11390","version":1},"attestation_state":"computed","paper":{"title":"MARS: Mesh AutoRegressive Model for 3D Shape Detailization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongdong Li, Jingnan Gao, Pan Ji, Senbo Wang, Shenzhou Chen, Taizhang Shang, Weixuan Sun, Weizhe Liu, Xiaokang Yang, Xibin Song, Yichao Yan","submitted_at":"2025-02-17T03:12:16Z","abstract_excerpt":"State-of-the-art methods for mesh detailization predominantly utilize Generative Adversarial Networks (GANs) to generate detailed meshes from coarse ones. These methods typically learn a specific style code for each category or similar categories without enforcing geometry supervision across different Levels of Detail (LODs). Consequently, such methods often fail to generalize across a broader range of categories and cannot ensure shape consistency throughout the detailization process. In this paper, we introduce MARS, a novel approach for 3D shape detailization. Our method capitalizes on a no"},"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.11390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-02-17T03:12:16Z","cross_cats_sorted":[],"title_canon_sha256":"a4d20bb31e0ac2f428f6c8735d03e35033cb758e5ba56e1ed934ab8785f3ec41","abstract_canon_sha256":"5e935a2f6bba1e8fe1a61e85b2bd50eb48b6457ba15cea607cdb9e2125f7975a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:27.669564Z","signature_b64":"B69zYP9I9qnLoA+ZStTulXwMfVHravlJXX/pJe8rHjbtqSnmPTcikNo6VybB9oyJz4BExaVM/p8e21xfSLE+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0248ebfdef7f15a804855146883c9ffde6fff895a02ad970ddde67f2fff8a057","last_reissued_at":"2026-07-05T10:15:27.669078Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:27.669078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MARS: Mesh AutoRegressive Model for 3D Shape Detailization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongdong Li, Jingnan Gao, Pan Ji, Senbo Wang, Shenzhou Chen, Taizhang Shang, Weixuan Sun, Weizhe Liu, Xiaokang Yang, Xibin Song, Yichao Yan","submitted_at":"2025-02-17T03:12:16Z","abstract_excerpt":"State-of-the-art methods for mesh detailization predominantly utilize Generative Adversarial Networks (GANs) to generate detailed meshes from coarse ones. These methods typically learn a specific style code for each category or similar categories without enforcing geometry supervision across different Levels of Detail (LODs). Consequently, such methods often fail to generalize across a broader range of categories and cannot ensure shape consistency throughout the detailization process. In this paper, we introduce MARS, a novel approach for 3D shape detailization. Our method capitalizes on a no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11390","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/2502.11390/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.11390","created_at":"2026-07-05T10:15:27.669131+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.11390v1","created_at":"2026-07-05T10:15:27.669131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11390","created_at":"2026-07-05T10:15:27.669131+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJEOX7PPP4K2","created_at":"2026-07-05T10:15:27.669131+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJEOX7PPP4K2QBEF","created_at":"2026-07-05T10:15:27.669131+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJEOX7PP","created_at":"2026-07-05T10:15:27.669131+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08302","citing_title":"HACK++: Towards More Effective Head-Aware Key-Value Compression for Efficient Visual Autoregressive Modeling","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X","json":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X.json","graph_json":"https://pith.science/api/pith-number/AJEOX7PPP4K2QBEFKFDIQPE77X/graph.json","events_json":"https://pith.science/api/pith-number/AJEOX7PPP4K2QBEFKFDIQPE77X/events.json","paper":"https://pith.science/paper/AJEOX7PP"},"agent_actions":{"view_html":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X","download_json":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X.json","view_paper":"https://pith.science/paper/AJEOX7PP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.11390&json=true","fetch_graph":"https://pith.science/api/pith-number/AJEOX7PPP4K2QBEFKFDIQPE77X/graph.json","fetch_events":"https://pith.science/api/pith-number/AJEOX7PPP4K2QBEFKFDIQPE77X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X/action/storage_attestation","attest_author":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X/action/author_attestation","sign_citation":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X/action/citation_signature","submit_replication":"https://pith.science/pith/AJEOX7PPP4K2QBEFKFDIQPE77X/action/replication_record"}},"created_at":"2026-07-05T10:15:27.669131+00:00","updated_at":"2026-07-05T10:15:27.669131+00:00"}