{"paper":{"title":"Anonymous in Name Only: A Critical Review and a Reidentification Exercise on the European Commission's Anonymization Measures for Google Search Data under Article 6(11) of the DMA","arxiv_id":"2611.17012","primary_cat":"cs.CR","submitted_at":"2026-11-12T16:07:50+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"In July 2026, the European Commission (EC) set out the anonymization measures Alphabet must implement to share Google Search data with competing search engines under Article 6(11) of the Digital Markets Act.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.05,"main_claim_p":0.02,"quantitative":true,"quantitative_p":0.57,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.89,"id":"s1","own":false,"role":"background","text":"As the first concrete illustration of how the EC operationalizes anonymization under the EU digital rulebook, this methodology could become a regulatory benchmark.","hedge":{"p":1.0,"label":"hedged_possibility"},"own_p":0.08,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.22,"role_probabilities":{"gap":0.01,"method":0.0,"result":0.0,"background":0.89,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.07}},{"i":2,"p":0.9,"id":"s2","own":false,"role":"contribution","text":"In this paper, we show why it should not.","hedge":{"p":0.97,"label":"asserted"},"own_p":0.22,"main_claim_p":0.61,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.04,"method":0.0,"result":0.01,"background":0.03,"limitation":0.0,"future_work":0.0,"contribution":0.9,"interpretation":0.02}},{"i":3,"p":0.82,"id":"s3","own":true,"role":"contribution","text":"We critically review the anonymization measures proposed by the EC, from the characterization of residual risk to the suppression thresholds and the reliance on contractual safeguards.","hedge":{"p":0.93,"label":"asserted"},"own_p":0.86,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.18,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.82,"interpretation":0.0}},{"i":4,"p":0.64,"id":"s4","own":true,"role":"method","text":"For each of those issues, we highlight significant conceptual flaws, and, where applicable, we illustrate these flaws with empirical observations from real Google Search data provided by Alphabet and protected under the EC's measures.","hedge":{"p":0.91,"label":"asserted"},"own_p":0.91,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.64,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.36,"interpretation":0.0}},{"i":5,"p":0.7,"id":"s5","own":true,"role":"result","text":"Importantly, we present examples of low-effort reidentification, record linkage, and confidential attribute inference achieved through straightforward and automatable attack patterns.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.08,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.7,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.29,"interpretation":0.0}},{"i":6,"p":0.58,"id":"s6","own":true,"role":"interpretation","text":"Our findings show that the approach of the EC relies on unjustified heuristics rather than formal privacy guarantees, underestimates the risks inherent in free-text search queries, and sacrifices data utility without achieving meaningful protection.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.76,"quantitative":false,"quantitative_p":0.15,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.42,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.58}},{"i":7,"p":0.97,"id":"s7","own":true,"role":"result","text":"We also demonstrate that the proposed measures do not meet any of the three anonymization criteria established by the European Data Protection Board (EDPB): no record isolation, no linkage, and no inference.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.35,"quantitative":true,"quantitative_p":0.75,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.97,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.02}},{"i":8,"p":0.87,"id":"s8","own":false,"role":"interpretation","text":"Practitioners and regulators are therefore cautioned against treating these measures as a sound anonymization practice.","hedge":{"p":0.84,"label":"asserted"},"own_p":0.23,"main_claim_p":0.26,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.13,"contribution":0.0,"interpretation":0.87}}]},"compiled":{"main_claim":{"p":0.92,"text":"Our findings show that the approach of the EC relies on unjustified heuristics rather than formal privacy guarantees, underestimates the risks inherent in free-text search queries, and sacrifices data utility without achieving meaningful protection.","location":"abstract s6","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":7048,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.41,"states_limitation":0.1,"human_participants":0.1,"controlled_comparison":0.04,"randomized_assignment":0.01,"states_quantitative_result":0.07,"compares_with_prior_results":0.18,"mentions_code_or_data_availability":0.05},"evidential_basis":{"p":0.57,"value":"analysis of existing data","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.0,"analysis_of_existing_data":0.57,"observation_or_experiment":0.42,"simulation_or_computation":0.01}},"contribution_type":{"p":0.53,"value":"position or commentary","probabilities":{"review":0.09,"method_or_tool":0.0,"empirical_study":0.38,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.53}},"contribution_statement":{"p":0.92,"text":"Importantly, we present examples of low-effort reidentification, record linkage, and confidential attribute inference achieved through straightforward and automatable attack patterns.","location":"abstract s5"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":9,"sentences_in_abstract":9},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}