{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:2SV3NRA6BNLOZTFVGHQODU5E55","short_pith_number":"pith:2SV3NRA6","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"},"canonical_sha256":"d4abb6c41e0b56ecccb531e0e1d3a4ef56521a7056ae8d4e44a2a37df9e4d63e","source":{"kind":"arxiv","id":"2310.11755","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11755","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11755v4","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11755","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"2SV3NRA6BNLO","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"pith_short_16","alias_value":"2SV3NRA6BNLOZTFV","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"pith_short_8","alias_value":"2SV3NRA6","created_at":"2026-07-05T07:56:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:2SV3NRA6BNLOZTFVGHQODU5E55","target":"record","payload":{"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"},"canonical_sha256":"d4abb6c41e0b56ecccb531e0e1d3a4ef56521a7056ae8d4e44a2a37df9e4d63e","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"},"source_kind":"arxiv","source_id":"2310.11755","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTzKsbn9cO0WNSY/doJFZ0RtFR8jMn3nuy5cNrObVG5Y1iUqvbeJRrDvQgen1wJcXzQZaldwVxwVw+j8VkP6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T14:49:45.193739Z"},"content_sha256":"382938b065a86cea25651a0b6cf411501d4d940edca1d20f1607f0c922843000","schema_version":"1.0","event_id":"sha256:382938b065a86cea25651a0b6cf411501d4d940edca1d20f1607f0c922843000"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:2SV3NRA6BNLOZTFVGHQODU5E55","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2+J0ccqH1CECCe9ELsoDhn5tTyjJDw2amSMXRzHw41DHTqBhE7354HGzr4lxfyOi7oet2WRrJ419DnhL9OOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T14:49:45.194384Z"},"content_sha256":"3492467db68e7389ae1d1142160f7edb75fd7cf2ea7a1ff14f467fcb3e6ac334","schema_version":"1.0","event_id":"sha256:3492467db68e7389ae1d1142160f7edb75fd7cf2ea7a1ff14f467fcb3e6ac334"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/bundle.json","state_url":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SV3NRA6BNLOZTFVGHQODU5E55/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T14:49:45Z","links":{"resolver":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55","bundle":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/bundle.json","state":"https://pith.science/pith/2SV3NRA6BNLOZTFVGHQODU5E55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SV3NRA6BNLOZTFVGHQODU5E55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2SV3NRA6BNLOZTFVGHQODU5E55","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2cc5126a01de1940c2420be4f01842f6d670e7d5ac2857ec3e78cf2804f9a1bc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2023-10-18T07:30:08Z","title_canon_sha256":"8ce21ecf6cf02036abdf6b114cfdd1b85744d3f055a28b8f0d4bb40514b04b7c"},"schema_version":"1.0","source":{"id":"2310.11755","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11755","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11755v4","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11755","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"2SV3NRA6BNLO","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"pith_short_16","alias_value":"2SV3NRA6BNLOZTFV","created_at":"2026-07-05T07:56:18Z"},{"alias_kind":"pith_short_8","alias_value":"2SV3NRA6","created_at":"2026-07-05T07:56:18Z"}],"graph_snapshots":[{"event_id":"sha256:3492467db68e7389ae1d1142160f7edb75fd7cf2ea7a1ff14f467fcb3e6ac334","target":"graph","created_at":"2026-07-05T07:56:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.11755/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bo Li, Chunhua Shen, Hao Chen, Songyan Zhang, Xinyu Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2023-10-18T07:30:08Z","title":"RGM: A Robust Generalizable Matching Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11755","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:382938b065a86cea25651a0b6cf411501d4d940edca1d20f1607f0c922843000","target":"record","created_at":"2026-07-05T07:56:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2cc5126a01de1940c2420be4f01842f6d670e7d5ac2857ec3e78cf2804f9a1bc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2023-10-18T07:30:08Z","title_canon_sha256":"8ce21ecf6cf02036abdf6b114cfdd1b85744d3f055a28b8f0d4bb40514b04b7c"},"schema_version":"1.0","source":{"id":"2310.11755","kind":"arxiv","version":4}},"canonical_sha256":"d4abb6c41e0b56ecccb531e0e1d3a4ef56521a7056ae8d4e44a2a37df9e4d63e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4abb6c41e0b56ecccb531e0e1d3a4ef56521a7056ae8d4e44a2a37df9e4d63e","first_computed_at":"2026-07-05T07:56:18.056979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:56:18.056979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zLljvwmQQSYTVnu5yVfXrylc3mPgNFNUmVqEpYP+rCkhOco4GTvXGaf/V0lPB13YC9luf9m/Wm3QKFWmqZGMBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:56:18.057500Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.11755","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:382938b065a86cea25651a0b6cf411501d4d940edca1d20f1607f0c922843000","sha256:3492467db68e7389ae1d1142160f7edb75fd7cf2ea7a1ff14f467fcb3e6ac334"],"state_sha256":"b979c8be08f9d9b4d317e03fe581361f37d5caf588794f0df5199844ed2ac1ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRtsJCxcW13I7UVaSW4aGJ33ihcatkF39hyx+xeIPwMKG61HWEbyogUcEfxwQr8YNxRejsXtKrncGBUPslJFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T14:49:45.199669Z","bundle_sha256":"43a1db12a691b4537e927445cd9f0dae30a90658b31af06dbb87bf7d7f9a8133"}}