{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OGNH4YTKYCVDZLZX3UU7OGE7ET","short_pith_number":"pith:OGNH4YTK","schema_version":"1.0","canonical_sha256":"719a7e626ac0aa3caf37dd29f7189f24f3bb9545832f81b8ad742b94cc0cd42f","source":{"kind":"arxiv","id":"1012.2509","version":1},"attestation_state":"computed","paper":{"title":"Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Arthur U. Asuncion, Irvine), Michael T. Goodrich (Department of Computer Science, University of California","submitted_at":"2010-12-12T04:43:19Z","abstract_excerpt":"In this paper, we study sparsity-exploiting Mastermind algorithms for attacking the privacy of an entire database of character strings or vectors, such as DNA strings, movie ratings, or social network friendship data. Based on reductions to nonadaptive group testing, our methods are able to take advantage of minimal amounts of privacy leakage, such as contained in a single bit that indicates if two people in a medical database have any common genetic mutations, or if two people have any common friends in an online social network. We analyze our Mastermind attack algorithms using theoretical ch"},"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":"1012.2509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-12-12T04:43:19Z","cross_cats_sorted":[],"title_canon_sha256":"2d7072e1dbdf25a86c35be1b693ec27ec1825b20c7ccf191aeda10c32209d75b","abstract_canon_sha256":"89410fa6e617a6712e422890443d5fc9ab7b55561bb7d6647785a08bcea38c05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:28.465770Z","signature_b64":"HSJIskgYbcF9Zj+RAvRCW6R9/OXeDZhHkNeiVdHWbpQA3Hx1117twhe/iXyomlpxt3k+UItjJfhlTHVtRK5SBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"719a7e626ac0aa3caf37dd29f7189f24f3bb9545832f81b8ad742b94cc0cd42f","last_reissued_at":"2026-05-18T04:33:28.465303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:28.465303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Arthur U. Asuncion, Irvine), Michael T. Goodrich (Department of Computer Science, University of California","submitted_at":"2010-12-12T04:43:19Z","abstract_excerpt":"In this paper, we study sparsity-exploiting Mastermind algorithms for attacking the privacy of an entire database of character strings or vectors, such as DNA strings, movie ratings, or social network friendship data. Based on reductions to nonadaptive group testing, our methods are able to take advantage of minimal amounts of privacy leakage, such as contained in a single bit that indicates if two people in a medical database have any common genetic mutations, or if two people have any common friends in an online social network. We analyze our Mastermind attack algorithms using theoretical ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2509","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":""},"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":"1012.2509","created_at":"2026-05-18T04:33:28.465382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2509v1","created_at":"2026-05-18T04:33:28.465382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2509","created_at":"2026-05-18T04:33:28.465382+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGNH4YTKYCVD","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGNH4YTKYCVDZLZX","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGNH4YTK","created_at":"2026-05-18T12:26:12.377268+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/OGNH4YTKYCVDZLZX3UU7OGE7ET","json":"https://pith.science/pith/OGNH4YTKYCVDZLZX3UU7OGE7ET.json","graph_json":"https://pith.science/api/pith-number/OGNH4YTKYCVDZLZX3UU7OGE7ET/graph.json","events_json":"https://pith.science/api/pith-number/OGNH4YTKYCVDZLZX3UU7OGE7ET/events.json","paper":"https://pith.science/paper/OGNH4YTK"},"agent_actions":{"view_html":"https://pith.science/pith/OGNH4YTKYCVDZLZX3UU7OGE7ET","download_json":"https://pith.science/pith/OGNH4YTKYCVDZLZX3UU7OGE7ET.json","view_paper":"https://pith.science/paper/OGNH4YTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2509&json=true","fetch_graph":"https://pith.science/api/pith-number/OGNH4YTKYCVDZLZX3UU7OGE7ET/graph.json","fetch_events":"https://pith.science/api/pith-number/OGNH4YTKYCVDZLZX3UU7OGE7ET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGNH4YTKYCVDZLZX3UU7OGE7ET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGNH4YTKYCVDZLZX3UU7OGE7ET/action/storage_attestation","attest_author":"https://pith.science/pith/OGNH4YTKYCVDZLZX3UU7OGE7ET/action/author_attestation","sign_citation":"https://pith.science/pith/OGNH4YTKYCVDZLZX3UU7OGE7ET/action/citation_signature","submit_replication":"https://pith.science/pith/OGNH4YTKYCVDZLZX3UU7OGE7ET/action/replication_record"}},"created_at":"2026-05-18T04:33:28.465382+00:00","updated_at":"2026-05-18T04:33:28.465382+00:00"}