{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2SV3NRA6BNLOZTFVGHQODU5E55","short_pith_number":"pith:2SV3NRA6","schema_version":"1.0","canonical_sha256":"d4abb6c41e0b56ecccb531e0e1d3a4ef56521a7056ae8d4e44a2a37df9e4d63e","source":{"kind":"arxiv","id":"2310.11755","version":4},"attestation_state":"computed","paper":{"title":"RGM: A Robust Generalizable Matching Model","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bo Li, Chunhua Shen, Hao Chen, Songyan Zhang, Xinyu Sun","submitted_at":"2023-10-18T07:30:08Z","abstract_excerpt":"Finding corresponding pixels within a pair of images is a fundamental computer vision task with various applications. Due to the specific requirements of different tasks like optical flow estimation and local feature matching, previous works are primarily categorized into dense matching and sparse feature matching focusing on specialized architectures along with task-specific datasets, which may somewhat hinder the generalization performance of specialized models. In this paper, we propose a deep model for sparse and dense matching, termed RGM (Robust Generalist Matching). In particular, we el"},"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":"2310.11755","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2023-10-18T07:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"8ce21ecf6cf02036abdf6b114cfdd1b85744d3f055a28b8f0d4bb40514b04b7c","abstract_canon_sha256":"2cc5126a01de1940c2420be4f01842f6d670e7d5ac2857ec3e78cf2804f9a1bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:18.057500Z","signature_b64":"zLljvwmQQSYTVnu5yVfXrylc3mPgNFNUmVqEpYP+rCkhOco4GTvXGaf/V0lPB13YC9luf9m/Wm3QKFWmqZGMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4abb6c41e0b56ecccb531e0e1d3a4ef56521a7056ae8d4e44a2a37df9e4d63e","last_reissued_at":"2026-07-05T07:56:18.056979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:18.056979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RGM: A Robust Generalizable Matching Model","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bo Li, Chunhua Shen, Hao Chen, Songyan Zhang, Xinyu Sun","submitted_at":"2023-10-18T07:30:08Z","abstract_excerpt":"Finding corresponding pixels within a pair of images is a fundamental computer vision task with various applications. Due to the specific requirements of different tasks like optical flow estimation and local feature matching, previous works are primarily categorized into dense matching and sparse feature matching focusing on specialized architectures along with task-specific datasets, which may somewhat hinder the generalization performance of specialized models. In this paper, we propose a deep model for sparse and dense matching, termed RGM (Robust Generalist Matching). In particular, we el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11755","kind":"arxiv","version":4},"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/2310.11755/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":"2310.11755","created_at":"2026-07-05T07:56:18.057042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.11755v4","created_at":"2026-07-05T07:56:18.057042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11755","created_at":"2026-07-05T07:56:18.057042+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SV3NRA6BNLO","created_at":"2026-07-05T07:56:18.057042+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SV3NRA6BNLOZTFV","created_at":"2026-07-05T07:56:18.057042+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SV3NRA6","created_at":"2026-07-05T07:56:18.057042+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.08400","citing_title":"PanMatch: Unleashing the Potential of Large Vision Models for Unified Matching Models","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55","json":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55.json","graph_json":"https://pith.science/api/pith-number/2SV3NRA6BNLOZTFVGHQODU5E55/graph.json","events_json":"https://pith.science/api/pith-number/2SV3NRA6BNLOZTFVGHQODU5E55/events.json","paper":"https://pith.science/paper/2SV3NRA6"},"agent_actions":{"view_html":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55","download_json":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55.json","view_paper":"https://pith.science/paper/2SV3NRA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.11755&json=true","fetch_graph":"https://pith.science/api/pith-number/2SV3NRA6BNLOZTFVGHQODU5E55/graph.json","fetch_events":"https://pith.science/api/pith-number/2SV3NRA6BNLOZTFVGHQODU5E55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/action/storage_attestation","attest_author":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/action/author_attestation","sign_citation":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/action/citation_signature","submit_replication":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/action/replication_record"}},"created_at":"2026-07-05T07:56:18.057042+00:00","updated_at":"2026-07-05T07:56:18.057042+00:00"}