{"as_of":"2026-08-07T10:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:214067570a3cfb3aab426d57234d92a8d6ee692e8b8acc643437fcd90a617749","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T19:10:41.737495Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2509.09424/citation-record","integrity":"/paper/2509.09424/integrity","json":"/paper/2509.09424/citation-record.json","paper":"/paper/2509.09424"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-04T19:10:41.546851Z","title":"Llama: Open and efficient foundation language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.546851Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:98e59f2d84c5db7085d61925ab07548963e7cbf3c39621baa6bd70a3087eac53","observation_id":"e31f12d6-7fd3-457a-a873-171ee8027d42","resolution":{"observed_at":"2026-08-04T19:10:41.546851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-02T11:57:18.735747Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-04T19:10:41.554323Z","title":"Llama 2: Open foundation and fine-tuned chat models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.554323Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:7ba42e25e59dca84166a91e1c116b47e3aaa3d174490b72e8676a77e70cd596d","observation_id":"4045544d-2396-40f8-9675-959768668033","resolution":{"observed_at":"2026-08-04T19:10:41.554323Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.559561Z","title":"Language models are unsupervised multitask learners,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.559561Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:b4258da7048050e4e43b3b7eab942003f4bbac488210e21cf7cf824737b445df","observation_id":"53844773-4e7f-47d3-9bb1-c573dfeddc4b","resolution":{"observed_at":"2026-08-04T19:10:41.559561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17884","last_updated":"2024-06-28T23:27:10Z","snapshot_observed_at":"2026-07-06T16:39:20.716423Z","submitted_at":"2023-10-27T04:15:30Z","title":"Can LLMs Keep a Secret? Testing Privacy Implications of Language Models via Contextual Integrity Theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17884","snapshot_observed_at":"2026-08-04T19:10:41.564763Z","title":"Can llms keep a secret?testing privacy implications of language models via contextual integrity theory,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.564763Z"},"links":{"cited_paper":"/paper/2310.17884","citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:c42e3d868123a5f07312845cb15364ad6ba241ab47d91020f8b7999bed87b930","observation_id":"ce8cfd25-aabe-4fd1-b9b8-35c260a89431","resolution":{"observed_at":"2026-08-04T19:10:41.564763Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.570115Z","title":"Protocols for secure computations,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.570115Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:6317d05a80dc8de8dcaa17c1f526be3682c5ec6692a45f15c9a5ded7e3c9b20f","observation_id":"df16f66a-f5c3-4675-a876-12650d2b8f54","resolution":{"observed_at":"2026-08-04T19:10:41.570115Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.574682Z","title":"Fully homomorphic encryption using ideal lattices,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.574682Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:e0102267c07dd18490f507a2a497d2c8f3124362c8566a1f246e05cc5ea50b97","observation_id":"a36eab16-0a5a-4065-b52c-f327d2dba0ab","resolution":{"observed_at":"2026-08-04T19:10:41.574682Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.579681Z","title":"Gazelle: A low latency framework for secure neural network inference,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.579681Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:a4f75349c72050c0b111c7ff291e81eb049ff8b99334ed476b78eea600014184","observation_id":"b69bb71a-e26a-4feb-b638-c926ee9e44da","resolution":{"observed_at":"2026-08-04T19:10:41.579681Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.585088Z","title":"Towards the AlexNet Moment for Homomorphic Encryption: HCNN, the First Homomorphic CNN on Encrypted Data With GPUs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.585088Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:f599c015237759239ea0e5aa8cabe63ae09bf34774f18a496181bbd7cfc119e6","observation_id":"1f77c1df-40ff-4b17-bf64-ddf87a075299","resolution":{"observed_at":"2026-08-04T19:10:41.585088Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.589436Z","title":"Cheetah: Lean and fast secure Two-Party deep neural network inference,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.589436Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:0cfad771edd08f4d17c7d091ecbc80007aa5618f477a76f2b9948b1c33ad63f7","observation_id":"5c3fe9f5-2c63-44e3-81fd-cfaf4521d381","resolution":{"observed_at":"2026-08-04T19:10:41.589436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02486","last_updated":"2025-02-21T01:13:08Z","snapshot_observed_at":"2026-08-05T09:53:25.030382Z","submitted_at":"2024-10-03T13:48:35Z","title":"Encryption-Friendly LLM Architecture","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02486","snapshot_observed_at":"2026-08-04T19:10:41.594147Z","title":"Encryption-friendly llm architecture,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.594147Z"},"links":{"cited_paper":"/paper/2410.02486","citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:8627a1ffa8a2370fa7894c01f88a9260bd27867018884b9d3d8f41f6273ffe7d","observation_id":"e13d44bf-8c48-4696-83ef-ebd12a3602c9","resolution":{"observed_at":"2026-08-04T19:10:41.594147Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.599019Z","title":"Nimbus: Secure and efficient two- party inference for transformers,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.599019Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:febb60899c7b7c1d27ad6a8ddcbcacdb97b491fc3eb07713e5d07c023cb718b5","observation_id":"6b951c84-700c-450a-af3a-65850ad609c0","resolution":{"observed_at":"2026-08-04T19:10:41.599019Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.604505Z","title":"Secure transformer inference made non- interactive,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.604505Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:9e3c0a20f49b43be2fce035510742928eb72157df5d06f74f35291baecf1c841","observation_id":"a72ac084-268e-4770-bab1-a709cab78549","resolution":{"observed_at":"2026-08-04T19:10:41.604505Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.609160Z","title":"Homomorphic encryption for arithmetic of approximate numbers,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.609160Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:8e4f2cf18be92760113fb0421f690006b5cee9d61386b03d4d44d898f3a925f9","observation_id":"76d2594c-6717-4717-9961-2512cdc21385","resolution":{"observed_at":"2026-08-04T19:10:41.609160Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.613351Z","title":"A full rns variant of approximate homomorphic encryption,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.613351Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:f27c0d39f87008de8646880d9db0a8e91c7cd600deaff7e3d54e78b3956721e3","observation_id":"e2093ab5-dd35-4994-a333-cc537a1b1151","resolution":{"observed_at":"2026-08-04T19:10:41.613351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11453","last_updated":"2023-10-17T17:59:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-17T17:59:15Z","title":"BitNet: Scaling 1-bit Transformers for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11453","snapshot_observed_at":"2026-08-04T19:10:41.617689Z","title":"Bitnet: Scaling 1-bit transformers for large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.617689Z"},"links":{"cited_paper":"/paper/2310.11453","citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:ed25d8a7c1910227817a622bc17a0fe42a2114153718f529e0975087c4e27f78","observation_id":"a6818774-47f7-48f3-8da5-84e2c8644052","resolution":{"observed_at":"2026-08-04T19:10:41.617689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17764","last_updated":"2024-02-27T18:56:19Z","snapshot_observed_at":"2026-08-03T00:59:01.026576Z","submitted_at":"2024-02-27T18:56:19Z","title":"The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17764","snapshot_observed_at":"2026-08-04T19:10:41.622492Z","title":"The era of 1-bit llms: All large language models are in 1.58 bits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.622492Z"},"links":{"cited_paper":"/paper/2402.17764","citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:69b1913f50c674da2425ca2c63b7849fb777f35912e418e00276b85ce161b32c","observation_id":"6a5adeb0-ae94-4451-b8b8-197f23d13716","resolution":{"observed_at":"2026-08-04T19:10:41.622492Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.626991Z","title":"Theory, analysis, and best practices for sigmoid self-attention,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.626991Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:405e8fb36df47e1429affe704a0aba04d379a2e1bbbb2f8b3f73fd281487f98e","observation_id":"e5f491ca-79bc-4dea-8795-0fba7fd9cfd1","resolution":{"observed_at":"2026-08-04T19:10:41.626991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01452","last_updated":"2023-03-16T06:51:31Z","snapshot_observed_at":"2026-07-06T14:13:46.912823Z","submitted_at":"2022-11-02T19:43:22Z","title":"MPCFormer: fast, performant and private Transformer inference with MPC","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.01452","snapshot_observed_at":"2026-08-04T19:10:41.631377Z","title":"Mpc- former: fast, performant and private transformer inference with mpc,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.631377Z"},"links":{"cited_paper":"/paper/2211.01452","citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:1444f517ac8de4d9600ec4f944bf4d8dce5d307e90ac012b0417c2fc7ce16d36","observation_id":"4db7aec7-2cac-44ba-9294-ad844ded8af0","resolution":{"observed_at":"2026-08-04T19:10:41.631377Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.636036Z","title":"Puma: Secure inference of llama-7b in five minutes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.636036Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:94fe9fbe1b546ab7c4f9982468af7763ce7d22ddde3b57f5b2381f5194b98008","observation_id":"5a3f71a9-f00b-45fa-a80f-657906a1433d","resolution":{"observed_at":"2026-08-04T19:10:41.636036Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.640706Z","title":"Privformer: Privacy-preserving transformer with mpc,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.640706Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:196a53c7934e9278d18574c7e84a07ad41120926006e7b724569e0486751e68e","observation_id":"dd771a69-27ce-4ddb-b214-0c48a7c7cea8","resolution":{"observed_at":"2026-08-04T19:10:41.640706Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.645432Z","title":"THE-X: Privacy-preserving transformer inference with homomorphic encryption,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.645432Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:a873515141980fa9b56a990ca9153faf53cca95ba790709ba2832edeae55c705","observation_id":"f84da38a-4ce0-4587-9c32-3652e96fb6df","resolution":{"observed_at":"2026-08-04T19:10:41.645432Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.649768Z","title":"Iron: Private inference on transformers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.649768Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:56e544a8ae4d85b78c14af05ff07d7545fec9799dc48a8b7eaa355e4045836a3","observation_id":"d71ce75e-6415-434c-896a-7dab690b20e3","resolution":{"observed_at":"2026-08-04T19:10:41.649768Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.654946Z","title":"Bolt: Privacy-preserving, accurate and efficient inference for transformers,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.654946Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:94f69dfea92186ee0de9857d396aca912b245cb67f4d35daa8992837c32930bb","observation_id":"f6c16e5a-62c7-4be8-9bdd-947aeb9c9f9a","resolution":{"observed_at":"2026-08-04T19:10:41.654946Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.659242Z","title":"Bumblebee: Secure two-party inference framework for large transformers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.659242Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:934f6685ad8de2bba625531b9f11f076f2d437f6d72575f769c5b868d5bb64be","observation_id":"9a2dee1b-22b8-4441-bdcb-30d4321d39b4","resolution":{"observed_at":"2026-08-04T19:10:41.659242Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.663754Z","title":"Powerformer: Efficient privacy- preserving transformer with batch rectifier-power max function and optimized homomorphic attention,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.663754Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:59813a4a968e5d2e907e95c936247ae71474747dee09c140da5de03c85cec87d","observation_id":"dce55967-210d-4631-bb38-8dcf8496a430","resolution":{"observed_at":"2026-08-04T19:10:41.663754Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.668085Z","title":"A fast, performant, secure distributed training framework for llm,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.668085Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:98aa05a45b5ea5f4a0035b83e49c3daf06455a23776868740d8fa89e7e141417","observation_id":"bd890703-76c6-45ba-b8db-2e6973350baf","resolution":{"observed_at":"2026-08-04T19:10:41.668085Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.672397Z","title":"Teeslice: Protecting sensitive neural network models in trusted execution envi- ronments when attackers have pre-trained models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.672397Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:d32b6ffc53de87747ac49ae5ab1cf1d6f098e1641c576208beaa82221944f86f","observation_id":"2dd179e3-eeb3-449a-9a04-64fd13627e9d","resolution":{"observed_at":"2026-08-04T19:10:41.672397Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.677610Z","title":"Securing ai inference in the cloud: Is cpu-gpu confidential computing ready?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.677610Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:c86ac030acbd0128a268a347f769a87e8463db6bf1a22ba7c0a5811c74c67e16","observation_id":"c44855d9-89e9-4aa3-b922-630c431b9426","resolution":{"observed_at":"2026-08-04T19:10:41.677610Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.682654Z","title":"Graviton: Trusted execution environments on{GPUs},","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.682654Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:4b9868dec48843a3720670fa34a385c00250eba8f7c90ad173e0ccea85a8fdf7","observation_id":"439004e1-2116-41bc-925f-e1adbc0dd3a5","resolution":{"observed_at":"2026-08-04T19:10:41.682654Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.686630Z","title":"Optimized homomorphic encryption solution for secure genome-wide association studies,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.686630Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:cfde96938842636918bc563f0106708da9a1f02d11a4c0892e1fa77a35ea1a42","observation_id":"031e375c-5044-47ac-9e56-62c3fa3cf68c","resolution":{"observed_at":"2026-08-04T19:10:41.686630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05202","last_updated":"2020-02-12T19:57:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-02-12T19:57:13Z","title":"GLU Variants Improve Transformer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05202","snapshot_observed_at":"2026-08-04T19:10:41.690891Z","title":"Glu variants improve transformer,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.690891Z"},"links":{"cited_paper":"/paper/2002.05202","citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:285998fcb6a7ff6fe0cdb2590de4b61b1f5685f04da49727833769f22ad848c7","observation_id":"e895a11c-acc7-4bdf-8bd2-4595a6d3520d","resolution":{"observed_at":"2026-08-04T19:10:41.690891Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.695117Z","title":"Roformer: En- hanced transformer with rotary position embedding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.695117Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:937a6b8f795abfb975db4e419f4786f749251bd45705fd85d25af8b9449ebb1c","observation_id":"9e27cfff-2963-488b-8c19-9b178cdf63eb","resolution":{"observed_at":"2026-08-04T19:10:41.695117Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.699101Z","title":"A baby step– giant step roadmap algorithm for general algebraic sets,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.699101Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:1f8cd6da516086f1b4dd639381c1cf52096d2e03675d838953f21d89a5160491","observation_id":"4a2adfbe-d337-4869-bc2d-60219bb199cd","resolution":{"observed_at":"2026-08-04T19:10:41.699101Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.703857Z","title":"Openfhe: Open-source fully homomorphic encryption library,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.703857Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:53436dc5b4ef14b3d4a0b1e1b7c7607ac96875dc2ba94c5da9ce8ea1a0014987","observation_id":"08fbfdcf-fb4e-444a-bfcd-2ad95968abaf","resolution":{"observed_at":"2026-08-04T19:10:41.703857Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.710344Z","title":"Phantom: A cuda-accelerated word-wise homomorphic encryption library,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.710344Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:35ab5f2d177938227e55e41063ac62a13610b07f8a250c033f147fc98ef498c6","observation_id":"9bb2ffbf-a232-44c4-969e-e9b8e33c5987","resolution":{"observed_at":"2026-08-04T19:10:41.710344Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.714563Z","title":"Microsoft SEAL (release 4.1),","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.714563Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:87c76efc23cc39f7b93f00474720243d6d5966129af146cea09b73a4958e6746","observation_id":"9b145058-c50b-44cb-82e7-3f8fa46ecf3e","resolution":{"observed_at":"2026-08-04T19:10:41.714563Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.719390Z","title":"Homomorphic en- cryption standard,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.719390Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:fbb5feba2751fe1150727e7246083469b1d0312f917c82674067d443b2b38906","observation_id":"804767da-f0cd-4e4c-9824-1b8a94dae8bf","resolution":{"observed_at":"2026-08-04T19:10:41.719390Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.723477Z","title":"Secure outsourced matrix computation and application to neural networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.723477Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:54c42881cfe3ad9f9866aa6593fa60ecdb5e978dff4fc14c3d7379eae6772efb","observation_id":"72e9aded-ea06-49e2-9b73-1a7005e1f0bd","resolution":{"observed_at":"2026-08-04T19:10:41.723477Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.728543Z","title":"Piqa: Reasoning about physical commonsense in natural language,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.728543Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:463a455a05d33dbd9620f7c5de8039cb5e061a19ca81e7f33ccf0974eaa12a12","observation_id":"b828c842-919a-4b68-b1d6-7a125f6808bd","resolution":{"observed_at":"2026-08-04T19:10:41.728543Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.733194Z","title":"Visual choice of plausible alternatives: An evaluation of image- based commonsense causal reasoning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.733194Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:29dcd25e8b2a85082c0e8bec7f9a294f41cb92da6ab7c1c746898b45e0271984","observation_id":"c5b1310f-11ae-4fa5-b519-b36228b10c45","resolution":{"observed_at":"2026-08-04T19:10:41.733194Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:10:41.737495Z","title":"Recursive deep models for semantic compositionality over a sentiment treebank,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T19:10:41.737495Z"},"links":{"citing_paper":"/paper/2509.09424"},"observation_digest":"sha256:b8b73710c2951b38a7f7a43dcd161f9000dd8aea7d3f901ab4dc94614f24b407","observation_id":"8cc3a345-1a5f-4a30-bc29-8169e8ae02a4","resolution":{"observed_at":"2026-08-04T19:10:41.737495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.09424","last_updated":"2025-09-11T13:04:22Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-07T03:50:46.014906Z","submitted_at":"2025-09-11T13:04:22Z","title":"ENSI: Efficient Non-Interactive Secure Inference for Large Language Models"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2509.09424."}