{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PJAAHZFCZYKF6D2IFHNE2LKOJN","short_pith_number":"pith:PJAAHZFC","schema_version":"1.0","canonical_sha256":"7a4003e4a2ce145f0f4829da4d2d4e4b7e4320f23a5206ca2a8601d303a9a380","source":{"kind":"arxiv","id":"1906.06195","version":2},"attestation_state":"computed","paper":{"title":"R2D2: Repeatable and Reliable Detector and Descriptor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"C\\'esar De Souza, Gabriela Csurka, Jerome Revaud, Martin Humenberger, Noe Pion, Philippe Weinzaepfel, Yohann Cabon","submitted_at":"2019-06-14T13:30:40Z","abstract_excerpt":"Interest point detection and local feature description are fundamental steps in many computer vision applications. Classical methods for these tasks are based on a detect-then-describe paradigm where separate handcrafted methods are used to first identify repeatable keypoints and then represent them with a local descriptor. Neural networks trained with metric learning losses have recently caught up with these techniques, focusing on learning repeatable saliency maps for keypoint detection and learning descriptors at the detected keypoint locations. In this work, we argue that salient regions a"},"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":"1906.06195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-14T13:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"d573d2f369e197ba250fe2f50e1df6c7ee30c550ffc32a94f522dbf1436cc542","abstract_canon_sha256":"9c8d8751fe87d7ce3cf0f8b7aa878f69d6486d8e053988b124b75563ba94b1af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:13.981644Z","signature_b64":"qh98rJXLrU6UwXx8E1d8dVdx5PikPtcxiFNfgbdlpT/zFFgOrXs4B8gU9vOK89F5CKJ7uT2KDSyrVqRg4f6SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a4003e4a2ce145f0f4829da4d2d4e4b7e4320f23a5206ca2a8601d303a9a380","last_reissued_at":"2026-05-17T23:43:13.981102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:13.981102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"R2D2: Repeatable and Reliable Detector and Descriptor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"C\\'esar De Souza, Gabriela Csurka, Jerome Revaud, Martin Humenberger, Noe Pion, Philippe Weinzaepfel, Yohann Cabon","submitted_at":"2019-06-14T13:30:40Z","abstract_excerpt":"Interest point detection and local feature description are fundamental steps in many computer vision applications. Classical methods for these tasks are based on a detect-then-describe paradigm where separate handcrafted methods are used to first identify repeatable keypoints and then represent them with a local descriptor. Neural networks trained with metric learning losses have recently caught up with these techniques, focusing on learning repeatable saliency maps for keypoint detection and learning descriptors at the detected keypoint locations. In this work, we argue that salient regions a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06195","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1906.06195","created_at":"2026-05-17T23:43:13.981181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06195v2","created_at":"2026-05-17T23:43:13.981181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06195","created_at":"2026-05-17T23:43:13.981181+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJAAHZFCZYKF","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJAAHZFCZYKF6D2I","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJAAHZFC","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.18052","citing_title":"Efficient 3D Content Reconstruction and Generation","ref_index":201,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN","json":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN.json","graph_json":"https://pith.science/api/pith-number/PJAAHZFCZYKF6D2IFHNE2LKOJN/graph.json","events_json":"https://pith.science/api/pith-number/PJAAHZFCZYKF6D2IFHNE2LKOJN/events.json","paper":"https://pith.science/paper/PJAAHZFC"},"agent_actions":{"view_html":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN","download_json":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN.json","view_paper":"https://pith.science/paper/PJAAHZFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06195&json=true","fetch_graph":"https://pith.science/api/pith-number/PJAAHZFCZYKF6D2IFHNE2LKOJN/graph.json","fetch_events":"https://pith.science/api/pith-number/PJAAHZFCZYKF6D2IFHNE2LKOJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN/action/storage_attestation","attest_author":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN/action/author_attestation","sign_citation":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN/action/citation_signature","submit_replication":"https://pith.science/pith/PJAAHZFCZYKF6D2IFHNE2LKOJN/action/replication_record"}},"created_at":"2026-05-17T23:43:13.981181+00:00","updated_at":"2026-05-17T23:43:13.981181+00:00"}