{"as_of":"2026-08-15T11:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:32f22fd0929614bcb8cefbf20106cfa81a1d5a55288f6e5acf6f186d556ced0e","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:48:37.939510Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:57:09.364103Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T06:07:19.323615Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.06957","snapshot_observed_at":"2026-08-14T13:57:09.364103Z","title":"On the capacity of secure distributed matrix multiplication,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.364103Z"},"links":{"cited_paper":"/paper/1908.06957","citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:1279e2b1af3541f841ac0c43f0ba16dff2070d24844bf2b62c311a47c81d44f2","observation_id":"14acc4e0-b5b4-45b0-8d60-03ee6f0edc9a","resolution":{"observed_at":"2026-08-14T13:57:09.364103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.06957","snapshot_observed_at":"2026-08-14T10:44:27.837302Z","title":"On the capacity of secure distributed matrix multiplication,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"1908.10854","last_updated":"2019-08-28T17:53:52Z","snapshot_observed_at":"2026-08-15T07:26:28.422464Z","submitted_at":"2019-08-28T17:53:52Z","title":"$X$-secure $T$-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.837302Z"},"links":{"cited_paper":"/paper/1908.06957","citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:6b59c8c183a7e89564876b9a18739828e4b174562359b013856fccf95a4df7e6","observation_id":"9b8181de-dd86-4994-be6c-e32fddfb78f7","resolution":{"observed_at":"2026-08-14T10:44:27.837302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"cited_work":{"arxiv_id":"1908.06957","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.06957","snapshot_observed_at":"2026-08-14T06:07:19.323615Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","venue":"cs.IT","work_id":"42879d87-ef10-4b13-a507-7254656f3095","year":2019},"citing_paper":{"arxiv_id":"1909.00407","last_updated":"2019-12-18T18:36:45Z","snapshot_observed_at":"2026-08-14T23:34:54.662960Z","submitted_at":"2019-09-01T14:09:01Z","title":"Private and Secure Distributed Matrix Multiplication with Flexible Communication Load","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.146832Z"},"links":{"cited_paper":"/paper/1908.06957","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:9116189d378bc1969c4ffe1cc0f903732f078638a085d5cc949ef737b458740a","observation_id":"e5dad731-08f9-40a8-900e-7c21ac8bfc15","resolution":{"observed_at":"2026-08-14T06:07:19.328370Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.06957/citation-record","integrity":"/paper/1908.06957/integrity","json":"/paper/1908.06957/citation-record.json","paper":"/paper/1908.06957"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.289071Z","title":"High-dimensional co ded matrix multiplication,","venue":null,"work_id":"1fb90254-a29b-46cb-8f79-30d6a58a3185","year":2017},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.223354Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:baec0736290293409d596cd2a58c4d33fbfc3f7fa3cf52877cb8c4a6d1121d11","observation_id":"b6449701-bc5c-45f8-8583-c9674dbb2cee","resolution":{"observed_at":"2026-08-14T12:48:39.305177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.217217Z","title":"Polynomial cod es: An optimal design for high- dimensional coded matrix multiplication,","venue":null,"work_id":"64ea61ca-f180-489b-bf9a-73be8783142c","year":2017},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.284065Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:7276f8cd805f1d51caabe1607243c0de3dea3d56e16e85180bcd8c0ef51e75dd","observation_id":"f29c44ac-9070-419e-a3d3-4e8ae4885ff8","resolution":{"observed_at":"2026-08-14T12:48:39.251996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.204371Z","title":"On the optimal recovery threshold of coded matrix multiplication,","venue":null,"work_id":"7d6218d6-8fe2-4cc6-a129-905d50f2827b","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.352460Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:944b585d33cad0a001170bea631f14166ccf658eb27d31b934a73f0230075589","observation_id":"9128d0ff-f903-4078-bb55-31e499e3921f","resolution":{"observed_at":"2026-08-14T12:48:39.209022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10751","last_updated":"2018-11-27T00:06:47Z","snapshot_observed_at":"2026-08-14T17:52:57.111956Z","submitted_at":"2018-11-27T00:06:47Z","title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10751","snapshot_observed_at":"2026-08-14T12:48:37.357205Z","title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Ma trix Multiplication,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.357205Z"},"links":{"cited_paper":"/paper/1811.10751","citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:d5faeca261fa79be36eafcc9318d1db29695d90f06b90e881ed4c809e3d90ee8","observation_id":"fe5de1ab-628a-41c5-bc7d-b2aa4f170cc5","resolution":{"observed_at":"2026-08-14T12:48:37.357205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.191333Z","title":"Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,","venue":null,"work_id":"1fd052ec-0c55-47d7-84da-b2ecd63be15a","year":1920},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.362445Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:73bda6b88712780b5e2be8cc45845cdce0af83774ab18d248b410f763d6e53e6","observation_id":"65d7ec98-b037-4ee9-bfe1-59707ef74e06","resolution":{"observed_at":"2026-08-14T12:48:39.196032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.177746Z","title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy,","venue":null,"work_id":"97913557-3e32-45d2-a842-1605d68a38d7","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.367001Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:2b1b3a757d348114299e11e6e0365a4754d557ec0605067ad13993b47c2f002f","observation_id":"047e4f30-9056-44e8-980e-920f8294286d","resolution":{"observed_at":"2026-08-14T12:48:39.182252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.125167Z","title":"Secure Distributed Computing with St raggling Servers Using Polynomial Codes,","venue":null,"work_id":"09fcd5e6-258d-4594-b373-77ee5cdc9dc7","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.371691Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:64e69719ce6f4e1ce98abef15cb4f76728cecfca745ff641af2d49fd13c42c9d","observation_id":"dca51bb1-8af2-49c9-9247-ffdb2bef5e6b","resolution":{"observed_at":"2026-08-14T12:48:39.158436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00469","last_updated":"2018-06-01T17:59:16Z","snapshot_observed_at":"2026-08-14T19:08:25.844240Z","submitted_at":"2018-06-01T17:59:16Z","title":"On the Capacity of Secure Distributed Matrix Multiplication","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.00469","snapshot_observed_at":"2026-08-14T12:48:37.375829Z","title":"On the Capacity of Secure Dist ributed Matrix Multiplication,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.375829Z"},"links":{"cited_paper":"/paper/1806.00469","citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:2adccefcbaeeca228f29ae51577e4a1147612ebfd53e6e46bb5e4a420dae3f54","observation_id":"bbc89c3b-6580-44be-967e-92ac027ccb56","resolution":{"observed_at":"2026-08-14T12:48:37.375829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.086234Z","title":"On the Capacity and Straggler-Robustness of Dis- tributed Secure Matrix Multiplication,","venue":null,"work_id":"3160588f-4c48-4f59-a944-de4d55512c18","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.464703Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:e3b9e2df1fcea8bf6869350275953774218ca4043b74da55a5d92d37486af1b4","observation_id":"59dc4ecb-a487-41c1-bd60-751465ac3e20","resolution":{"observed_at":"2026-08-14T12:48:39.090443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.073461Z","title":"Gasp co des for secure distributed matrix multiplication,","venue":null,"work_id":"57fba80a-ce52-4e1d-89c2-31e6ce35a987","year":2020},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.525650Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:673415c4e923942af6b419f48910ece31c24a1036323e1464f4881d680c7e376","observation_id":"63952c03-ef46-4306-ae10-c30d00268686","resolution":{"observed_at":"2026-08-14T12:48:39.077686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.059204Z","title":"Private and s ecure distributed matrix multiplication with flexible communication load,","venue":null,"work_id":"b5c1c679-c3f1-4b87-94d4-a1d4e5029042","year":2020},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.592436Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:e6576ca44da07864c85fe929f78d0cb6fb4e14c80b1917b125fd78266f035738","observation_id":"fad2dd33-7769-4831-a61d-9cfea16b8e27","resolution":{"observed_at":"2026-08-14T12:48:39.064319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:39.043028Z","title":"Pr ivate Information Retrieval,","venue":null,"work_id":"939611eb-d50d-4114-9e44-2ef3c1dd4b7f","year":1995},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.629683Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:f811993e8437ee9179399d6e76b4c0ac07ce0f00eebf440981d45f3f567b047c","observation_id":"7f8ba69d-d854-41ec-9300-ffb9d1e90d62","resolution":{"observed_at":"2026-08-14T12:48:39.048285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.924722Z","title":"Multi-message Private Infor mation Retrieval: Capacity Results and Near-optimal Schemes,","venue":null,"work_id":"04b4a995-58b6-4c66-9223-a2c3d8ba3605","year":2018},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.634272Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:26f15b442a12889600208ca1407bd11cd388266afaedb37fc99ec1c09155d79d","observation_id":"fb0490af-778b-40d0-97c7-fcd1c34a3f78","resolution":{"observed_at":"2026-08-14T12:48:38.929008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.05797","last_updated":"2018-08-17T08:45:35Z","snapshot_observed_at":"2026-08-14T18:40:04.446860Z","submitted_at":"2018-08-17T08:45:35Z","title":"Single-Server Multi-Message Private Information Retrieval with Side Information","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.05797","snapshot_observed_at":"2026-08-14T12:48:37.638609Z","title":"Single-Server Multi-Message Pri vate Information Retrieval with Side Information,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.638609Z"},"links":{"cited_paper":"/paper/1808.05797","citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:4805d677ee73b782d50f7393781787d4246ced5d78b520a3c7f1474d04aa5c6b","observation_id":"a785799b-a552-4032-a75f-96650938e9a7","resolution":{"observed_at":"2026-08-14T12:48:37.638609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.911284Z","title":"Cross subspace alignmen t and the asymptotic capacity of x -secure t -private information retrieval,","venue":null,"work_id":"c2ac3454-63ab-4fbc-9d14-e9e4b5016f88","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.643383Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:60ff7b986cfb7187eb7c9cc95ac24ed07c8c68b616b7fcf8573a408e652a8ff9","observation_id":"b6745fa0-55c1-4252-ad62-927f8426c419","resolution":{"observed_at":"2026-08-14T12:48:38.915571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:37.648198Z","title":"X-secure T -private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.648198Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:004538be3e4bbbaca0f2eb8e494998848742127ba5f7cc4f9f84723560f7fa82","observation_id":"40a8256f-962b-4c6a-908c-9511e370c9ef","resolution":{"observed_at":"2026-08-14T12:48:37.648198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.831486Z","title":"Cross subspace alignment codes for coded distribu ted batch computation,","venue":null,"work_id":"3389ed20-a5f8-4431-a18c-adafe7e4eb64","year":2021},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.652448Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:3150f730d2e713be5b2227644fde24d0234f62b6831938109df7fdbc12b0e980","observation_id":"ec356550-b072-4c2d-ac1a-f5758a293e1d","resolution":{"observed_at":"2026-08-14T12:48:38.887296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.818833Z","title":"The Capacity of Private Computat ion,","venue":null,"work_id":"8b6fae12-1a8a-4411-9171-513fde065ee0","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.656431Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:c7eeb5c999f9b63af4399f0fa6c69c60b8a10b382617d8e67a7304555e4fb359","observation_id":"55d89b26-2454-4b54-8e6a-d6c16de14db3","resolution":{"observed_at":"2026-08-14T12:48:38.822760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:37.660332Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.660332Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:9f8ea7802172c0c39b2a79418226a05c8089af63d607b8b367184417017a722f","observation_id":"73ea54d9-53c7-428a-b1bb-067957f64e7b","resolution":{"observed_at":"2026-08-14T12:48:37.660332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.796826Z","title":"The Capacity of Private Informat ion Retrieval,","venue":null,"work_id":"8aa74383-aef6-41c3-a40c-d04bd09f1e3b","year":2017},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.664523Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:093551006989a4f18d303ffa2675b594afa33a6071fdf27566e9386e1bd4b5d4","observation_id":"d9961bcd-eba9-4b17-b1bc-0ff46933e956","resolution":{"observed_at":"2026-08-14T12:48:38.800928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.774891Z","title":"The Capacity of Robust Private Information Retrie val with Colluding Databases,","venue":null,"work_id":"1695e108-9de2-4d4f-b71f-4a54a9e14d62","year":2018},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.668290Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:3529598baa5099a3b3454d1883c1588a4eb80fcee994afe40abb6b6313ecf162","observation_id":"56d81390-09a2-455e-99d2-19e2d4db1069","resolution":{"observed_at":"2026-08-14T12:48:38.787971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.703693Z","title":"The Capacity of Symmetric Private Information Ret rieval,","venue":null,"work_id":"71e47add-b827-4839-8f73-e44a6aa16d8a","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.672133Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:179bfe74443bde3b76fbd1041ccfc7dbf57026a543aee6cbbffff9c373356b54","observation_id":"d59956c0-7725-4dde-bb51-d1bd8a9e0d28","resolution":{"observed_at":"2026-08-14T12:48:38.727896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.647102Z","title":"The Capacity of Private Infor mation Retrieval from Coded Databases,","venue":null,"work_id":"0587d07d-b9f7-4273-99da-d2a7b6a7c691","year":1945},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.675886Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:699ae3ac25263f886df3334ae55af4f5d3a1fdd82b904f977bca53b0065d391b","observation_id":"5105b1c8-833c-4c22-923d-cbfa9adf1605","resolution":{"observed_at":"2026-08-14T12:48:38.651355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.04677","last_updated":"2017-11-15T16:26:26Z","snapshot_observed_at":"2026-08-14T20:14:13.743282Z","submitted_at":"2017-11-13T16:13:11Z","title":"Private Function Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.04677","snapshot_observed_at":"2026-08-14T12:48:37.679618Z","title":"Private Function R etrieval,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.679618Z"},"links":{"cited_paper":"/paper/1711.04677","citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:acf120310261e809ccf8e8b154a97877795eda5d91d549301650033264098903","observation_id":"8fc3cf7c-7193-4eba-b84a-c4d510a95b65","resolution":{"observed_at":"2026-08-14T12:48:37.679618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.633732Z","title":"Private Information Retrieval from Coded Databases with Colluding Servers,","venue":null,"work_id":"6835967f-c2a1-400b-971f-9c9677b542be","year":2017},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.683642Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:3a57d9d4a311fc57faa6b8640bb5a4f2fa94ee888d1048c8f5cd55f60c43e003","observation_id":"c766016e-4ea5-4fd9-b5da-9bd9d80dc898","resolution":{"observed_at":"2026-08-14T12:48:38.638486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.618279Z","title":"Private Information Retrieval f rom MDS Coded Data with Colluding Servers: Settling a Conjecture by Freij-Hollanti et al","venue":null,"work_id":"a1439ae9-f5ed-4f0b-a989-afd65adbfdf1","year":2018},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.741923Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:259e609bf2abc53d5382bd9e03bad7b7c9ac0aa179894c0075029c9adcc7beca","observation_id":"4a639cec-2200-4510-b918-a5da7839b249","resolution":{"observed_at":"2026-08-14T12:48:38.624452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.514283Z","title":"Tow ard Optimal Secure Distributed Storage Systems with Exact Repair,","venue":null,"work_id":"488d2daf-7987-4a14-8e8e-ab3f65b510e4","year":2016},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.816418Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:6ebf77483f003005b17c06c17236e260dd46ab0d344fcb86c157eb5777ac48f4","observation_id":"1689239e-ba9f-46eb-9ffa-48cafca9bea6","resolution":{"observed_at":"2026-08-14T12:48:38.564346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.462330Z","title":"The capacity of pri vate information retrieval from uncoded storage constrained databases,","venue":null,"work_id":"40b12e0f-2067-46e9-8639-7f1f81e9b6e7","year":2020},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.879498Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:4f35492385a9e70a59afdb594d64f68d0d1c013d026bb173d636fe249126d544","observation_id":"481797b0-c84e-4c79-9020-485503a91823","resolution":{"observed_at":"2026-08-14T12:48:38.466509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.448289Z","title":"Fundamental Limits o f Cache-Aided Private Informa- tion Retrieval With Unknown and Uncoded Prefetching,","venue":null,"work_id":"9d3d55f4-ea92-4433-8e8c-9046abe09189","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.921370Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:22a3a60318d2497ce075d4e942448e5339fc23bf81493d801087f6c0b9768df2","observation_id":"7303074e-e851-4b95-aa33-7ff475469050","resolution":{"observed_at":"2026-08-14T12:48:38.453605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.433401Z","title":"Private information retrieval with side information,","venue":null,"work_id":"0beb2054-7460-44d4-9ac9-b534e1f4c0fb","year":2019},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.925869Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:32f7542e4604d256e7ac833668ee63032ee83fff7978445153ea89f5da452438","observation_id":"da3fbaf2-df57-4bd1-aa20-d3944558700a","resolution":{"observed_at":"2026-08-14T12:48:38.438327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.07035","last_updated":"2017-06-21T17:56:11Z","snapshot_observed_at":"2026-08-14T20:52:29.512627Z","submitted_at":"2017-06-21T17:56:11Z","title":"The Capacity of Cache Aided Private Information Retrieval","version":1},"cited_work":{"arxiv_id":"1706.07035","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.07035","snapshot_observed_at":"2026-08-14T12:48:37.973206Z","title":"The Capacity of Cache Aided Private Information Retrieval","venue":"cs.IT","work_id":"98b94566-2973-4ca0-a465-87c9b04362d8","year":2017},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.930523Z"},"links":{"cited_paper":"/paper/1706.07035","citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:e34d9bf04b2eac403bf4093b45ee42ba08a8b5276244f1be117423b9c3a47051","observation_id":"02ce60e8-a8c5-4f43-9478-e0f6709bf681","resolution":{"observed_at":"2026-08-14T12:48:38.029045Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.403621Z","title":"The capacity of t-priv ate information retrieval with private side information,","venue":null,"work_id":"fdc15526-3a48-4a3a-a6a9-d71c3c73f84b","year":2020},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.934970Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:e9e6fdf178bef108e2084ddc9d93fb6210b7eca5bb0c1bab90a259d936d0a055","observation_id":"4b17984d-430f-4305-8672-6d9bed7ca6a9","resolution":{"observed_at":"2026-08-14T12:48:38.424047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:48:38.332854Z","title":"How Often do Determinants Over Finite F ields Vanish?","venue":null,"work_id":"b9377ceb-e90c-4fd0-999f-7cf7e8efdce7","year":1987},"citing_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:48:37.939510Z"},"links":{"citing_paper":"/paper/1908.06957"},"observation_digest":"sha256:e58510f253a032b647667b4ba6a28bc45e2e818687b3048d507c8f2a373a0e1d","observation_id":"e23378ff-9d21-4eae-9237-703f7ae24e15","resolution":{"observed_at":"2026-08-14T12:48:38.337457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":26},"total_outbound_references":33},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 3 inbound Pith citation observations for arXiv:1908.06957."}