{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5F2JMZXSBMACNEWRW34LNJ4277","short_pith_number":"pith:5F2JMZXS","schema_version":"1.0","canonical_sha256":"e9749666f20b002692d1b6f8b6a79afff8543ca9ada8d2f834c0a0b34f268cda","source":{"kind":"arxiv","id":"2501.19382","version":1},"attestation_state":"computed","paper":{"title":"LiDAR Loop Closure Detection using Semantic Graphs with Graph Attention Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Ignacio Alzugaray, Liudi Yang, Marco Karrer, Margarita Chli, Ruben Mascaro, Sai Manoj Prakhya, Ziyuan Liu","submitted_at":"2025-01-31T18:36:04Z","abstract_excerpt":"In this paper, we propose a novel loop closure detection algorithm that uses graph attention neural networks to encode semantic graphs to perform place recognition and then use semantic registration to estimate the 6 DoF relative pose constraint. Our place recognition algorithm has two key modules, namely, a semantic graph encoder module and a graph comparison module. The semantic graph encoder employs graph attention networks to efficiently encode spatial, semantic and geometric information from the semantic graph of the input point cloud. We then use self-attention mechanism in both node-emb"},"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.19382","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2025-01-31T18:36:04Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"742690d088fd892336d5e7910f13a2d72a93062955e0e22b5fb4897427e7bacc","abstract_canon_sha256":"18fef5e92273c666636e6bb68348dc2aa6360fa22af10c487eb71c4ff5ae32b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:00.350655Z","signature_b64":"HnuQ+ApnFGXIX9iqaeOoUxvzrUDk5Rr0vNIB7PwXb5YjKj2bg8o2ipfrtz0JBiSkNIL3r1ZHZ8eCb+VKvvoxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9749666f20b002692d1b6f8b6a79afff8543ca9ada8d2f834c0a0b34f268cda","last_reissued_at":"2026-07-05T10:08:00.350061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:00.350061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LiDAR Loop Closure Detection using Semantic Graphs with Graph Attention Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Ignacio Alzugaray, Liudi Yang, Marco Karrer, Margarita Chli, Ruben Mascaro, Sai Manoj Prakhya, Ziyuan Liu","submitted_at":"2025-01-31T18:36:04Z","abstract_excerpt":"In this paper, we propose a novel loop closure detection algorithm that uses graph attention neural networks to encode semantic graphs to perform place recognition and then use semantic registration to estimate the 6 DoF relative pose constraint. Our place recognition algorithm has two key modules, namely, a semantic graph encoder module and a graph comparison module. The semantic graph encoder employs graph attention networks to efficiently encode spatial, semantic and geometric information from the semantic graph of the input point cloud. We then use self-attention mechanism in both node-emb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19382","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/2501.19382/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.19382","created_at":"2026-07-05T10:08:00.350131+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.19382v1","created_at":"2026-07-05T10:08:00.350131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19382","created_at":"2026-07-05T10:08:00.350131+00:00"},{"alias_kind":"pith_short_12","alias_value":"5F2JMZXSBMAC","created_at":"2026-07-05T10:08:00.350131+00:00"},{"alias_kind":"pith_short_16","alias_value":"5F2JMZXSBMACNEWR","created_at":"2026-07-05T10:08:00.350131+00:00"},{"alias_kind":"pith_short_8","alias_value":"5F2JMZXS","created_at":"2026-07-05T10:08:00.350131+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/5F2JMZXSBMACNEWRW34LNJ4277","json":"https://pith.science/pith/5F2JMZXSBMACNEWRW34LNJ4277.json","graph_json":"https://pith.science/api/pith-number/5F2JMZXSBMACNEWRW34LNJ4277/graph.json","events_json":"https://pith.science/api/pith-number/5F2JMZXSBMACNEWRW34LNJ4277/events.json","paper":"https://pith.science/paper/5F2JMZXS"},"agent_actions":{"view_html":"https://pith.science/pith/5F2JMZXSBMACNEWRW34LNJ4277","download_json":"https://pith.science/pith/5F2JMZXSBMACNEWRW34LNJ4277.json","view_paper":"https://pith.science/paper/5F2JMZXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.19382&json=true","fetch_graph":"https://pith.science/api/pith-number/5F2JMZXSBMACNEWRW34LNJ4277/graph.json","fetch_events":"https://pith.science/api/pith-number/5F2JMZXSBMACNEWRW34LNJ4277/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5F2JMZXSBMACNEWRW34LNJ4277/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5F2JMZXSBMACNEWRW34LNJ4277/action/storage_attestation","attest_author":"https://pith.science/pith/5F2JMZXSBMACNEWRW34LNJ4277/action/author_attestation","sign_citation":"https://pith.science/pith/5F2JMZXSBMACNEWRW34LNJ4277/action/citation_signature","submit_replication":"https://pith.science/pith/5F2JMZXSBMACNEWRW34LNJ4277/action/replication_record"}},"created_at":"2026-07-05T10:08:00.350131+00:00","updated_at":"2026-07-05T10:08:00.350131+00:00"}