{"as_of":"2026-08-09T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:89c9f5f54b3ab1932a9d5859ba16e41f538dbc4402f12cd838f61c45a9d455ea","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-09T06:31:02.800959+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-08T11:03:44.357154Z","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:fec0ce71dfd957fa4b02b587930448103b3786ed34d382cf5cc8bfcbbecb038f","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-07T12:56:43.323460Z","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-08T11:03:44.357154Z","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:68d9b21d2290a50be7180c7f434f69cadc89f57b2f2d9699b722b3a2050e8b61","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-08T11:03:44.357154Z","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:80f49df07bbc910aadfd6df8a8c26870dbb182c0f56efde194b112e03bde7e04","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-08-07T22:36:46.691875Z","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-08T11:03:44.357154Z","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:b3a8c15dd3f5ce5ea365648d0f85ae5eb5394d78d08930798be75a3cb62849e3","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-08T11:03:44.357154Z","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:cb3632638cfd4cb6b9e31ef59d43fb8a9685d82100d06b5408231b409f22f1a9","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-08T11:03:44.357154Z","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:f65326a99a311637de5c41a9de5bc6b20dfc54b83779e6e6f6e2a765b1e9877d","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-08T11:03:44.357154Z","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:aa00d525ecbbb5e0c4d3900ad61c7f81240f1aecb217b38438c5662b016cadb9","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-08T11:03:44.357154Z","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:511b51b9764550423129485bd1af5fde9029cbd28dd7d2cdea2fe6eee3e9a603","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-08T11:03:44.357154Z","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:848c7bd6ac570cbb90ff131c3723265b77901d8b8c3275fb16dcc96620ac3530","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-08T11:03:44.357154Z","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:a6e9028cf09a404845f56d3415c5edbffc29dc9b2e193d54a6ceda2403d681f7","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-08T11:03:44.357154Z","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:5cb719c97a223b84ef7394908cb72c3ad2df677798265e2b311bebdf206706fb","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-08T11:03:44.357154Z","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:da849ce59940fc91cac9e5a9863044da15b81e63deca6307b7120c64e5692350","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-08T11:03:44.357154Z","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:68c151fb54de62921194720ffd232ad53414b593f01475f483274025406dcdd3","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-08T11:03:44.357154Z","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:e8a505c6dd1d3f6fd7d8f99073f04f2c4780806e8745bf9c38ef7fb7efba2cb3","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-08T11:03:44.357154Z","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:0eafd3b3ecb43ef0990469b1861ed10edda0c95d00eb7a83ebbe6adc7763cc65","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-08T11:03:44.357154Z","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:331c5f67d6afc352631c3d8d528bdeb0096581aa93fb7a839ca19002fdaceaa1","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-08T11:03:44.357154Z","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:7f7a6560e605c9aef90dd205f0258a391e388dfd3c4a8dc2283bcdc99ea27084","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-08T11:03:44.357154Z","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:e13c174188c93a6e119aa9bdcc6abc9508f05944483afbc7e4d6c8c7e3ddecde","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-08T11:03:44.357154Z","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:9e18567bb739ba65e30f2e186b78fff2e0b4ee279eeb57654dac77066d23a258","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-08T11:03:44.357154Z","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:70d4751cea5fb17d1e0ba72d1a8f17f04c7e206c656e829286be2e010cca82bd","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-08T11:03:44.357154Z","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:ee4a06ec7420c84ca6ca00590ddbbf5d4c7124471f67bea604ca5a4a12d187b0","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-08T11:03:44.357154Z","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:8cdd98f7379c49dc19f78530c582729ab4b3e09964a6ed83eadad671bf3f69e3","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-08T11:03:44.357154Z","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:61089b60ed62f549e1438cd624d6795d3b79cbbdb4d2c2ee1830b206a2bffc63","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-08T11:03:44.357154Z","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:fa20057c9c066165e017a162648f9e430bc9d34ad178cf6e8758b397823ceba2","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-08T11:03:44.357154Z","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:7095b828f1cc89886f6b3a22b82b4388527d28b5b50eaec6dd0bed55260a39b6","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-08T11:03:44.357154Z","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:083dcd261b0c5409d971961eee819be6035591cfa74c34e0bcc24ed127d2edaf","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-08T11:03:44.357154Z","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:a82a8d4543e2511f2eb27003fa110e1f01d999214e42d088faa167daf177a6d9","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-08T11:03:44.357154Z","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:98c22d6ad66e514a92defca080329355b44622984d5572816d2de41d136fefa1","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-08T11:03:44.357154Z","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:e8ea5ce795191cb2a6b2dc6c8e3aab39be2b4523ca3227f7d66d3b4e19c1d325","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-08T11:03:44.357154Z","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:1855727fb915ca291a51e2ec8cf3dfdd73e46a716b5581644ddc1ff3d25e03ee","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-08T11:03:44.357154Z","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:8839b3fb66559f75dbab411aaa5202bbada1e76d9e8fa254266a0b76c65aa4da","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-08T11:03:44.357154Z","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:490f77048d6aa92a0c3c06ea540fc1fee36f64396c2f3e09b7e81485b678ebcd","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-08T11:03:44.357154Z","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:897bc3226229e167772a551586488bfb731454f1975871cc77b880858451a6de","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-08T11:03:44.357154Z","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:3d750b3522db5744c7c31ad96d76f50d4d2c3745669a9982c1ad43a9f3fdb6f8","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-08T11:03:44.357154Z","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:ef4ed872c132d02a1cd5b0bdbce649918f1747e15c6a7dc51f57cdcdfc6cc16f","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-08T11:03:44.357154Z","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:b2299c7a367088117f5595cff5e70aa6c0eec1c9fcdbfbb0345fee521c838a6f","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-08T11:03:44.357154Z","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:819a715ec91a7637a5294451097ddd14226dcf6911d82a0451cc07b150fdbfdd","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-08T11:03:44.357154Z","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:c7c61353d8647acaec7c45384f199031d89500ff41a22586c27d9ebec3628b8e","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-08T11:03:44.357154Z","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:8d1b4fa1a75eab6af723a8272eabd4a360f86b3e8f7aca6cc0a3e30b465d5262","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-08T11:03:44.357154Z","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:19136db3b7d84986d6ec7eb5fafd611ab3b4746efece373691680d31b28d3ebe","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-08T11:03:44.357154Z","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:25d2370431745bc0c03f25a2eba7d69d03ada8004becebafc66a7324496211ee","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-08T11:03:44.357154Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2509.09424."}