{"as_of":"2026-08-15T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5aa2c928d8f7174b16c76b50397bd3f00913315592168741755275493772b62","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:44:27.885548Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.10854/citation-record","integrity":"/paper/1908.10854/integrity","json":"/paper/1908.10854/citation-record.json","paper":"/paper/1908.10854"},"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-14T10:44:28.335755Z","title":"Private information retrieval,","venue":null,"work_id":"b7a7992f-a2bb-445a-a811-7f4ec93d9ea8","year":1995},"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":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.764824Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:7ad086bc5af7b52f5df942bc26e66ff2d1a4a1271cab3195aad109d4f67014d3","observation_id":"b33d7613-b0c6-4aa2-95be-994d36e91973","resolution":{"observed_at":"2026-08-14T10:44:28.339139Z","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-14T10:44:28.324865Z","title":"The Capacity of Private Information Retrieval,","venue":null,"work_id":"386ee087-4d22-4fe1-8e82-fb8174c78285","year":2017},"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":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.770816Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:afab352d6fda5b1c1238622f5746b20a0403692296782e8762e37745176c4a66","observation_id":"8283ab53-f8aa-45f1-ad27-375b42d9e3cb","resolution":{"observed_at":"2026-08-14T10:44:28.328419Z","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-14T10:44:28.313103Z","title":"Private Information Retrieval from MDS Coded Data in Distributed Storage Systems,","venue":null,"work_id":"116d7702-f2b8-426f-be3c-95725afa5cf0","year":2018},"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":3,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.775662Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:fdd2ab7ff01d590f7d0c8d229d60138e313397a4abd9eeb8f9330b2f475282e1","observation_id":"238422fc-bd30-42d8-bafc-7a54b4dd5ee3","resolution":{"observed_at":"2026-08-14T10:44:28.317165Z","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-14T10:44:28.302884Z","title":"On the efficiency of local decoding procedures for error-correcting codes,","venue":null,"work_id":"5c701e3e-4bd5-453c-b3c1-8556074ef6bf","year":2000},"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":4,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.779899Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:9f4e6431ffcccbcb9348a89d46125c149d003b2e208ee7fe2986a5524faf1f39","observation_id":"038bb383-2069-4312-ad8f-0f32e4c38edb","resolution":{"observed_at":"2026-08-14T10:44:28.306901Z","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-14T10:44:28.289817Z","title":"Locally Decodable Codes and Private Information Retrieval Schemes,","venue":null,"work_id":"42b94886-794e-4833-a410-7c973faf2680","year":2007},"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":5,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.784791Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:b640d5b240657671d847a6db788ed861469dd78d64236fda2cf0fd8c257cbcaa","observation_id":"43b1e2f5-595e-4d61-9865-60ebe8e340fc","resolution":{"observed_at":"2026-08-14T10:44:28.294644Z","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-14T10:44:28.277809Z","title":"On the Locality of Codeword Symbols,","venue":null,"work_id":"607f734f-3175-4a98-95d1-c4e3c47867d8","year":2012},"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":6,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.788935Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:a207fb71d2c79c72f8466748ec37cbf11717c2ddf39030aaf801991cfe8a8aed","observation_id":"4b666488-05b4-4d20-8347-3b0fd9ef982a","resolution":{"observed_at":"2026-08-14T10:44:28.281885Z","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-14T10:44:28.265301Z","title":"Batch codes and their applications,","venue":null,"work_id":"b9b54155-5d35-4680-bc61-22a28592df5f","year":2004},"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":7,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.793579Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:a6677e69edcbef7e2d3faa7feea37a1d79cdf941d6af0e877d2506f54e13d002","observation_id":"dfa5789f-d1d4-4d15-b434-ef57280ef521","resolution":{"observed_at":"2026-08-14T10:44:28.269554Z","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-14T10:44:28.252186Z","title":"How to exchange secrets with oblivious transfer","venue":null,"work_id":"93c3a6e3-dca6-4263-bf6b-8bcc4cedc886","year":1981},"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":8,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.797238Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:addae130a29a5257a7d4f8c99e45b8f3cae0fddedc74468dea2c123e1f9c1c90","observation_id":"cd56f0e3-c250-472c-a249-d81337e38321","resolution":{"observed_at":"2026-08-14T10:44:28.256818Z","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-14T10:44:28.238707Z","title":"Protecting data privacy in private information retrieval schemes,","venue":null,"work_id":"1442d72c-eb59-48b5-887d-06eea67f9fde","year":1998},"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":9,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.800188Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:788a32b50f89fe849267f51e800919752f634d2e2f86e3d0172287f9687418c4","observation_id":"7c7b2a23-de66-4c37-9f76-41c5af8a0814","resolution":{"observed_at":"2026-08-14T10:44:28.242333Z","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-14T10:44:28.228075Z","title":"On hiding information from an oracle,","venue":null,"work_id":"2fd9f1a6-1d40-4b10-95eb-b94d9da97980","year":1987},"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":10,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.804236Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:b964fc1239c7442117b9edc218c6a6d7e9405f0b01cb759da7cc3adc6ac1ec53","observation_id":"34435bc3-0d2c-4ddc-bedc-456394faec2d","resolution":{"observed_at":"2026-08-14T10:44:28.231740Z","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-14T10:44:27.807490Z","title":"How to share a secret,","venue":null,"work_id":null,"year":1979},"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":11,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.807490Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:b6a7335127bec06dc54d0945d84c23cfb563306696641c6aaa0d645367fedac6","observation_id":"7ab1258a-1c18-4e67-8e4b-2936604605c9","resolution":{"observed_at":"2026-08-14T10:44:27.807490Z","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-14T10:44:28.211740Z","title":"Blind Interference Alignment,","venue":null,"work_id":"f4e1d5fb-098e-4c97-b993-83b9c2b58155","year":2012},"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":12,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.810642Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:275df2b023e111b943c6f3a65304b0a016aab0338e6873749d47d6ccfa3cdf95","observation_id":"67df69cb-19d8-485e-b2b2-5d4126e560a7","resolution":{"observed_at":"2026-08-14T10:44:28.215087Z","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-14T10:44:28.200615Z","title":"Blind interference alignment for private information retrieval,","venue":null,"work_id":"eb41de39-dfc6-4a60-beff-12120f79c55a","year":2016},"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":13,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.814187Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:00165a25042d464735efae7b7bc8ef856dc18bbb196b937a6f29c281989ced80","observation_id":"aa3eb2c1-5457-4cb4-b12d-1e5851742d66","resolution":{"observed_at":"2026-08-14T10:44:28.204499Z","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-14T10:44:28.188288Z","title":"Protocols for secure computations,","venue":null,"work_id":"f4b2b0b7-d5ab-449b-9079-120b948772e6","year":1982},"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":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.818085Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:015e55f1f717367e7150201df385cf80dc7d73901eeea9d39af7fd0e34a2d030","observation_id":"9f804146-a9ba-441e-b684-bc487cae1590","resolution":{"observed_at":"2026-08-14T10:44:28.192333Z","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-14T10:44:27.821565Z","title":"On the capacity of secure distributed matrix multiplication,","venue":null,"work_id":null,"year":2018},"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":15,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.821565Z"},"links":{"cited_paper":"/paper/1806.00469","citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:3265270722a4530080793ec3080d57fa1f523545ffde99513c34ca54bfeb2b60","observation_id":"6afc4c96-489e-48ef-b2b7-25a4174d2f6c","resolution":{"observed_at":"2026-08-14T10:44:27.821565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.09962","last_updated":"2020-02-11T21:52:09Z","snapshot_observed_at":"2026-08-14T17:38:48.062364Z","submitted_at":"2018-12-24T18:28:12Z","title":"GASP Codes for Secure Distributed Matrix Multiplication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.09962","snapshot_observed_at":"2026-08-14T10:44:27.825111Z","title":"Gasp codes for secure distributed matrix multiplication,","venue":null,"work_id":null,"year":2018},"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":16,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.825111Z"},"links":{"cited_paper":"/paper/1812.09962","citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:1fc9c5cfc6c78d8a52fb108bef225714445e243172028bb51c9cefbd8abf42bc","observation_id":"46d8d753-6422-4e84-90e9-2df87116638c","resolution":{"observed_at":"2026-08-14T10:44:27.825111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.13006","last_updated":"2018-10-30T21:03:55Z","snapshot_observed_at":"2026-08-14T18:06:46.944743Z","submitted_at":"2018-10-30T21:03:55Z","title":"Rate-Efficiency and Straggler-Robustness through Partition in Distributed Two-Sided Secure Matrix Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.13006","snapshot_observed_at":"2026-08-14T10:44:27.828594Z","title":"Rate-efficiency and straggler-robustness through par- tition in distributed two-sided secure matrix computation,","venue":null,"work_id":null,"year":2018},"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":17,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.828594Z"},"links":{"cited_paper":"/paper/1810.13006","citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:f092b95bc03be7da4f35bc0ae70db0b234f20b19606f2b09d6bec47268899ae6","observation_id":"b2d2a34c-9204-47b3-98a5-018c06aacfaa","resolution":{"observed_at":"2026-08-14T10:44:27.828594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.07705","last_updated":"2019-01-23T03:30:28Z","snapshot_observed_at":"2026-08-14T17:27:18.605832Z","submitted_at":"2019-01-23T03:30:28Z","title":"Distributed and Private Coded Matrix Computation with Flexible Communication Load","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.07705","snapshot_observed_at":"2026-08-14T10:44:27.832849Z","title":"Distributed and private coded matrix computation with flexible communication load,","venue":null,"work_id":null,"year":1901},"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":18,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.832849Z"},"links":{"cited_paper":"/paper/1901.07705","citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:5679ef902e1b69f734d74ac3dee7f2d54d0241c7369f328cb692e3d03acce329","observation_id":"ffba4930-3268-4faa-bc44-9495756e8da1","resolution":{"observed_at":"2026-08-14T10:44:27.832849Z","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":"1906.10684","last_updated":"2019-06-25T17:59:10Z","snapshot_observed_at":"2026-08-02T10:59:14.959371Z","submitted_at":"2019-06-25T17:59:10Z","title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.10684","snapshot_observed_at":"2026-08-14T10:44:27.841784Z","title":"On the upload versus download cost for secure and private matrix multiplication,","venue":null,"work_id":null,"year":1906},"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":20,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.841784Z"},"links":{"cited_paper":"/paper/1906.10684","citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:27adf49df0860cc24198399f6316a13796836a802b3bcfa9bbc45af676106aad","observation_id":"9384ad90-9c67-406d-8e69-2e794da849fe","resolution":{"observed_at":"2026-08-14T10:44:27.841784Z","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-14T10:44:28.176149Z","title":"The Capacity of Robust Private Information Retrieval with Colluding Databases,","venue":null,"work_id":"fcd8078b-96eb-4be8-8a7d-190784fa2bde","year":2018},"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":21,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.846425Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:deb9d7593b68cc3b7fa3e1e088434c5d00fcb4a5c62c21094d3e44665bba3d7a","observation_id":"b149bd09-dc73-46c3-85ee-18ff348c550a","resolution":{"observed_at":"2026-08-14T10:44:28.179703Z","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-14T10:44:28.162995Z","title":"The capacity of private information retrieval from byzantine and colluding databases,","venue":null,"work_id":"f03ed521-4f46-43b5-a267-8eb9df3994d4","year":2019},"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":22,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.851110Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:fef8cf2517cff507dd51ee7e93c6061f701be2e15c6e241318c10772065473ee","observation_id":"93ff3af6-674d-4603-b568-156f3ed4365c","resolution":{"observed_at":"2026-08-14T10:44:28.166704Z","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-14T10:44:28.151591Z","title":"Private informa- tion retrieval from coded storage systems with colluding, byzantine, and unresponsive servers,","venue":null,"work_id":"bee82f09-5450-4837-a760-173c7eed5e41","year":2019},"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":23,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.855564Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:fd804171abd1fc4be20fb331872823d50ce31d844434f821e8be49ac6bc413d3","observation_id":"d26f4f4f-245c-4934-9671-449e55e0d6e3","resolution":{"observed_at":"2026-08-14T10:44:28.155640Z","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-14T10:44:28.140767Z","title":"The Capacity of Private Information Retrieval from Coded Databases,","venue":null,"work_id":"301eec8b-3ea1-4167-88ae-44e2641a7acc","year":1945},"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":24,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.860239Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:64a059eced63e6121b0f5c32549e2627bebfac369d73ec2c978e33c3d2b05775","observation_id":"a76108b6-907a-4fdf-ad68-ca1e9cdfacdd","resolution":{"observed_at":"2026-08-14T10:44:28.144429Z","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-14T10:44:28.129236Z","title":"Cross subspace alignment and the asymptotic capacity of x -secure t -private information retrieval,","venue":null,"work_id":"5dcffdb1-4b14-4b76-bd4c-7846bf2c6e0c","year":2019},"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":25,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.864499Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:195a7b64a01211d6cb90526366e7fc7718a0012ee023099c4a0fd937cfe48797","observation_id":"df333840-78f1-495f-9287-e45f89688a58","resolution":{"observed_at":"2026-08-14T10:44:28.133207Z","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-14T10:44:28.118556Z","title":"Private Information Retrieval from Coded Databases with Colluding Servers,","venue":null,"work_id":"6ed8f24c-abff-4df9-91f0-d4d451cdddf4","year":2017},"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":26,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.868952Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:1845a73ca975dd2e04e94a809f592e87f11fc1d8dae06d6cbae4de707bbd525f","observation_id":"8ecf36d7-739b-4c57-9582-8ed089b67d00","resolution":{"observed_at":"2026-08-14T10:44:28.122241Z","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-14T10:44:28.104636Z","title":"Private Information Retrieval from MDS Coded Data with Colluding Servers: Settling a Conjecture by Freij-Hollanti et al","venue":null,"work_id":"f2c90ff7-4dab-4ee9-bf91-d08905c91476","year":2018},"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":27,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.873099Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:766d740fde1cc3ce133d0f0d92f0f60ca7f6a03573c94561ef256a9c9c3118c1","observation_id":"28f897f9-6df8-4533-8e29-911f6c193e1c","resolution":{"observed_at":"2026-08-14T10:44:28.109424Z","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-14T10:44:27.877372Z","title":"Private secure coded computation,","venue":null,"work_id":null,"year":2019},"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":28,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.877372Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:22b8088d6591be0f7bcda1884d5b9bd553a5423c5fd3ad5935cf3ef99c08418e","observation_id":"5a96740f-e642-451c-9c8e-ed75de69ddc1","resolution":{"observed_at":"2026-08-14T10:44:27.877372Z","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-14T10:44:28.089143Z","title":"One Extra Bit of Download Ensures Perfectly Pri- vate Information Retrieval,","venue":null,"work_id":"7793c385-6637-4567-a92b-60dcccebd343","year":2014},"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":29,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.881533Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:75fc60262b0ff81fdf7f0286838639ee9e1efdd98c8fc1c04111e457505f4c89","observation_id":"cdbee49a-35d3-42b3-af84-3cc5180c2dec","resolution":{"observed_at":"2026-08-14T10:44:28.094996Z","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-14T10:44:27.885548Z","title":"Private polynomial computation from lagrange encod- ing,","venue":null,"work_id":null,"year":2019},"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":30,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:27.885548Z"},"links":{"citing_paper":"/paper/1908.10854"},"observation_digest":"sha256:8830336415133bdc1a86e08376af6334519b0892e07fa76b7930e2217e9ee5d7","observation_id":"1baedf30-7013-4fed-a3ba-9e0320397238","resolution":{"observed_at":"2026-08-14T10:44:27.885548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.10854","last_updated":"2019-08-28T17:53:52Z","latest_version":1,"primary_category":"cs.IT","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"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":30},"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 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:1908.10854."}