{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RE7R6OUMMAXIUJUSHEYXBXG22T","short_pith_number":"pith:RE7R6OUM","schema_version":"1.0","canonical_sha256":"893f1f3a8c602e8a2692393170dcdad4d61ea5c0325c5caaabaf04476ad5ff69","source":{"kind":"arxiv","id":"1906.02325","version":3},"attestation_state":"computed","paper":{"title":"Privacy-Preserving Classification of Personal Text Messages with Secure Multi-Party Computation: An Application to Hate-Speech Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CR","authors_text":"Anderson C. A. Nascimento, Ariel Todoki, Devin Reich, Martine De Cock, Rafael Dowsley","submitted_at":"2019-06-05T21:56:33Z","abstract_excerpt":"Classification of personal text messages has many useful applications in surveillance, e-commerce, and mental health care, to name a few. Giving applications access to personal texts can easily lead to (un)intentional privacy violations. We propose the first privacy-preserving solution for text classification that is provably secure. Our method, which is based on Secure Multiparty Computation (SMC), encompasses both feature extraction from texts, and subsequent classification with logistic regression and tree ensembles. We prove that when using our secure text classification method, the applic"},"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":"1906.02325","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-06-05T21:56:33Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"e63f75a4e6e70a4f070f6d85fccb3ede3bfce3fed5dedfbeda2d770c522399f3","abstract_canon_sha256":"3f7a2c144191d505f500312885390e5e6abc476390db5b8898881902dfbd3d54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:20.937463Z","signature_b64":"Ho1qLBBti8+5QdK+mtYj5F4kmjnCcBj1Eg3rT4CHqSbp39v92SyZupjKH/Q3zJtEOUgN+UNys5QV7dbnAWtNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"893f1f3a8c602e8a2692393170dcdad4d61ea5c0325c5caaabaf04476ad5ff69","last_reissued_at":"2026-07-05T02:22:20.937016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:20.937016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-Preserving Classification of Personal Text Messages with Secure Multi-Party Computation: An Application to Hate-Speech Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CR","authors_text":"Anderson C. A. Nascimento, Ariel Todoki, Devin Reich, Martine De Cock, Rafael Dowsley","submitted_at":"2019-06-05T21:56:33Z","abstract_excerpt":"Classification of personal text messages has many useful applications in surveillance, e-commerce, and mental health care, to name a few. Giving applications access to personal texts can easily lead to (un)intentional privacy violations. We propose the first privacy-preserving solution for text classification that is provably secure. Our method, which is based on Secure Multiparty Computation (SMC), encompasses both feature extraction from texts, and subsequent classification with logistic regression and tree ensembles. We prove that when using our secure text classification method, the applic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02325","kind":"arxiv","version":3},"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/1906.02325/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":"1906.02325","created_at":"2026-07-05T02:22:20.937081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.02325v3","created_at":"2026-07-05T02:22:20.937081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02325","created_at":"2026-07-05T02:22:20.937081+00:00"},{"alias_kind":"pith_short_12","alias_value":"RE7R6OUMMAXI","created_at":"2026-07-05T02:22:20.937081+00:00"},{"alias_kind":"pith_short_16","alias_value":"RE7R6OUMMAXIUJUS","created_at":"2026-07-05T02:22:20.937081+00:00"},{"alias_kind":"pith_short_8","alias_value":"RE7R6OUM","created_at":"2026-07-05T02:22:20.937081+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06972","citing_title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T","json":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T.json","graph_json":"https://pith.science/api/pith-number/RE7R6OUMMAXIUJUSHEYXBXG22T/graph.json","events_json":"https://pith.science/api/pith-number/RE7R6OUMMAXIUJUSHEYXBXG22T/events.json","paper":"https://pith.science/paper/RE7R6OUM"},"agent_actions":{"view_html":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T","download_json":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T.json","view_paper":"https://pith.science/paper/RE7R6OUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.02325&json=true","fetch_graph":"https://pith.science/api/pith-number/RE7R6OUMMAXIUJUSHEYXBXG22T/graph.json","fetch_events":"https://pith.science/api/pith-number/RE7R6OUMMAXIUJUSHEYXBXG22T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T/action/storage_attestation","attest_author":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T/action/author_attestation","sign_citation":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T/action/citation_signature","submit_replication":"https://pith.science/pith/RE7R6OUMMAXIUJUSHEYXBXG22T/action/replication_record"}},"created_at":"2026-07-05T02:22:20.937081+00:00","updated_at":"2026-07-05T02:22:20.937081+00:00"}