{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:O5PZRMV4DSAQ5MBEQSSK3DWU3Y","short_pith_number":"pith:O5PZRMV4","schema_version":"1.0","canonical_sha256":"775f98b2bc1c810eb02484a4ad8ed4de03c5a5c830d859af1d448a324c972bb9","source":{"kind":"arxiv","id":"1508.01420","version":1},"attestation_state":"computed","paper":{"title":"Privacy-Preserving Multi-Document Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CR"],"primary_cat":"cs.IR","authors_text":"Anatole Gershman, Bhiksha Raj, David Martins de Matos, Isabel Trancoso, Jaime Carbonell, Jo\\~ao P. Neto, Jos\\'e Port\\^elo, Lu\\'is Marujo, Wang Ling","submitted_at":"2015-08-06T14:30:47Z","abstract_excerpt":"State-of-the-art extractive multi-document summarization systems are usually designed without any concern about privacy issues, meaning that all documents are open to third parties. In this paper we propose a privacy-preserving approach to multi-document summarization. Our approach enables other parties to obtain summaries without learning anything else about the original documents' content. We use a hashing scheme known as Secure Binary Embeddings to convert documents representation containing key phrases and bag-of-words into bit strings, allowing the computation of approximate distances, in"},"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":"1508.01420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-08-06T14:30:47Z","cross_cats_sorted":["cs.CL","cs.CR"],"title_canon_sha256":"9da1d365abc903d78f08773041c9e3081ba8daf256a4b1397e09fcaa0dbb6f47","abstract_canon_sha256":"a3b052d38fd0290f6d7cf58e4b7e3d6899c2018fc8bb4d00031c5d1d78d8c10c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:42.671049Z","signature_b64":"oS2TK1mF6l6V9zKERjl86sh0Z14pDAerLDPrERYelX1XiHfl4IkMSqVmqzJgLkduQvsclEJGluWq9Ag/NTWzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"775f98b2bc1c810eb02484a4ad8ed4de03c5a5c830d859af1d448a324c972bb9","last_reissued_at":"2026-05-18T01:35:42.670594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:42.670594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-Preserving Multi-Document Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CR"],"primary_cat":"cs.IR","authors_text":"Anatole Gershman, Bhiksha Raj, David Martins de Matos, Isabel Trancoso, Jaime Carbonell, Jo\\~ao P. Neto, Jos\\'e Port\\^elo, Lu\\'is Marujo, Wang Ling","submitted_at":"2015-08-06T14:30:47Z","abstract_excerpt":"State-of-the-art extractive multi-document summarization systems are usually designed without any concern about privacy issues, meaning that all documents are open to third parties. In this paper we propose a privacy-preserving approach to multi-document summarization. Our approach enables other parties to obtain summaries without learning anything else about the original documents' content. We use a hashing scheme known as Secure Binary Embeddings to convert documents representation containing key phrases and bag-of-words into bit strings, allowing the computation of approximate distances, in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01420","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":"1508.01420","created_at":"2026-05-18T01:35:42.670661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01420v1","created_at":"2026-05-18T01:35:42.670661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01420","created_at":"2026-05-18T01:35:42.670661+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5PZRMV4DSAQ","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5PZRMV4DSAQ5MBE","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5PZRMV4","created_at":"2026-05-18T12:29:34.919912+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/O5PZRMV4DSAQ5MBEQSSK3DWU3Y","json":"https://pith.science/pith/O5PZRMV4DSAQ5MBEQSSK3DWU3Y.json","graph_json":"https://pith.science/api/pith-number/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/graph.json","events_json":"https://pith.science/api/pith-number/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/events.json","paper":"https://pith.science/paper/O5PZRMV4"},"agent_actions":{"view_html":"https://pith.science/pith/O5PZRMV4DSAQ5MBEQSSK3DWU3Y","download_json":"https://pith.science/pith/O5PZRMV4DSAQ5MBEQSSK3DWU3Y.json","view_paper":"https://pith.science/paper/O5PZRMV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01420&json=true","fetch_graph":"https://pith.science/api/pith-number/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/action/storage_attestation","attest_author":"https://pith.science/pith/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/action/author_attestation","sign_citation":"https://pith.science/pith/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/action/citation_signature","submit_replication":"https://pith.science/pith/O5PZRMV4DSAQ5MBEQSSK3DWU3Y/action/replication_record"}},"created_at":"2026-05-18T01:35:42.670661+00:00","updated_at":"2026-05-18T01:35:42.670661+00:00"}