{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y5EOG7MKWW2G7S6BUDRFQXXZ74","short_pith_number":"pith:Y5EOG7MK","schema_version":"1.0","canonical_sha256":"c748e37d8ab5b46fcbc1a0e2585ef9ff3037a5f150b60045c904ad3769f50b8b","source":{"kind":"arxiv","id":"2507.08433","version":1},"attestation_state":"computed","paper":{"title":"On the $(k,\\ell)$-multiset anonymity measure for social graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alejandro Estrada-Moreno, Dorota Kuziak, Elena Fern\\'andez, Ismael G. Yero, Manuel Mu\\~noz-M\\'arquez, Rolando Trujillo-Rasua","submitted_at":"2025-07-11T09:19:58Z","abstract_excerpt":"The publication of social graphs must be preceded by a rigorous analysis of privacy threats against social graph users. When the threat comes from inside the social network itself, the threat is called an active attack, and the de-facto privacy measure used to quantify the resistance to such an attack is the $(k,\\ell)$-anonymity. The original formulation of $(k,\\ell)$-anonymity represents the adversary's knowledge as a vector of distances to the set of attacker nodes. In this article, we argue that such adversary is too strong when it comes to counteracting active attacks. We, instead, propose"},"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":"2507.08433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-11T09:19:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2000c69200f8567367556387854b801ef0602fb51c3dd5f6a941fe309fe2002b","abstract_canon_sha256":"3672ed723fa7a9c8a96707440da20efb504966e231f047208b6a542b31b3c2b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:38.192865Z","signature_b64":"djhXedCjF9IPMxbm/TKSP/kbafPthHs3Y0TJwNrY7T+rXVCMMxq+eZYnLhHFtU5NEfGj8DJnZTiy2/wpW7ruDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c748e37d8ab5b46fcbc1a0e2585ef9ff3037a5f150b60045c904ad3769f50b8b","last_reissued_at":"2026-07-05T11:35:38.192386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:38.192386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $(k,\\ell)$-multiset anonymity measure for social graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alejandro Estrada-Moreno, Dorota Kuziak, Elena Fern\\'andez, Ismael G. Yero, Manuel Mu\\~noz-M\\'arquez, Rolando Trujillo-Rasua","submitted_at":"2025-07-11T09:19:58Z","abstract_excerpt":"The publication of social graphs must be preceded by a rigorous analysis of privacy threats against social graph users. When the threat comes from inside the social network itself, the threat is called an active attack, and the de-facto privacy measure used to quantify the resistance to such an attack is the $(k,\\ell)$-anonymity. The original formulation of $(k,\\ell)$-anonymity represents the adversary's knowledge as a vector of distances to the set of attacker nodes. In this article, we argue that such adversary is too strong when it comes to counteracting active attacks. We, instead, propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08433","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/2507.08433/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":"2507.08433","created_at":"2026-07-05T11:35:38.192441+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.08433v1","created_at":"2026-07-05T11:35:38.192441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08433","created_at":"2026-07-05T11:35:38.192441+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5EOG7MKWW2G","created_at":"2026-07-05T11:35:38.192441+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5EOG7MKWW2G7S6B","created_at":"2026-07-05T11:35:38.192441+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5EOG7MK","created_at":"2026-07-05T11:35:38.192441+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74","json":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74.json","graph_json":"https://pith.science/api/pith-number/Y5EOG7MKWW2G7S6BUDRFQXXZ74/graph.json","events_json":"https://pith.science/api/pith-number/Y5EOG7MKWW2G7S6BUDRFQXXZ74/events.json","paper":"https://pith.science/paper/Y5EOG7MK"},"agent_actions":{"view_html":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74","download_json":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74.json","view_paper":"https://pith.science/paper/Y5EOG7MK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.08433&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5EOG7MKWW2G7S6BUDRFQXXZ74/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5EOG7MKWW2G7S6BUDRFQXXZ74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74/action/storage_attestation","attest_author":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74/action/author_attestation","sign_citation":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74/action/citation_signature","submit_replication":"https://pith.science/pith/Y5EOG7MKWW2G7S6BUDRFQXXZ74/action/replication_record"}},"created_at":"2026-07-05T11:35:38.192441+00:00","updated_at":"2026-07-05T11:35:38.192441+00:00"}