{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EFY3RKBPSFGZFAXR3CEO37MWFF","short_pith_number":"pith:EFY3RKBP","schema_version":"1.0","canonical_sha256":"2171b8a82f914d9282f1d888edfd96297b8fd54bc94019e69b710fd8e22e7057","source":{"kind":"arxiv","id":"2505.21754","version":1},"attestation_state":"computed","paper":{"title":"Visual Loop Closure Detection Through Deep Graph Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Abhinav Valada, Daniele Cattaneo, Kenji Nishimiya, Liza Dahiya, Martin B\\\"uchner, Simon Dorer, Vipul Ramtekkar","submitted_at":"2025-05-27T20:42:47Z","abstract_excerpt":"Visual loop closure detection traditionally relies on place recognition methods to retrieve candidate loops that are validated using computationally expensive RANSAC-based geometric verification. As false positive loop closures significantly degrade downstream pose graph estimates, verifying a large number of candidates in online simultaneous localization and mapping scenarios is constrained by limited time and compute resources. While most deep loop closure detection approaches only operate on pairs of keyframes, we relax this constraint by considering neighborhoods of multiple keyframes when"},"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":"2505.21754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-05-27T20:42:47Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"9b7d5c9713378c27d7751ec83e6049084cb092442bf57bb08b8023bfff960f26","abstract_canon_sha256":"5a476e4439ce8ab7d634bfcf7866e6c3cfc22233ed2119e6d3d98f3cf711e6e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:03.098001Z","signature_b64":"aNz3mO4ifSQFQMDOXe4UaVDKbMB1QL688XY8dtozEhPJcLBDdnUWZP1Tol6KrySj/FEk86wsx9qrpOjmjckBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2171b8a82f914d9282f1d888edfd96297b8fd54bc94019e69b710fd8e22e7057","last_reissued_at":"2026-07-05T11:11:03.097541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:03.097541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Visual Loop Closure Detection Through Deep Graph Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Abhinav Valada, Daniele Cattaneo, Kenji Nishimiya, Liza Dahiya, Martin B\\\"uchner, Simon Dorer, Vipul Ramtekkar","submitted_at":"2025-05-27T20:42:47Z","abstract_excerpt":"Visual loop closure detection traditionally relies on place recognition methods to retrieve candidate loops that are validated using computationally expensive RANSAC-based geometric verification. As false positive loop closures significantly degrade downstream pose graph estimates, verifying a large number of candidates in online simultaneous localization and mapping scenarios is constrained by limited time and compute resources. While most deep loop closure detection approaches only operate on pairs of keyframes, we relax this constraint by considering neighborhoods of multiple keyframes when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21754","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/2505.21754/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":"2505.21754","created_at":"2026-07-05T11:11:03.097612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.21754v1","created_at":"2026-07-05T11:11:03.097612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21754","created_at":"2026-07-05T11:11:03.097612+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFY3RKBPSFGZ","created_at":"2026-07-05T11:11:03.097612+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFY3RKBPSFGZFAXR","created_at":"2026-07-05T11:11:03.097612+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFY3RKBP","created_at":"2026-07-05T11:11:03.097612+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/EFY3RKBPSFGZFAXR3CEO37MWFF","json":"https://pith.science/pith/EFY3RKBPSFGZFAXR3CEO37MWFF.json","graph_json":"https://pith.science/api/pith-number/EFY3RKBPSFGZFAXR3CEO37MWFF/graph.json","events_json":"https://pith.science/api/pith-number/EFY3RKBPSFGZFAXR3CEO37MWFF/events.json","paper":"https://pith.science/paper/EFY3RKBP"},"agent_actions":{"view_html":"https://pith.science/pith/EFY3RKBPSFGZFAXR3CEO37MWFF","download_json":"https://pith.science/pith/EFY3RKBPSFGZFAXR3CEO37MWFF.json","view_paper":"https://pith.science/paper/EFY3RKBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.21754&json=true","fetch_graph":"https://pith.science/api/pith-number/EFY3RKBPSFGZFAXR3CEO37MWFF/graph.json","fetch_events":"https://pith.science/api/pith-number/EFY3RKBPSFGZFAXR3CEO37MWFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFY3RKBPSFGZFAXR3CEO37MWFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFY3RKBPSFGZFAXR3CEO37MWFF/action/storage_attestation","attest_author":"https://pith.science/pith/EFY3RKBPSFGZFAXR3CEO37MWFF/action/author_attestation","sign_citation":"https://pith.science/pith/EFY3RKBPSFGZFAXR3CEO37MWFF/action/citation_signature","submit_replication":"https://pith.science/pith/EFY3RKBPSFGZFAXR3CEO37MWFF/action/replication_record"}},"created_at":"2026-07-05T11:11:03.097612+00:00","updated_at":"2026-07-05T11:11:03.097612+00:00"}