{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PGM4W4PWCQP65HDGZIO6DDTZ7X","short_pith_number":"pith:PGM4W4PW","schema_version":"1.0","canonical_sha256":"7999cb71f6141fee9c66ca1de18e79fdffd33d66622d99f93d516ba6063eadb4","source":{"kind":"arxiv","id":"2208.00214","version":1},"attestation_state":"computed","paper":{"title":"Towards Privacy-Preserving, Real-Time and Lossless Feature Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Feng Zhou, Qiang Meng","submitted_at":"2022-07-30T13:25:59Z","abstract_excerpt":"Most visual retrieval applications store feature vectors for downstream matching tasks. These vectors, from where user information can be spied out, will cause privacy leakage if not carefully protected. To mitigate privacy risks, current works primarily utilize non-invertible transformations or fully cryptographic algorithms. However, transformation-based methods usually fail to achieve satisfying matching performances while cryptosystems suffer from heavy computational overheads. In addition, secure levels of current methods should be improved to confront potential adversary attacks. To addr"},"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":"2208.00214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-07-30T13:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"098019006f54ffd76ba0ad4a14bc93d5dc92d4e00e0182328e4060c6cdfad6f6","abstract_canon_sha256":"d79797e6fb4e834d92eaec2e8f3946e542693db12f7da2978e9917d7b76149ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:49.004579Z","signature_b64":"5mXSRCTi0eTRm53jmABjo+RNFj8ThePBgARuSapiMCuxrvS7+8zAn9s8YUOUOl8w+dWmG8qcQYw80J4JLvbWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7999cb71f6141fee9c66ca1de18e79fdffd33d66622d99f93d516ba6063eadb4","last_reissued_at":"2026-07-05T04:44:49.004131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:49.004131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Privacy-Preserving, Real-Time and Lossless Feature Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Feng Zhou, Qiang Meng","submitted_at":"2022-07-30T13:25:59Z","abstract_excerpt":"Most visual retrieval applications store feature vectors for downstream matching tasks. These vectors, from where user information can be spied out, will cause privacy leakage if not carefully protected. To mitigate privacy risks, current works primarily utilize non-invertible transformations or fully cryptographic algorithms. However, transformation-based methods usually fail to achieve satisfying matching performances while cryptosystems suffer from heavy computational overheads. In addition, secure levels of current methods should be improved to confront potential adversary attacks. To addr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.00214","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/2208.00214/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":"2208.00214","created_at":"2026-07-05T04:44:49.004200+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.00214v1","created_at":"2026-07-05T04:44:49.004200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.00214","created_at":"2026-07-05T04:44:49.004200+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGM4W4PWCQP6","created_at":"2026-07-05T04:44:49.004200+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGM4W4PWCQP65HDG","created_at":"2026-07-05T04:44:49.004200+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGM4W4PW","created_at":"2026-07-05T04:44:49.004200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12050","citing_title":"IDFace: Face Template Protection for Efficient and Secure Identification","ref_index":77,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X","json":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X.json","graph_json":"https://pith.science/api/pith-number/PGM4W4PWCQP65HDGZIO6DDTZ7X/graph.json","events_json":"https://pith.science/api/pith-number/PGM4W4PWCQP65HDGZIO6DDTZ7X/events.json","paper":"https://pith.science/paper/PGM4W4PW"},"agent_actions":{"view_html":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X","download_json":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X.json","view_paper":"https://pith.science/paper/PGM4W4PW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.00214&json=true","fetch_graph":"https://pith.science/api/pith-number/PGM4W4PWCQP65HDGZIO6DDTZ7X/graph.json","fetch_events":"https://pith.science/api/pith-number/PGM4W4PWCQP65HDGZIO6DDTZ7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X/action/storage_attestation","attest_author":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X/action/author_attestation","sign_citation":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X/action/citation_signature","submit_replication":"https://pith.science/pith/PGM4W4PWCQP65HDGZIO6DDTZ7X/action/replication_record"}},"created_at":"2026-07-05T04:44:49.004200+00:00","updated_at":"2026-07-05T04:44:49.004200+00:00"}