{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JULNET4BKR2CMIOYAMTYKDJKSR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"53369c60f99a84e2d7edfb95564554667a3fbe94f3656a8dcd1a53b0888d7f2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T14:35:31Z","title_canon_sha256":"56ec71ba0809b46f7455cae7774de84fa51c0fa451e7e1cb1ca712a53841b1ed"},"schema_version":"1.0","source":{"id":"2605.13600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13600","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13600v1","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13600","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"JULNET4BKR2C","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JULNET4BKR2CMIOY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JULNET4B","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:faca41055918d57a73ada5aa82a2bfed88be91bbc36489066888f67a6f733b23","target":"graph","created_at":"2026-05-18T02:44:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our method achieves up to 400× training speedup while being 3× more memory efficient during training compared to the state-of-the-art in rendering speed. Across multiple benchmarks, SCOUP matches or outperforms existing methods in open-vocabulary querying accuracy."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That sparse codebook coefficients learned entirely from 2D image regions can be uplifted to 3D Gaussians via weighted multi-view aggregation and Top-K filtering without substantial loss of semantic accuracy or the need for per-scene language optimization."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"SCOUP decouples 2D sparse code learning from 3D Gaussian optimization to deliver up to 400x training speedup and 3x better memory efficiency while matching accuracy on open-vocabulary 3D queries."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Sparse code uplifting from 2D images to 3D Gaussians delivers up to 400 times faster training for open-vocabulary scene understanding."}],"snapshot_sha256":"454fefc7b7b2f4d3960379d71122ce926740c8aff21402d0c9655603f5a68839"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"3D Language Gaussian Splatting (3DLGS) augments 3D Gaussian Splatting with language-aligned visual features for open-vocabulary 3D scene understanding. A core challenge is efficiently associating high-dimensional vision-language embeddings with millions of 3D Gaussians while preserving efficient feature rendering for text-based querying. Existing methods either store dense features directly on Gaussians, causing high storage costs and slow rendering, or learn compact representations through expensive per-scene optimization with repeated feature rasterization. No existing method simultaneously ","authors_text":"Lovre Antonio Budimir, Nandita Vijaykumar, Steve Ryhner, Sven Lon\\v{c}ari\\'c, Yushi Guan","cross_cats":[],"headline":"Sparse code uplifting from 2D images to 3D Gaussians delivers up to 400 times faster training for open-vocabulary scene understanding.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T14:35:31Z","title":"Sparse Code Uplifting for Efficient 3D Language Gaussian Splatting"},"references":{"count":43,"internal_anchors":2,"resolved_work":43,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"GALA: Guided attention with language alignment for open vocabulary gaussian splatting","work_id":"e8b07e34-4e73-4283-8b36-e419ae34b2b2","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Barron, Ben Mildenhall, Dor Verbin, Pratul P","work_id":"0aedd240-1463-4d03-bd4e-c8aff93e2414","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Gaussianeditor: Swift and controllable 3d editing with gaussian splatting.2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 21476–21485, 2023","work_id":"05058a69-c172-4cf0-bec7-c096214c88c7","year":2024},{"cited_arxiv_id":"","doi":"10.1109/cvpr52733.2024.02022","is_internal_anchor":false,"ref_index":4,"title":"URL https://doi.org/10.1109/CVPR52733","work_id":"7efbc2dd-b0f2-4f71-bb1c-d2fcf110d805","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Occam’s lgs: An efficient approach for language gaussian splatting","work_id":"9baf9d6e-f4e6-46a2-abfe-cd7588f4a792","year":2025}],"snapshot_sha256":"a1f80dc2a830356b712bebeaed8e5861d118bcec65f35261555cbad8f6049d82"},"source":{"id":"2605.13600","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:22:41.364916Z","id":"9b550f01-b106-4a13-bbe0-6dbff00084df","model_set":{"reader":"grok-4.3"},"one_line_summary":"SCOUP decouples 2D sparse code learning from 3D Gaussian optimization to deliver up to 400x training speedup and 3x better memory efficiency while matching accuracy on open-vocabulary 3D queries.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Sparse code uplifting from 2D images to 3D Gaussians delivers up to 400 times faster training for open-vocabulary scene understanding.","strongest_claim":"Our method achieves up to 400× training speedup while being 3× more memory efficient during training compared to the state-of-the-art in rendering speed. Across multiple benchmarks, SCOUP matches or outperforms existing methods in open-vocabulary querying accuracy.","weakest_assumption":"That sparse codebook coefficients learned entirely from 2D image regions can be uplifted to 3D Gaussians via weighted multi-view aggregation and Top-K filtering without substantial loss of semantic accuracy or the need for per-scene language optimization."}},"verdict_id":"9b550f01-b106-4a13-bbe0-6dbff00084df"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:49eae86d6ed5718218971d1c565aed96ee011e6948a06be8e75d927d777c1641","target":"record","created_at":"2026-05-18T02:44:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"53369c60f99a84e2d7edfb95564554667a3fbe94f3656a8dcd1a53b0888d7f2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T14:35:31Z","title_canon_sha256":"56ec71ba0809b46f7455cae7774de84fa51c0fa451e7e1cb1ca712a53841b1ed"},"schema_version":"1.0","source":{"id":"2605.13600","kind":"arxiv","version":1}},"canonical_sha256":"4d16d24f8154742621d80327850d2a9445da6c13d8c16542979e51a885de64b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d16d24f8154742621d80327850d2a9445da6c13d8c16542979e51a885de64b8","first_computed_at":"2026-05-18T02:44:22.942376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:22.942376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jBQWUn1J7hbxY8RcTDVKG9yaWqcIvP2A9YUn6atqtdYF5li1E+070Nx8Ib0lIthwSpgvhlClGNSN4CvcmMnLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:22.942783Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49eae86d6ed5718218971d1c565aed96ee011e6948a06be8e75d927d777c1641","sha256:faca41055918d57a73ada5aa82a2bfed88be91bbc36489066888f67a6f733b23"],"state_sha256":"89d921e3e260319fb12b97c6323644b44e1d522271c1b12a0953e7ddf0f25848"}