{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FWXRSEIVGZ2KPTBASJN4QH7LP6","short_pith_number":"pith:FWXRSEIV","schema_version":"1.0","canonical_sha256":"2daf1911153674a7cc20925bc81feb7fa63d964c3aeac07f7b9c53dd0e7637e2","source":{"kind":"arxiv","id":"2501.08880","version":2},"attestation_state":"computed","paper":{"title":"SLC$^2$-SLAM: Semantic-guided Loop Closure using Shared Latent Code for NeRF SLAM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Di Ma, Guofeng Zhang, Han Yang, Rui Fan, Wanzeng Kong, Weichen Dai, Yuhang Ming","submitted_at":"2025-01-15T15:51:06Z","abstract_excerpt":"Targeting the notorious cumulative drift errors in NeRF SLAM, we propose a Semantic-guided Loop Closure using Shared Latent Code, dubbed SLC$^2$-SLAM. We argue that latent codes stored in many NeRF SLAM systems are not fully exploited, as they are only used for better reconstruction. In this paper, we propose a simple yet effective way to detect potential loops using the same latent codes as local features. To further improve the loop detection performance, we use the semantic information, which are also decoded from the same latent codes to guide the aggregation of local features. Finally, wi"},"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":"2501.08880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-01-15T15:51:06Z","cross_cats_sorted":[],"title_canon_sha256":"5f697916c8856150400a40918e67a31a6d54dc35f6fdc087e0855948109b2f74","abstract_canon_sha256":"755bcd2d8019f43f2cffc8b1d9ece5853f390f1ac8ab4c4bece6f374a5f7d92c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:42.403513Z","signature_b64":"dZBYpq4+LoHuqwXtM0xjVpKW1AErg5ILAPXZOW6ZoH+fGjkFcsdLMK3GFusRYLBuVAFWUJomfIk0SbGQvYx5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2daf1911153674a7cc20925bc81feb7fa63d964c3aeac07f7b9c53dd0e7637e2","last_reissued_at":"2026-07-05T10:33:42.402982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:42.402982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SLC$^2$-SLAM: Semantic-guided Loop Closure using Shared Latent Code for NeRF SLAM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Di Ma, Guofeng Zhang, Han Yang, Rui Fan, Wanzeng Kong, Weichen Dai, Yuhang Ming","submitted_at":"2025-01-15T15:51:06Z","abstract_excerpt":"Targeting the notorious cumulative drift errors in NeRF SLAM, we propose a Semantic-guided Loop Closure using Shared Latent Code, dubbed SLC$^2$-SLAM. We argue that latent codes stored in many NeRF SLAM systems are not fully exploited, as they are only used for better reconstruction. In this paper, we propose a simple yet effective way to detect potential loops using the same latent codes as local features. To further improve the loop detection performance, we use the semantic information, which are also decoded from the same latent codes to guide the aggregation of local features. Finally, wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08880","kind":"arxiv","version":2},"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/2501.08880/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":"2501.08880","created_at":"2026-07-05T10:33:42.403040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.08880v2","created_at":"2026-07-05T10:33:42.403040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08880","created_at":"2026-07-05T10:33:42.403040+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWXRSEIVGZ2K","created_at":"2026-07-05T10:33:42.403040+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWXRSEIVGZ2KPTBA","created_at":"2026-07-05T10:33:42.403040+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWXRSEIV","created_at":"2026-07-05T10:33:42.403040+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/FWXRSEIVGZ2KPTBASJN4QH7LP6","json":"https://pith.science/pith/FWXRSEIVGZ2KPTBASJN4QH7LP6.json","graph_json":"https://pith.science/api/pith-number/FWXRSEIVGZ2KPTBASJN4QH7LP6/graph.json","events_json":"https://pith.science/api/pith-number/FWXRSEIVGZ2KPTBASJN4QH7LP6/events.json","paper":"https://pith.science/paper/FWXRSEIV"},"agent_actions":{"view_html":"https://pith.science/pith/FWXRSEIVGZ2KPTBASJN4QH7LP6","download_json":"https://pith.science/pith/FWXRSEIVGZ2KPTBASJN4QH7LP6.json","view_paper":"https://pith.science/paper/FWXRSEIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.08880&json=true","fetch_graph":"https://pith.science/api/pith-number/FWXRSEIVGZ2KPTBASJN4QH7LP6/graph.json","fetch_events":"https://pith.science/api/pith-number/FWXRSEIVGZ2KPTBASJN4QH7LP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWXRSEIVGZ2KPTBASJN4QH7LP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWXRSEIVGZ2KPTBASJN4QH7LP6/action/storage_attestation","attest_author":"https://pith.science/pith/FWXRSEIVGZ2KPTBASJN4QH7LP6/action/author_attestation","sign_citation":"https://pith.science/pith/FWXRSEIVGZ2KPTBASJN4QH7LP6/action/citation_signature","submit_replication":"https://pith.science/pith/FWXRSEIVGZ2KPTBASJN4QH7LP6/action/replication_record"}},"created_at":"2026-07-05T10:33:42.403040+00:00","updated_at":"2026-07-05T10:33:42.403040+00:00"}