{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HRVHDOQJ2VBELJYNNQZ3EDIILF","short_pith_number":"pith:HRVHDOQJ","schema_version":"1.0","canonical_sha256":"3c6a71ba09d54245a70d6c33b20d08597923103e26fe9bc1215fddfc9c970db8","source":{"kind":"arxiv","id":"2511.15706","version":3},"attestation_state":"computed","paper":{"title":"RoMa v2: Harder Better Faster Denser Feature Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anders Heyden, David Nordstr\\\"om, Fredrik Kahl, Georg B\\\"okman, Johan Edstedt, Jonathan Astermark, M{\\aa}rten Wadenb\\\"ack, Michael Felsberg, Viktor Larsson, Yushan Zhang","submitted_at":"2025-11-19T18:59:38Z","abstract_excerpt":"Dense feature matching aims to estimate all correspondences between two images of a 3D scene and has recently been established as the gold standard due to its high accuracy and robustness. However, existing dense matchers still fail or perform poorly for many hard real-world scenarios, and high-precision models are often slow, limiting their applicability. In this paper, we attack these weaknesses on a wide front through a series of systematic improvements that together yield a significantly better model. In particular, we construct a novel matching architecture and loss, which, combined with "},"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":"2511.15706","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-11-19T18:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"1958032e01c7d2f8605bae9da750e37e9d8853e9a420c455b4286051fd205f3e","abstract_canon_sha256":"69c3227563568ca1daf875b3cce4f81e774245e53b4b9fe8fe7db4a3545f5e82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:42.299768Z","signature_b64":"cuVT/aYi8w3vmK0xexuQmW2BDSDhIz2NgyR1XdhB99a9V0CfUK6giJtHW8WQnEkKpXFOLklk5hNthIbCh34pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c6a71ba09d54245a70d6c33b20d08597923103e26fe9bc1215fddfc9c970db8","last_reissued_at":"2026-07-07T02:19:42.298742Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:42.298742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RoMa v2: Harder Better Faster Denser Feature Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anders Heyden, David Nordstr\\\"om, Fredrik Kahl, Georg B\\\"okman, Johan Edstedt, Jonathan Astermark, M{\\aa}rten Wadenb\\\"ack, Michael Felsberg, Viktor Larsson, Yushan Zhang","submitted_at":"2025-11-19T18:59:38Z","abstract_excerpt":"Dense feature matching aims to estimate all correspondences between two images of a 3D scene and has recently been established as the gold standard due to its high accuracy and robustness. However, existing dense matchers still fail or perform poorly for many hard real-world scenarios, and high-precision models are often slow, limiting their applicability. In this paper, we attack these weaknesses on a wide front through a series of systematic improvements that together yield a significantly better model. In particular, we construct a novel matching architecture and loss, which, combined with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.15706","kind":"arxiv","version":3},"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/2511.15706/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":"2511.15706","created_at":"2026-07-07T02:19:42.298916+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.15706v3","created_at":"2026-07-07T02:19:42.298916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.15706","created_at":"2026-07-07T02:19:42.298916+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRVHDOQJ2VBE","created_at":"2026-07-07T02:19:42.298916+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRVHDOQJ2VBELJYN","created_at":"2026-07-07T02:19:42.298916+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRVHDOQJ","created_at":"2026-07-07T02:19:42.298916+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":14,"sample":[{"citing_arxiv_id":"2606.25245","citing_title":"OrthoTrack: Continuous 6-DoF UAV Trajectory Estimation Anchored in Public Orthophotos","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24330","citing_title":"REDI-Match: Rotation-Equivariant Distillation for Efficient and Robust Dense Matching","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2606.16917","citing_title":"Unified Motion-Action Modeling for Heterogeneous Robot Learning","ref_index":65,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11880","citing_title":"SG2Loc: Sequential Visual Localization on 3D Scene Graphs","ref_index":74,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03337","citing_title":"FreeTimeGS++: Secrets of Dynamic Gaussian Splatting and Their Principles","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2606.08284","citing_title":"G2G: Exploiting Intra-Group Geometry for Inter-Group Pose Estimation","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2606.31388","citing_title":"One Video, One World: Turning Monocular Video into Physical 4D Scenes","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24330","citing_title":"REDI-Match: Rotation-Equivariant Distillation for Efficient and Robust Dense Matching","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03337","citing_title":"FreeTimeGS++: Secrets of Dynamic Gaussian Splatting and Their Principles","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2606.25245","citing_title":"OrthoTrack: Continuous 6-DoF UAV Trajectory Estimation Anchored in Public Orthophotos","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2603.28287","citing_title":"TerraSky3D: Multi-View Reconstructions of European Landmarks in 4K","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2604.11809","citing_title":"Who Handles Orientation? Investigating Invariance in Feature Matching","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.12068","citing_title":"Privacy-Preserving Structureless Visual Localization via Image Obfuscation","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04931","citing_title":"LoMa: Local Feature Matching Revisited","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF","json":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF.json","graph_json":"https://pith.science/api/pith-number/HRVHDOQJ2VBELJYNNQZ3EDIILF/graph.json","events_json":"https://pith.science/api/pith-number/HRVHDOQJ2VBELJYNNQZ3EDIILF/events.json","paper":"https://pith.science/paper/HRVHDOQJ"},"agent_actions":{"view_html":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF","download_json":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF.json","view_paper":"https://pith.science/paper/HRVHDOQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.15706&json=true","fetch_graph":"https://pith.science/api/pith-number/HRVHDOQJ2VBELJYNNQZ3EDIILF/graph.json","fetch_events":"https://pith.science/api/pith-number/HRVHDOQJ2VBELJYNNQZ3EDIILF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF/action/storage_attestation","attest_author":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF/action/author_attestation","sign_citation":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF/action/citation_signature","submit_replication":"https://pith.science/pith/HRVHDOQJ2VBELJYNNQZ3EDIILF/action/replication_record"}},"created_at":"2026-07-07T02:19:42.298916+00:00","updated_at":"2026-07-07T02:19:42.298916+00:00"}