{"as_of":"2026-08-16T21:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0ff08c6ce9b0e8f87bb53e7ae6e464fba6d70fbc6bc136ef1ccbf494a1f872b","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:45:14.520793Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.06972/citation-record","integrity":"/paper/1908.06972/integrity","json":"/paper/1908.06972/citation-record.json","paper":"/paper/1908.06972"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:16.146538Z","title":"Al Badawi, Y","venue":null,"work_id":"f5f828f1-2fde-45a7-8be7-d983aefccb61","year":2019},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.067853Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:a615148891ca40d91197ddce6e3dcb64967a3ea078b862a173b9b46f8f51fb38","observation_id":"3c635a22-2e49-4307-9382-712668f7aa27","resolution":{"observed_at":"2026-08-14T12:45:16.151796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:16.125141Z","title":"High-performance FV somewhat homomorphic encryption on GPUs: An im- plementation using CUDA","venue":null,"work_id":"70439576-59a7-4303-88e1-e8aed9375bcc","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.077101Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:ad911cf1b0d5cd59799936ce425e5c8fc9296088bdf51ef307ad1c8c52f5f788","observation_id":"b4973112-2752-449a-a600-a996ea7c79bb","resolution":{"observed_at":"2026-08-14T12:45:16.132229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:16.094037Z","title":"Homomor- phic encryption security standard","venue":null,"work_id":"7c6159d5-d420-4108-a9e1-8b52ac9b1871","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.087742Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:6c5694964544fa3d5c9190ea6d12f2ed8115ba62b721e1f33175629f75745436","observation_id":"53cfced0-965e-40e1-8f7a-837cf79f26b1","resolution":{"observed_at":"2026-08-14T12:45:16.101162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:14.097435Z","title":"On the concrete hardness of learning with errors","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.097435Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:83971f89ffaaca935da810475f3d6b86cd86ef1cc9a6fc6478ef8def4d878a2c","observation_id":"a8a37e24-2f22-47fc-ac4e-92410e3999f1","resolution":{"observed_at":"2026-08-14T12:45:14.097435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:16.047643Z","title":"From keys to databases—real-world applications of secure multi- party computation","venue":null,"work_id":"ee55c944-29fb-49b3-88f4-f9da85da2009","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.105509Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:9a1b8081628dd21f9e42261e2bc41e3ede8ee7a4ee36345cbc29ab4dd8a0cc62","observation_id":"d4dc925d-e7ff-431c-a1b2-f9b83eaa9590","resolution":{"observed_at":"2026-08-14T12:45:16.059705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:16.026229Z","title":null,"venue":null,"work_id":"290ec2f2-6be6-495e-b72e-6975c1351865","year":2015},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.114896Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:b2db268ffcb4e0308a323b1e89e93f86db10a7b311d1005dc6ef74b3fd54a74a","observation_id":"40370653-d2c3-4ba9-a4db-f208d461effb","resolution":{"observed_at":"2026-08-14T12:45:16.034465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.00778","last_updated":"2020-08-18T18:21:38Z","snapshot_observed_at":"2026-08-16T21:17:07.054367Z","submitted_at":"2018-11-02T08:44:21Z","title":"Towards the AlexNet Moment for Homomorphic Encryption: HCNN, theFirst Homomorphic CNN on Encrypted Data with GPUs","version":3},"cited_work":{"arxiv_id":"1811.00778","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.00778","snapshot_observed_at":"2026-08-14T12:45:14.878525Z","title":"Towards the AlexNet Moment for Homomorphic Encryption: HCNN, theFirst Homomorphic CNN on Encrypted Data with GPUs","venue":"cs.CR","work_id":"a89ec4bf-a241-405a-9267-25802d154ff4","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.121863Z"},"links":{"cited_paper":"/paper/1811.00778","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:e276b6159e9422770c8f91641e4a8fab45c6c4e162be751382134668d651a748","observation_id":"c1a3ae0a-db95-4d46-9dd2-202c30a45906","resolution":{"observed_at":"2026-08-14T12:45:14.889308Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:16.005714Z","title":"A full RNS variant of FV like some- what homomorphic encryption schemes","venue":null,"work_id":"c5966920-79f1-4c73-800b-c7cde9d3179f","year":2016},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.129140Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:d971c9f832c4478e9a64fdd9b0c9b9769dbec041442a127249a93ee240a931d1","observation_id":"11ada2ee-bf11-4887-9978-db500275bc66","resolution":{"observed_at":"2026-08-14T12:45:16.013784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.975312Z","title":"Recommendation for key man- agement part 1: General (revision 3)","venue":null,"work_id":"796fe09c-472f-4e91-be97-f8412be6b5d8","year":2012},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.135607Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:e085a7a6403748cf8258159858959d4e1928fd3fc638fa7c1244a78b755eccd0","observation_id":"1ca968c1-f9c0-4a56-a065-2a7dafb68e48","resolution":{"observed_at":"2026-08-14T12:45:15.983823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.931014Z","title":"(leveled) fully homomorphic encryption with- out bootstrapping","venue":null,"work_id":"f75a7d9f-dc84-4805-8d66-52326951e029","year":2014},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.142373Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:4e155b815b9bdfcd7859ee749955d2453822eb4434e547ce590bcf43e06c27f0","observation_id":"7544eb43-54a3-4e08-90ee-7346ac9ed2fe","resolution":{"observed_at":"2026-08-14T12:45:15.951082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.886282Z","title":"Fully homo- morphic encryption from ring-LWE and security for key dependent messages","venue":null,"work_id":"5735a239-c9ff-4471-9aa6-037a84a5f8d9","year":2011},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.149055Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:5793e55da4b36153081806f85d4469aa6820ef1235e6123661e8a246cf3aaae5","observation_id":"998f3686-1d9e-47e0-9938-dcaead8f25d5","resolution":{"observed_at":"2026-08-14T12:45:15.895019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.861061Z","title":"Fast private set intersection from homomorphic encryption","venue":null,"work_id":"35998ba4-f9cf-4a47-a38b-5b01fb9a0997","year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.157848Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:d007b3cbbf5d0aee65df25c25e42c6dd5b348a11f9eedd4a13f8d8bfa81b6361","observation_id":"16587d6c-d728-44f1-86e0-4e35d7b0b633","resolution":{"observed_at":"2026-08-14T12:45:15.870823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.836567Z","title":"Disease prediction by machine learning over big data from healthcare communities","venue":null,"work_id":"59fcc993-387e-42a8-970b-ab9bdf76718f","year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.163882Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:a9cefefc0ca22aedd00b7d6e8c3ae5aef16014452b1590f16ac707652a4daa20","observation_id":"5f4476c8-4afa-49d1-90cf-aff9334b56ae","resolution":{"observed_at":"2026-08-14T12:45:15.844129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.798494Z","title":"A full RNS variant of approximate homomorphic encryption","venue":null,"work_id":"7f616e58-a260-4124-962c-7cec1eee6fc9","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.169870Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:3f164bdc7da4f6738c16536e60fd8e29f92bc233514d3dacac0db926fbdc3606","observation_id":"ef89e312-aaa7-473b-a629-f7392f8a8234","resolution":{"observed_at":"2026-08-14T12:45:15.805286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.758957Z","title":"Homomorphic en- cryption for approximate matrix arithmetic","venue":null,"work_id":"f10c1188-6307-4c9c-a12a-bb2245ea3641","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.175766Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:b24c438383f6038fb6247faa8605eb04be99ef92cccbd15e0c0932a5aa649cc1","observation_id":"0a9a4c12-714b-4ff8-86e2-61a74eec86ad","resolution":{"observed_at":"2026-08-14T12:45:15.768009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.732934Z","title":"Homomorphic encryption for arithmetic of ap- proximate numbers","venue":null,"work_id":"455dd240-a154-4c33-9ad0-d777769712c3","year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.182217Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:09a70d98b8ef804450e2b817d17fe6e5ae5b2d9a2d71ddc118639f58f17c2201","observation_id":"1ecc09bd-5eec-4cd1-b5ce-aa9db703b660","resolution":{"observed_at":"2026-08-14T12:45:15.739988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.09953","last_updated":"2018-11-25T05:56:18Z","snapshot_observed_at":"2026-08-14T17:54:13.165640Z","submitted_at":"2018-11-25T05:56:18Z","title":"Faster CryptoNets: Leveraging Sparsity for Real-World Encrypted Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.09953","snapshot_observed_at":"2026-08-14T12:45:14.188974Z","title":"Faster cryptonets: Lever- aging sparsity for real-world encrypted inference","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.188974Z"},"links":{"cited_paper":"/paper/1811.09953","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:fe1b4373015c050b95172aa5a794cd8e16962e924aa08fb7622ccb2b0fd0d20e","observation_id":"1761df7f-9932-43fc-b910-6bbb092a198d","resolution":{"observed_at":"2026-08-14T12:45:14.188974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.700110Z","title":"Privacy-preserving text mining as a service","venue":null,"work_id":"ec7c8d6b-84a6-462f-9b43-9f40e835d2c4","year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.195693Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:7c7c41f157c1d0cce167a3d6ff1eedff1318d5fbf8c2c2543ff15762494c203d","observation_id":"daf956bc-645e-4e42-95e5-0d41c4edaf1c","resolution":{"observed_at":"2026-08-14T12:45:15.708510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.02325","last_updated":"2021-03-12T05:14:56Z","snapshot_observed_at":"2026-08-16T18:58:40.845977Z","submitted_at":"2019-06-05T21:56:33Z","title":"Privacy-Preserving Classification of Personal Text Messages with Secure Multi-Party Computation: An Application to Hate-Speech Detection","version":3},"cited_work":{"arxiv_id":"1906.02325","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.02325","snapshot_observed_at":"2026-08-14T12:45:14.808035Z","title":"Privacy-Preserving Classification of Personal Text Messages with Secure Multi-Party Computation: An Application to Hate-Speech Detection","venue":"cs.CR","work_id":"eee966e8-4535-4469-8644-c22be49cc2c8","year":2019},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.201752Z"},"links":{"cited_paper":"/paper/1906.02325","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:4315b99091bd9be6b24e8755448558ae545bc5b0ac8b3ed3d7bff6e1e7d42705","observation_id":"80720b9f-0e02-439d-afed-4af6c39f212d","resolution":{"observed_at":"2026-08-14T12:45:14.817535Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-14T12:45:14.210457Z","title":"Bert: Pre-training of deep bidirec- tional transformers for language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.210457Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:03b69373f8a95b145bf3c384a31f6f4f853035dc85470fc87afda6074fd75801","observation_id":"e156e7c7-c072-41dd-9aef-cd9e3c6fe2b4","resolution":{"observed_at":"2026-08-14T12:45:14.210457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.672798Z","title":"CryptoNets: Applying neural networks to encrypted data 14 with high throughput and accuracy","venue":null,"work_id":"f3ec4a74-db65-4dac-8600-123f19572998","year":2016},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.219417Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:46436b8a04f10fcd10e27a4476faa3d440fa02752ea0a2951b70dc058ed8b7dd","observation_id":"0f516768-2686-41bf-a26a-581033d8b2ca","resolution":{"observed_at":"2026-08-14T12:45:15.680374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.645826Z","title":"Secure multi-party computation problems and their applications: a review and open problems","venue":null,"work_id":"2043f926-509b-4dd9-8819-438e461cf685","year":2001},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.225832Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:148b1fadaa2c9f391187e38d29e7cc1c757a290733e7ac0405ea7227914c71ed","observation_id":"e56e7317-f49e-4262-a774-d4b384ac7be9","resolution":{"observed_at":"2026-08-14T12:45:15.658344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.619197Z","title":"Ma- chine learning in healthcare informatics , volume 56","venue":null,"work_id":"2c7b6e41-e15f-47d9-a80b-0f5af711f0e9","year":2014},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.232786Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:b77fafe3ac1421204029c3f04defadfbbf4af3d631db2626aec159ef4cfd6ff0","observation_id":"c802c223-e247-424e-9723-ac2426815288","resolution":{"observed_at":"2026-08-14T12:45:15.626963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.588135Z","title":"Arti- ficial Intelligence in Financial Markets: Cutting Edge Applications for Risk Management, Portfolio Optimiza- tion and Economics","venue":null,"work_id":"8b08c6f8-c9a2-4f27-a7ec-b1ce6876ba7c","year":2016},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.239628Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:94bee002d5b7ff2bc83cedef49af3e325aa03d960a6666b4a4a80d1cd0978b39","observation_id":"24c748f1-2ab8-41bf-9705-a82579c4b6dc","resolution":{"observed_at":"2026-08-14T12:45:15.595722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.563992Z","title":"Somewhat prac- tical fully homomorphic encryption","venue":null,"work_id":"ac2ace5f-3f45-432e-8c10-403ff543b88f","year":2012},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.244859Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:02f4cceae712e4b56de612b61fe3819e6310cf856fc6f51f9f6f56be05931b4e","observation_id":"620fdb9b-77ed-4185-872f-9e3881288cbc","resolution":{"observed_at":"2026-08-14T12:45:15.571114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.532688Z","title":"Fully homomorphic encryption using ideal lattices","venue":null,"work_id":"cec19746-5bd5-4b69-a389-d1c2f95d84fd","year":2009},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.251618Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:0632e81b1fbbfcae3145d676d5b7f62a525a48a70cb1b21aa2bbb6dd963035bf","observation_id":"e66effa6-6278-4d81-b834-6a87b13b0a53","resolution":{"observed_at":"2026-08-14T12:45:15.540625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.504892Z","title":"Fully homomorphic encryption with polylog overhead","venue":null,"work_id":"9813d83b-a025-4b50-8175-b4a04bcd021b","year":null},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.259711Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:ffbe26b13edb7078093f8f54c099aa3b7402039f8a603e5708736f40474de1f4","observation_id":"aa9e95c8-4adc-4ba0-9201-e2e2af7bfb2f","resolution":{"observed_at":"2026-08-14T12:45:15.511047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.479119Z","title":"Machine ethics and automated vehicles","venue":null,"work_id":"a7d8a0a5-633c-40c1-9ba7-fdc6d0f68bfe","year":2014},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.268788Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:b48725dfdc2a53e498000342f67b5919461dfd1121e33cee58c21d6c343777c1","observation_id":"43c895b3-95a6-4706-89e0-e32230900a74","resolution":{"observed_at":"2026-08-14T12:45:15.487458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.456585Z","title":"Accurate, large minibatch sgd: Training imagenet in 1 hour, 2017","venue":null,"work_id":"5c39324d-50ef-40ca-a6b0-6529ec45ba83","year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.274590Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:d1101f1f084d3bf1655f5fd1982ac11078f3902a9895894755c5cac56f176946","observation_id":"5072702f-794b-435d-9c2d-89a6e5b11f2d","resolution":{"observed_at":"2026-08-14T12:45:15.462079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.431333Z","title":"An improved RNS variant of the BFV homomorphic en- cryption scheme","venue":null,"work_id":"af1016bd-08f9-451a-aae9-c022f3125b53","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.279857Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:9fc12750a2c46ddf8f9e3b9001deb45e07b7a5ff875afa2ec43d33bfc82de7c6","observation_id":"1e17148d-842a-41c0-ae6d-5666a679f990","resolution":{"observed_at":"2026-08-14T12:45:15.437799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.389079Z","title":"Algorithms in HElib","venue":null,"work_id":"7a98c9fc-c22b-4915-bc20-38ca4e704e58","year":2014},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.288844Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:4a020da696c15af09398276e1767a8e519daf059817604b8903ce1dd4e5a984e","observation_id":"23e564ad-da04-48c8-aa55-3d53bb0fd4f3","resolution":{"observed_at":"2026-08-14T12:45:15.399559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.345457Z","title":"Deep learning for finance: deep portfolios","venue":null,"work_id":"aabfe50a-470d-4a13-8344-b90ae659cd01","year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.294972Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:66a7d15d73d5969bd9f68817aa35204c07950996b890eb390371b0d610e59116","observation_id":"bb6c2faa-b13e-4ccd-9f15-444cac5b5e5b","resolution":{"observed_at":"2026-08-14T12:45:15.363721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.06146","last_updated":"2018-05-23T09:23:47Z","snapshot_observed_at":"2026-08-14T19:54:00.470999Z","submitted_at":"2018-01-18T17:54:52Z","title":"Universal Language Model Fine-tuning for Text Classification","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.06146","snapshot_observed_at":"2026-08-14T12:45:14.301936Z","title":"Universal lan- guage model fine-tuning for text classification","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.301936Z"},"links":{"cited_paper":"/paper/1801.06146","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:962e70ff6bd6773620ad557bf0e4142c9057b170976ef46f43dd46de49bb834e","observation_id":"ca92e7af-3dd6-424e-8e90-bd4122f95a74","resolution":{"observed_at":"2026-08-14T12:45:14.301936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.299235Z","title":"Multilingual detection of hate speech against immigrants and women in twitter at semeval-2019 task 5: Frequency analysis interpolation for hate in speech detection","venue":null,"work_id":"9c4775f3-ef0b-4a8b-9158-d569819586cf","year":2019},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.307659Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:fea03f54f1015e903a3d72c176f0a6bd1e042337c2ae95236a77caa8d36d7094","observation_id":"8b40d732-d140-41dc-9763-7895867ff767","resolution":{"observed_at":"2026-08-14T12:45:15.307807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.265160Z","title":"User data privacy: Face- book, cambridge analytica, and privacy protection.Com- puter, 51(8):56–59, 2018","venue":null,"work_id":"44adc395-0f5f-4983-8756-c63db535cf18","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.313612Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:9f315fa10f24585831b4a4822aad8fbac1cec83efdcb055c2e62b12a5b46079d","observation_id":"994daef5-ab44-4f13-8201-8fc4a57585a8","resolution":{"observed_at":"2026-08-14T12:45:15.271378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.241224Z","title":"Using fully homomorphic encryption for statistical analysis of categorical, ordinal and numerical data","venue":null,"work_id":"b8f5cce8-8974-4b74-ad73-91b58b19b1fd","year":2016},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.327360Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:2da8869a8e96a51bbb8276ba195f73ff24a6624846ee17dceedb55b4ef9c8ab2","observation_id":"29634148-e572-4f82-9a7c-753790b2af0c","resolution":{"observed_at":"2026-08-14T12:45:15.250795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.01759","last_updated":"2016-08-09T17:38:43Z","snapshot_observed_at":"2026-08-16T02:41:53.636308Z","submitted_at":"2016-07-06T19:40:15Z","title":"Bag of Tricks for Efficient Text Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.01759","snapshot_observed_at":"2026-08-14T12:45:14.336989Z","title":"Bag of tricks for efficient text classifi- cation","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.336989Z"},"links":{"cited_paper":"/paper/1607.01759","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:8e5cf632045c7af8b7802910564b36ac7621f1a20dd9679b8a6e505c028b2a45","observation_id":"e349ff51-1ab3-463f-9534-59769ceea525","resolution":{"observed_at":"2026-08-14T12:45:14.336989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.218687Z","title":"GAZELLE: A low latency framework for secure neural network inference","venue":null,"work_id":"1bcb961d-01e9-4398-b38a-33c6b1388bb8","year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.360251Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:83422dd0304598a34674eba0b513b68a4c671c1e62a1a876fb0e1a5a418b6a5e","observation_id":"d271c356-7883-4d72-88bb-bbf3202858e2","resolution":{"observed_at":"2026-08-14T12:45:15.225530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.192502Z","title":"Privacy- preserving genome-wide association studies on cloud environment using fully homomorphic encryption","venue":null,"work_id":"01f7bd01-766d-4952-8ed6-80932c3b4933","year":2015},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.372653Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:0cff5bfe9ae149bf77d9abb927d2a0785773969bf28b7e40c845bdd8633a0b79","observation_id":"1c732e7f-6523-4ee5-9a85-7da39c66ae89","resolution":{"observed_at":"2026-08-14T12:45:15.199824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.172072Z","title":"Machine learning forensics for law enforce- ment, security, and intelligence","venue":null,"work_id":"fd0cd31c-6586-47d2-9578-e4285df114c6","year":2016},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.380353Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:06c086f7ecf8823ca1e654fda0793c2c97fda71569c19a9ef9c1aba3f7118c65","observation_id":"10ad5ce6-d2b5-42f0-8435-ced327596e02","resolution":{"observed_at":"2026-08-14T12:45:15.179108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.02182","last_updated":"2017-08-07T16:03:44Z","snapshot_observed_at":"2026-08-14T20:42:45.344345Z","submitted_at":"2017-08-07T16:03:44Z","title":"Regularizing and Optimizing LSTM Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.02182","snapshot_observed_at":"2026-08-14T12:45:14.386921Z","title":"Regularizing and optimizing LSTM language models","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.386921Z"},"links":{"cited_paper":"/paper/1708.02182","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:af718ac348c2a8008723d4ba1701995065f97a495d2f31d2dbbad45791236570","observation_id":"aa464a93-e5aa-46b7-9dac-2c0eaf350268","resolution":{"observed_at":"2026-08-14T12:45:14.386921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-14T12:45:14.394816Z","title":"Efficient estimation of word representations in vector space","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.394816Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:4628761afb1012ae4576e17e05b52edf0afc418f997a4c06b55ddb862355e8f7","observation_id":"c0c76f92-ea16-4add-b739-bb36767f6dd7","resolution":{"observed_at":"2026-08-14T12:45:14.394816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.153267Z","title":"Distributed representations of words and phrases and their compositionality","venue":null,"work_id":"cc785f5c-07dd-48c9-a10f-2d8fbe05e105","year":2013},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.401090Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:84e21c3677abcebf10dee4fe04b505b009b014fa4f9d7721181aeb6149928961","observation_id":"0e4fc656-3761-4284-bd4f-7bfed6f60fcf","resolution":{"observed_at":"2026-08-14T12:45:15.158249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.133022Z","title":"Can homomorphic encryption be practical? In Proceedings of the 3rd ACM workshop on Cloud computing security workshop , pages 113–124","venue":null,"work_id":"bc2ac786-efc8-468c-a222-fe4c82052d1a","year":2011},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.408789Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:12a1f8cae1b62bd0960fb732abbbb35eb8b6e705008878074e4aa3d2c9a303d0","observation_id":"3388352b-53a7-4a2d-b1bc-bbbcc8150cb5","resolution":{"observed_at":"2026-08-14T12:45:15.140316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.105874Z","title":"Residue number systems: theory and implementation, volume 2","venue":null,"work_id":"e2b2d265-ebcf-4182-bcc3-3f7a0e428293","year":2007},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.414096Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:b36b47acfdfaca927a0de32b1c1b9da3d2576e1c3920a866ff4f85d455a63efb","observation_id":"c704d0c7-c129-45a8-ae23-51cdbd259586","resolution":{"observed_at":"2026-08-14T12:45:15.113429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.076782Z","title":"Large-scale distributed second-order optimization using kronecker- factored approximate curvature for deep convolutional neural networks","venue":null,"work_id":"edacfd17-5290-4c6f-b90a-de2127cc43d9","year":2019},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.419884Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:2546accf156c1b4d76b2cf095913d385d5c90565420e96805169477bf243a9e4","observation_id":"7bca4936-0073-4423-ba46-e9b6bdb9ae39","resolution":{"observed_at":"2026-08-14T12:45:15.087092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:15.032114Z","title":"Glove: Global vectors for word representa- tion","venue":null,"work_id":"aa7e1da6-c618-4406-bd4e-8d509728e2b6","year":2014},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.430358Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:1c273f9e1ef44ffac54d14e5438c71c91d864eb90b99f05e04c986a227037121","observation_id":"39c75782-890b-4ee0-a75c-14311a5bb261","resolution":{"observed_at":"2026-08-14T12:45:15.042667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.05365","last_updated":"2018-03-22T21:59:40Z","snapshot_observed_at":"2026-08-14T19:45:43.957260Z","submitted_at":"2018-02-15T00:05:11Z","title":"Deep contextualized word representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.05365","snapshot_observed_at":"2026-08-14T12:45:14.443395Z","title":"Deep contextualized word representations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.443395Z"},"links":{"cited_paper":"/paper/1802.05365","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:bbfed372cbfc494ccbf5f7e05a8889aec1565a82c6ef1052acabccf226d14136","observation_id":"ebb188b1-0d92-4163-b70d-3e2afa971d8a","resolution":{"observed_at":"2026-08-14T12:45:14.443395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.01444","last_updated":"2017-04-06T09:48:20Z","snapshot_observed_at":"2026-08-14T21:08:10.420718Z","submitted_at":"2017-04-05T14:20:28Z","title":"Learning to Generate Reviews and Discovering Sentiment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.01444","snapshot_observed_at":"2026-08-14T12:45:14.451777Z","title":"Learning to generate reviews and discovering sentiment","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.451777Z"},"links":{"cited_paper":"/paper/1704.01444","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:fddfa2adc49ba71abfd0121b11246ce88279fe661f5abefa485ff2b83e666d22","observation_id":"85c16b80-0a90-4a7b-9465-ae6cba96012a","resolution":{"observed_at":"2026-08-14T12:45:14.451777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:14.989594Z","title":"http://sealcrypto.org, 2017","venue":null,"work_id":"6dd94966-4538-4eec-a3dd-4c5b1f9aaccf","year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.465040Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:b70ce97c3a76ec4aa98f5a2d8ab8b43ff061ede2aa4407b699ace8807f9ff173","observation_id":"2b7296a7-f3bf-42e5-986a-1d87e3130ce6","resolution":{"observed_at":"2026-08-14T12:45:14.998601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:14.968602Z","title":null,"venue":null,"work_id":"eeb7ebf2-3b7d-4515-b885-68393c2ba867","year":2014},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.471349Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:32d8b2aea20be857f8acc13ad55e98e70b6c6a8f5c677385c268e769914cac00","observation_id":"03320d2a-1eef-4bba-8a18-1745393f20d3","resolution":{"observed_at":"2026-08-14T12:45:14.974847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.05583","last_updated":"2020-02-05T12:00:32Z","snapshot_observed_at":"2026-08-14T16:32:33.364760Z","submitted_at":"2019-05-14T13:17:26Z","title":"How to Fine-Tune BERT for Text Classification?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.05583","snapshot_observed_at":"2026-08-14T12:45:14.484722Z","title":"How to fine-tune bert for text classification? arXiv preprint arXiv:1905.05583, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.484722Z"},"links":{"cited_paper":"/paper/1905.05583","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:7fd889687b6a322de3338ffe888aa2fc0d699620fbe9853bf8acd483b1ef746c","observation_id":"e3e70ba0-e991-433e-9972-07758dda447d","resolution":{"observed_at":"2026-08-14T12:45:14.484722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:14.951322Z","title":"Attention is all you need","venue":null,"work_id":"6679e717-5a3b-4100-b3db-856cb27cb083","year":2017},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.497178Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:fa89cd8b5b2e372e6bcb045fc7de297f674141ab95265ca67d23567e6465027d","observation_id":"4d325d85-d185-443c-b0ed-2a8070cfd3aa","resolution":{"observed_at":"2026-08-14T12:45:14.956555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:14.928677Z","title":"Healer: homomorphic computation of exact logistic regression for secure rare disease variants analysis in gwas","venue":null,"work_id":"4d018e3b-e753-45eb-bfbb-87cfa2206a04","year":2015},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.504972Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:03940ce71d58f278e605c4d61192e1ddc92b67c644cd5b8925188b04cc44fd73","observation_id":"6cf95a26-3f9c-49ba-a227-8b7a438365a7","resolution":{"observed_at":"2026-08-14T12:45:14.935678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.08237","last_updated":"2020-01-02T12:48:08Z","snapshot_observed_at":"2026-07-31T22:49:43.034741Z","submitted_at":"2019-06-19T17:35:48Z","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.08237","snapshot_observed_at":"2026-08-14T12:45:14.512875Z","title":"Xlnet: General- ized autoregressive pretraining for language understand- ing","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.512875Z"},"links":{"cited_paper":"/paper/1906.08237","citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:8e54ae2db5fbecfbfd3a99b3deeda1d09018a16a5fe1051272edfe2b99db620f","observation_id":"303e90cc-fa1b-4e3c-8172-eba665d8302b","resolution":{"observed_at":"2026-08-14T12:45:14.512875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:45:14.906476Z","title":"Protocols for secure computations","venue":null,"work_id":"7a4cb2c0-1762-4b92-8b81-d0ee1b9bc1bd","year":1982},"citing_paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T12:45:14.520793Z"},"links":{"citing_paper":"/paper/1908.06972"},"observation_digest":"sha256:29cfcd406ed98bb047b96da3c2910c2f68d06b22af3b9c22e077eab7667be2c9","observation_id":"308a13fe-a79a-4b24-9c94-e1deb9bfeab2","resolution":{"observed_at":"2026-08-14T12:45:14.911955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06972","last_updated":"2019-11-18T10:12:16Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-16T02:24:54.670593Z","submitted_at":"2019-08-19T03:44:57Z","title":"PrivFT: Private and Fast Text Classification with Homomorphic Encryption"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":41},"total_outbound_references":56},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:1908.06972."}