{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PWMCBA42QRI2TLIZVSDWO6X2BL","short_pith_number":"pith:PWMCBA42","schema_version":"1.0","canonical_sha256":"7d9820839a8451a9ad19ac87677afa0af609dd3683ea1c4a14f5600f8bb07727","source":{"kind":"arxiv","id":"2302.08466","version":2},"attestation_state":"computed","paper":{"title":"Marich: A Query-efficient Distributionally Equivalent Model Extraction Attack using Public Data","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Debabrota Basu, Pratik Karmakar","submitted_at":"2023-02-16T18:20:27Z","abstract_excerpt":"We study design of black-box model extraction attacks that can send minimal number of queries from a publicly available dataset to a target ML model through a predictive API with an aim to create an informative and distributionally equivalent replica of the target. First, we define distributionally equivalent and Max-Information model extraction attacks, and reduce them into a variational optimisation problem. The attacker sequentially solves this optimisation problem to select the most informative queries that simultaneously maximise the entropy and reduce the mismatch between the target and "},"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":"2302.08466","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-16T18:20:27Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"94e6b4d9bbefd4dccaa7b5cf04684e20b079a7a82aae6ae4b2f2c68620bf86d0","abstract_canon_sha256":"0ec08762443dcc498c6d70daac57131c7dc114abe3a80fe6513f36cd19d8f8d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:59.097735Z","signature_b64":"oHJDdKawbUZEVxT8UaTOSrSZdbbrKnAHJ8C8pk/pkz7wZ6qM9K2x2jBSnRORDXFm4PHS0eM9lcOIjB3yvPfuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d9820839a8451a9ad19ac87677afa0af609dd3683ea1c4a14f5600f8bb07727","last_reissued_at":"2026-07-05T07:01:59.097148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:59.097148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Marich: A Query-efficient Distributionally Equivalent Model Extraction Attack using Public Data","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Debabrota Basu, Pratik Karmakar","submitted_at":"2023-02-16T18:20:27Z","abstract_excerpt":"We study design of black-box model extraction attacks that can send minimal number of queries from a publicly available dataset to a target ML model through a predictive API with an aim to create an informative and distributionally equivalent replica of the target. First, we define distributionally equivalent and Max-Information model extraction attacks, and reduce them into a variational optimisation problem. The attacker sequentially solves this optimisation problem to select the most informative queries that simultaneously maximise the entropy and reduce the mismatch between the target and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08466","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/2302.08466/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":"2302.08466","created_at":"2026-07-05T07:01:59.097216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.08466v2","created_at":"2026-07-05T07:01:59.097216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08466","created_at":"2026-07-05T07:01:59.097216+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWMCBA42QRI2","created_at":"2026-07-05T07:01:59.097216+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWMCBA42QRI2TLIZ","created_at":"2026-07-05T07:01:59.097216+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWMCBA42","created_at":"2026-07-05T07:01:59.097216+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16969","citing_title":"LLM4MEA: Data-free Model Extraction Attacks on Sequential Recommenders via Large Language Models","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL","json":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL.json","graph_json":"https://pith.science/api/pith-number/PWMCBA42QRI2TLIZVSDWO6X2BL/graph.json","events_json":"https://pith.science/api/pith-number/PWMCBA42QRI2TLIZVSDWO6X2BL/events.json","paper":"https://pith.science/paper/PWMCBA42"},"agent_actions":{"view_html":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL","download_json":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL.json","view_paper":"https://pith.science/paper/PWMCBA42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.08466&json=true","fetch_graph":"https://pith.science/api/pith-number/PWMCBA42QRI2TLIZVSDWO6X2BL/graph.json","fetch_events":"https://pith.science/api/pith-number/PWMCBA42QRI2TLIZVSDWO6X2BL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL/action/storage_attestation","attest_author":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL/action/author_attestation","sign_citation":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL/action/citation_signature","submit_replication":"https://pith.science/pith/PWMCBA42QRI2TLIZVSDWO6X2BL/action/replication_record"}},"created_at":"2026-07-05T07:01:59.097216+00:00","updated_at":"2026-07-05T07:01:59.097216+00:00"}