{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4FAUH5K6IABVFAN6OA24AAFQS6","short_pith_number":"pith:4FAUH5K6","schema_version":"1.0","canonical_sha256":"e14143f55e40035281be7035c000b097a1e6a323b39e7b57fae023b67aad66dc","source":{"kind":"arxiv","id":"2205.14275","version":1},"attestation_state":"computed","paper":{"title":"Image Keypoint Matching using Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Giannis Nikolentzos, Henrik Bostr\\\"om, Michalis Vazirgiannis, Nancy Xu","submitted_at":"2022-05-27T23:38:44Z","abstract_excerpt":"Image matching is a key component of many tasks in computer vision and its main objective is to find correspondences between features extracted from different natural images. When images are represented as graphs, image matching boils down to the problem of graph matching which has been studied intensively in the past. In recent years, graph neural networks have shown great potential in the graph matching task, and have also been applied to image matching. In this paper, we propose a graph neural network for the problem of image matching. The proposed method first generates initial soft corres"},"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":"2205.14275","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-05-27T23:38:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8b36a6b2339643ab97cd6863cb6934d26dcffb81fdc59249575c4f6b16a0db0a","abstract_canon_sha256":"6ed5bf0724fdd2cf37343d21240768d015d183d6b108103f3d6dbf764d76a7fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:15.717347Z","signature_b64":"VsSSAmnAfK2147/DUKT1YprZNYSafELlCcFs0GeEZvVy6WRPzzFp2HLyhe6JjowAsjU3MBnbSuxstnoI1o7iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e14143f55e40035281be7035c000b097a1e6a323b39e7b57fae023b67aad66dc","last_reissued_at":"2026-07-05T04:27:15.716927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:15.716927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Image Keypoint Matching using Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Giannis Nikolentzos, Henrik Bostr\\\"om, Michalis Vazirgiannis, Nancy Xu","submitted_at":"2022-05-27T23:38:44Z","abstract_excerpt":"Image matching is a key component of many tasks in computer vision and its main objective is to find correspondences between features extracted from different natural images. When images are represented as graphs, image matching boils down to the problem of graph matching which has been studied intensively in the past. In recent years, graph neural networks have shown great potential in the graph matching task, and have also been applied to image matching. In this paper, we propose a graph neural network for the problem of image matching. The proposed method first generates initial soft corres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14275","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/2205.14275/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":"2205.14275","created_at":"2026-07-05T04:27:15.716985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.14275v1","created_at":"2026-07-05T04:27:15.716985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14275","created_at":"2026-07-05T04:27:15.716985+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FAUH5K6IABV","created_at":"2026-07-05T04:27:15.716985+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FAUH5K6IABVFAN6","created_at":"2026-07-05T04:27:15.716985+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FAUH5K6","created_at":"2026-07-05T04:27:15.716985+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/4FAUH5K6IABVFAN6OA24AAFQS6","json":"https://pith.science/pith/4FAUH5K6IABVFAN6OA24AAFQS6.json","graph_json":"https://pith.science/api/pith-number/4FAUH5K6IABVFAN6OA24AAFQS6/graph.json","events_json":"https://pith.science/api/pith-number/4FAUH5K6IABVFAN6OA24AAFQS6/events.json","paper":"https://pith.science/paper/4FAUH5K6"},"agent_actions":{"view_html":"https://pith.science/pith/4FAUH5K6IABVFAN6OA24AAFQS6","download_json":"https://pith.science/pith/4FAUH5K6IABVFAN6OA24AAFQS6.json","view_paper":"https://pith.science/paper/4FAUH5K6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.14275&json=true","fetch_graph":"https://pith.science/api/pith-number/4FAUH5K6IABVFAN6OA24AAFQS6/graph.json","fetch_events":"https://pith.science/api/pith-number/4FAUH5K6IABVFAN6OA24AAFQS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FAUH5K6IABVFAN6OA24AAFQS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FAUH5K6IABVFAN6OA24AAFQS6/action/storage_attestation","attest_author":"https://pith.science/pith/4FAUH5K6IABVFAN6OA24AAFQS6/action/author_attestation","sign_citation":"https://pith.science/pith/4FAUH5K6IABVFAN6OA24AAFQS6/action/citation_signature","submit_replication":"https://pith.science/pith/4FAUH5K6IABVFAN6OA24AAFQS6/action/replication_record"}},"created_at":"2026-07-05T04:27:15.716985+00:00","updated_at":"2026-07-05T04:27:15.716985+00:00"}