{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EWJME4EHNL3EUXXLPSFPEBBSU4","short_pith_number":"pith:EWJME4EH","schema_version":"1.0","canonical_sha256":"2592c270876af64a5eeb7c8af20432a7184e6a7800c78a9a1562fa97c6fde583","source":{"kind":"arxiv","id":"2111.07090","version":2},"attestation_state":"computed","paper":{"title":"D$^2$LV: A Data-Driven and Local-Verification Approach for Image Copy Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Weipu Zhang, Wenhao Wang, Yifan Sun, Yi Yang","submitted_at":"2021-11-13T10:56:58Z","abstract_excerpt":"Image copy detection is of great importance in real-life social media. In this paper, a data-driven and local-verification (D$^2$LV) approach is proposed to compete for Image Similarity Challenge: Matching Track at NeurIPS'21. In D$^2$LV, unsupervised pre-training substitutes the commonly-used supervised one. When training, we design a set of basic and six advanced transformations, and a simple but effective baseline learns robust representation. During testing, a global-local and local-global matching strategy is proposed. The strategy performs local-verification between reference and query i"},"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":"2111.07090","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-11-13T10:56:58Z","cross_cats_sorted":[],"title_canon_sha256":"0d5f0d8eff293223366a22b47f7d8912f2998129a3be059ac386782ef6ed6507","abstract_canon_sha256":"84dd804cb64926a5fe888104bce441550adf04400cd8c2edf11b0058fa628cf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:47.822266Z","signature_b64":"hcqeY7FTqw2Z8bYPRs9PGe0x6POw+7cx5YlttHol3fC4xDKXUk9oJGXsoLAS2z9yeOtXZGB2bwMa4gOb350dAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2592c270876af64a5eeb7c8af20432a7184e6a7800c78a9a1562fa97c6fde583","last_reissued_at":"2026-07-05T03:37:47.821733Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:47.821733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"D$^2$LV: A Data-Driven and Local-Verification Approach for Image Copy Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Weipu Zhang, Wenhao Wang, Yifan Sun, Yi Yang","submitted_at":"2021-11-13T10:56:58Z","abstract_excerpt":"Image copy detection is of great importance in real-life social media. In this paper, a data-driven and local-verification (D$^2$LV) approach is proposed to compete for Image Similarity Challenge: Matching Track at NeurIPS'21. In D$^2$LV, unsupervised pre-training substitutes the commonly-used supervised one. When training, we design a set of basic and six advanced transformations, and a simple but effective baseline learns robust representation. During testing, a global-local and local-global matching strategy is proposed. The strategy performs local-verification between reference and query i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.07090","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.07090/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":"2111.07090","created_at":"2026-07-05T03:37:47.821802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.07090v2","created_at":"2026-07-05T03:37:47.821802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.07090","created_at":"2026-07-05T03:37:47.821802+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWJME4EHNL3E","created_at":"2026-07-05T03:37:47.821802+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWJME4EHNL3EUXXL","created_at":"2026-07-05T03:37:47.821802+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWJME4EH","created_at":"2026-07-05T03:37:47.821802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.11274","citing_title":"Agent Safety Should Be a Runtime Contract","ref_index":92,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4","json":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4.json","graph_json":"https://pith.science/api/pith-number/EWJME4EHNL3EUXXLPSFPEBBSU4/graph.json","events_json":"https://pith.science/api/pith-number/EWJME4EHNL3EUXXLPSFPEBBSU4/events.json","paper":"https://pith.science/paper/EWJME4EH"},"agent_actions":{"view_html":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4","download_json":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4.json","view_paper":"https://pith.science/paper/EWJME4EH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.07090&json=true","fetch_graph":"https://pith.science/api/pith-number/EWJME4EHNL3EUXXLPSFPEBBSU4/graph.json","fetch_events":"https://pith.science/api/pith-number/EWJME4EHNL3EUXXLPSFPEBBSU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4/action/storage_attestation","attest_author":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4/action/author_attestation","sign_citation":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4/action/citation_signature","submit_replication":"https://pith.science/pith/EWJME4EHNL3EUXXLPSFPEBBSU4/action/replication_record"}},"created_at":"2026-07-05T03:37:47.821802+00:00","updated_at":"2026-07-05T03:37:47.821802+00:00"}