{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2UUNSM37WIV5G5SFC4DU7DHGSY","short_pith_number":"pith:2UUNSM37","schema_version":"1.0","canonical_sha256":"d528d9337fb22bd3764517074f8ce696111436b61c6904cd4f625f1c0bdbfda2","source":{"kind":"arxiv","id":"1107.3593","version":1},"attestation_state":"computed","paper":{"title":"Privacy-Enhanced Methods for Comparing Compressed DNA Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"David Eppstein, Michael T. Goodrich, Pierre Baldi","submitted_at":"2011-07-18T22:58:37Z","abstract_excerpt":"In this paper, we study methods for improving the efficiency and privacy of compressed DNA sequence comparison computations, under various querying scenarios. For instance, one scenario involves a querier, Bob, who wants to test if his DNA string, $Q$, is close to a DNA string, $Y$, owned by a data owner, Alice, but Bob does not want to reveal $Q$ to Alice and Alice is willing to reveal $Y$ to Bob \\emph{only if} it is close to $Q$. We describe a privacy-enhanced method for comparing two compressed DNA sequences, which can be used to achieve the goals of such a scenario. Our method involves a r"},"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":"1107.3593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-07-18T22:58:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f319948dd94ea0b4542cd1592c4af0072d48ca719ccd4a9b3b4effa82b09331b","abstract_canon_sha256":"e27b2a79bf967359f7348c6760e2aab7ddd3f169a594f296dae3efbdd2abbc9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:24.475628Z","signature_b64":"z7BwFVL5KxbjcKcbMSKxBHtzaB3thiWgip7Ik+em6JXqLNSlBaQj9NlQfugDzdMQyuBCsAuxTLxe9zSpf4cuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d528d9337fb22bd3764517074f8ce696111436b61c6904cd4f625f1c0bdbfda2","last_reissued_at":"2026-05-18T04:17:24.474916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:24.474916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-Enhanced Methods for Comparing Compressed DNA Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"David Eppstein, Michael T. Goodrich, Pierre Baldi","submitted_at":"2011-07-18T22:58:37Z","abstract_excerpt":"In this paper, we study methods for improving the efficiency and privacy of compressed DNA sequence comparison computations, under various querying scenarios. For instance, one scenario involves a querier, Bob, who wants to test if his DNA string, $Q$, is close to a DNA string, $Y$, owned by a data owner, Alice, but Bob does not want to reveal $Q$ to Alice and Alice is willing to reveal $Y$ to Bob \\emph{only if} it is close to $Q$. We describe a privacy-enhanced method for comparing two compressed DNA sequences, which can be used to achieve the goals of such a scenario. Our method involves a r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3593","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":"1107.3593","created_at":"2026-05-18T04:17:24.475010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3593v1","created_at":"2026-05-18T04:17:24.475010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3593","created_at":"2026-05-18T04:17:24.475010+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UUNSM37WIV5","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UUNSM37WIV5G5SF","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UUNSM37","created_at":"2026-05-18T12:26:18.847500+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/2UUNSM37WIV5G5SFC4DU7DHGSY","json":"https://pith.science/pith/2UUNSM37WIV5G5SFC4DU7DHGSY.json","graph_json":"https://pith.science/api/pith-number/2UUNSM37WIV5G5SFC4DU7DHGSY/graph.json","events_json":"https://pith.science/api/pith-number/2UUNSM37WIV5G5SFC4DU7DHGSY/events.json","paper":"https://pith.science/paper/2UUNSM37"},"agent_actions":{"view_html":"https://pith.science/pith/2UUNSM37WIV5G5SFC4DU7DHGSY","download_json":"https://pith.science/pith/2UUNSM37WIV5G5SFC4DU7DHGSY.json","view_paper":"https://pith.science/paper/2UUNSM37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3593&json=true","fetch_graph":"https://pith.science/api/pith-number/2UUNSM37WIV5G5SFC4DU7DHGSY/graph.json","fetch_events":"https://pith.science/api/pith-number/2UUNSM37WIV5G5SFC4DU7DHGSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UUNSM37WIV5G5SFC4DU7DHGSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UUNSM37WIV5G5SFC4DU7DHGSY/action/storage_attestation","attest_author":"https://pith.science/pith/2UUNSM37WIV5G5SFC4DU7DHGSY/action/author_attestation","sign_citation":"https://pith.science/pith/2UUNSM37WIV5G5SFC4DU7DHGSY/action/citation_signature","submit_replication":"https://pith.science/pith/2UUNSM37WIV5G5SFC4DU7DHGSY/action/replication_record"}},"created_at":"2026-05-18T04:17:24.475010+00:00","updated_at":"2026-05-18T04:17:24.475010+00:00"}