{"as_of":"2026-08-16T15:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6b52252b808b89e8313c8f4a3f4b3e552f1b578c393c90743c54e26586a5e5f","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:36:31.041318Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.07091/citation-record","integrity":"/paper/1908.07091/integrity","json":"/paper/1908.07091/citation-record.json","paper":"/paper/1908.07091"},"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:36:31.602323Z","title":"Pri vate Information Retrieval,","venue":null,"work_id":"9750e50f-2b79-4696-bb87-dc85b95bb5cc","year":1998},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.886970Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:1508538c6e0f1348b37e45cd092b68d338770f250e08ab6c27ee662961cd0334","observation_id":"4259f456-cb16-463e-a77d-e6b7cd0e9988","resolution":{"observed_at":"2026-08-14T12:36:31.607301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.585344Z","title":"The capacity of private informati on retrieval,","venue":null,"work_id":"da71191b-e6ed-4692-bf01-e473dd95e422","year":2016},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.893787Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:024b4a36dfc982656b73764f7d4a5a9d9493dd118ca101e5358aeb70b0264898","observation_id":"7ea970d8-b222-4215-b9be-959a7e0caeb0","resolution":{"observed_at":"2026-08-14T12:36:31.591311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.566856Z","title":"One extra bit o f download ensures perfectly private information retrieval,","venue":null,"work_id":"c6bb8566-385e-46dd-8989-6a8d6eceaefc","year":2014},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.899736Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:bbcfea99b63b24bbfb8f723ffe8f5dd9290bd8ec7f106ee0f640de7e93e09e2d","observation_id":"4ad86082-bd73-4860-86fe-bc00d60fbaf0","resolution":{"observed_at":"2026-08-14T12:36:31.571916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.551247Z","title":"Private information re- trieval from coded databases with colluding servers,","venue":null,"work_id":"1819276f-b423-4e8e-aa13-ffc4fda83f7d","year":2017},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.906171Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:0d4d76ea4c7402a9cbc8e1e2955bdad1042205be26d6d0a795e14a1ba5b5eb5a","observation_id":"f70b9d1a-60b5-46b0-8ec1-3de2c7d33b3a","resolution":{"observed_at":"2026-08-14T12:36:31.556236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.534163Z","title":"The capacity of private inform ation retrieval from coded databases,","venue":null,"work_id":"0febe6a6-8017-4351-9f5c-92ec5bf4ba0b","year":1945},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.913004Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:287130cbae525964834959b522f14e6af6abde4b07c8eb05968c71f4e3d6625c","observation_id":"8ceb6cd8-0699-40db-8078-d9ed16406f4e","resolution":{"observed_at":"2026-08-14T12:36:31.540043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.01458","last_updated":"2018-03-15T13:52:02Z","snapshot_observed_at":"2026-08-14T22:11:48.111789Z","submitted_at":"2016-02-03T20:53:34Z","title":"Private Information Retrieval from MDS Coded Data in Distributed Storage Systems","version":4},"cited_work":{"arxiv_id":"1602.01458","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.01458","snapshot_observed_at":"2026-08-14T12:36:31.190670Z","title":"Private Information Retrieval from MDS Coded Data in Distributed Storage Systems","venue":"cs.IT","work_id":"79d2c436-6363-4825-8ba0-b5af6bd35462","year":2016},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.918855Z"},"links":{"cited_paper":"/paper/1602.01458","citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:85686092956b8933e2a5f4691267dfa5f862e1d272c689bebc1a2c1a1a4fa456","observation_id":"4fa372ec-c7fc-4d38-b414-44272c00577a","resolution":{"observed_at":"2026-08-14T12:36:31.195917Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.514645Z","title":"On sub-packetization and access numb er of capacity-achieving PIR schemes for MDS coded non-colluding databases,","venue":null,"work_id":"b5cbc0cb-ebcd-4021-a64a-e8dd0e8335ca","year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.925953Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:27887e8c9c72ec3bd8fa0aec63ff0aaa78198a82d57f0bcf01c67de314e83e18","observation_id":"4558edf5-36d9-4740-9b0a-a0f07d2b7375","resolution":{"observed_at":"2026-08-14T12:36:31.522076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.496182Z","title":"Achievin g maximum distance separable private information retrieval capacity with linear codes,","venue":null,"work_id":"b5c12692-a365-4167-b687-8b76cecf7f6b","year":2019},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.930851Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:3ce952b414aef8e3fe94d87e2c446f8b52cfdead582d50f14dd978d7e29647de","observation_id":"ce99d9e1-48b8-4928-8733-b75015821c9e","resolution":{"observed_at":"2026-08-14T12:36:31.501955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.04104","last_updated":"2018-10-23T18:49:17Z","snapshot_observed_at":"2026-08-14T19:16:40.929293Z","submitted_at":"2018-05-10T17:59:39Z","title":"The Capacity of Private Information Retrieval from Uncoded Storage Constrained Databases","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.04104","snapshot_observed_at":"2026-08-14T12:36:30.935484Z","title":"The capacity of priv ate information retrieval from uncoded storage constrained databases,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.935484Z"},"links":{"cited_paper":"/paper/1805.04104","citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:03b71ea31388cf571d3f1138765d470ab1dda4cf08009f1879a536cfd1c04619","observation_id":"b19aad52-7f44-47f1-8eb3-8c0da32213f6","resolution":{"observed_at":"2026-08-14T12:36:30.935484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.02131","last_updated":"2019-10-16T20:16:46Z","snapshot_observed_at":"2026-08-14T16:52:12.334752Z","submitted_at":"2019-04-03T17:49:35Z","title":"Private Information Retrieval from Heterogeneous Uncoded Storage Constrained Databases with Reduced Sub-Messages","version":2},"cited_work":{"arxiv_id":"1904.02131","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.02131","snapshot_observed_at":"2026-08-14T12:36:31.143086Z","title":"Private Information Retrieval from Heterogeneous Uncoded Storage Constrained Databases with Reduced Sub-Messages","venue":"cs.IT","work_id":"68a8a712-7554-41a4-82c1-f1d7f4d8b5a5","year":2019},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.940492Z"},"links":{"cited_paper":"/paper/1904.02131","citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:8c46d2f678559e7c00719f88f391247d7b59a13457b08606a37afe2a42ad787d","observation_id":"65a59700-41c6-4de9-aec0-a15bd8026cb8","resolution":{"observed_at":"2026-08-14T12:36:31.148186Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09512","last_updated":"2019-02-25T18:50:40Z","snapshot_observed_at":"2026-08-14T17:11:31.612538Z","submitted_at":"2019-02-25T18:50:40Z","title":"The Capacity of Private Information Retrieval from Heterogeneous Uncoded Caching Databases","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09512","snapshot_observed_at":"2026-08-14T12:36:30.945751Z","title":"The cap acity of private information retrieval from heterogeneous uncoded caching databases,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.945751Z"},"links":{"cited_paper":"/paper/1902.09512","citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:31fc9e6a79b3af5ec37d7772f32f7f03afec3a93351a3cdb0baf2d028cfc0067","observation_id":"6cb262d4-e06a-4efe-be2f-7c0d992d4b96","resolution":{"observed_at":"2026-08-14T12:36:30.945751Z","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:36:31.478075Z","title":"Private information retrieval i n graph based replication systems,","venue":null,"work_id":"4d0dacee-0cf0-4520-af8d-0b3aca449f8d","year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.951977Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:a404baf603304a246359b9b8a9fe62f7b55bdcc0d006e6b99be822dbe5693b44","observation_id":"bf51f4b4-0095-41ee-97f3-a69cfeac41a2","resolution":{"observed_at":"2026-08-14T12:36:31.483484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.09018","last_updated":"2018-08-27T20:00:06Z","snapshot_observed_at":"2026-08-14T18:36:31.841832Z","submitted_at":"2018-08-27T20:00:06Z","title":"On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage","version":1},"cited_work":{"arxiv_id":"1808.09018","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.09018","snapshot_observed_at":"2026-08-14T12:36:31.099572Z","title":"On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage","venue":"cs.IT","work_id":"17215a6c-3037-4855-8d7c-a04e06e95250","year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.957984Z"},"links":{"cited_paper":"/paper/1808.09018","citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:9e9bc95b4c76a89dfe98bace5bab75a533e598b9234b25e79924655c0c5a08dc","observation_id":"2cf24d2d-6bbc-4e1d-a27d-9eed10443fea","resolution":{"observed_at":"2026-08-14T12:36:31.106809Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.461849Z","title":"Codes for distribu ted PIR with low storage overhead,","venue":null,"work_id":"7c6d99d6-9b29-42cd-b427-568c427e5b01","year":2015},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.963485Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:bd0e664477cf304634dc8a48caa73f4fd2510969e7063308969f630bbe33efea","observation_id":"fae90ed8-e797-4767-89d6-d982d7e02031","resolution":{"observed_at":"2026-08-14T12:36:31.467205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.01869","last_updated":"2017-02-28T04:32:42Z","snapshot_observed_at":"2026-08-14T21:58:34.419936Z","submitted_at":"2016-05-06T09:23:53Z","title":"Lower Bound on the Redundancy of PIR Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.01869","snapshot_observed_at":"2026-08-14T12:36:30.969043Z","title":"Lower Bound on the Redundancy of PIR Codes,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.969043Z"},"links":{"cited_paper":"/paper/1605.01869","citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:dc56152eb1f261b53eef279cf36886925af1053af41500714f3a14f817b40f6b","observation_id":"a25ca91c-36d4-46a2-a089-837a68f2bec2","resolution":{"observed_at":"2026-08-14T12:36:30.969043Z","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:36:31.442135Z","title":"Pir array codes with opti mal virtual server rate,","venue":null,"work_id":"8adea509-b814-4553-8535-8b15d69cb298","year":2019},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.975208Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:26f3bd92d74760013aa6917199604a0cfe07d0463a1d06e7b4622aa57cd19a39","observation_id":"00232553-d030-4c82-8d42-b00d1482f2e2","resolution":{"observed_at":"2026-08-14T12:36:31.448712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.422268Z","title":"On private informat ion retrieval array codes,","venue":null,"work_id":"39b67dcf-ed61-43ef-849f-358cd14788de","year":2019},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.980974Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:209c953509da04ad7e6aa706e4675c0923ee2f0dce3701c8f904dca5fed95a07","observation_id":"abeb50cb-08d4-4fd3-9c4c-8213b6202735","resolution":{"observed_at":"2026-08-14T12:36:31.427578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.406954Z","title":"Batch and pir codes and their connections t o locally repairable codes,","venue":null,"work_id":"608c6f51-0159-4fdf-96df-20d440a63d56","year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.985902Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:36012e365d72da8f75037a39fa6a17b7167c4640a1277b5c30bcd9b384627b65","observation_id":"68d961a5-e881-4877-b570-ca5cf0d345bc","resolution":{"observed_at":"2026-08-14T12:36:31.411547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.389053Z","title":"Binary, shorten ed projective reed muller codes for coded private information retrieval,","venue":null,"work_id":"2998baa7-0b7b-48ac-9d1f-078a9c4c4668","year":2017},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.990940Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:38e8c4ae76b14ae5542cbfc07bd64ab93f0a378dfb3a81ec766c24ce23f205ae","observation_id":"c32b16de-c896-400f-9fa2-0b1766e4225f","resolution":{"observed_at":"2026-08-14T12:36:31.394497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.370459Z","title":"Private informat ion retrieval for coded storage,","venue":null,"work_id":"f4e4cfde-13e3-469d-b45f-98e53b8ffaee","year":2015},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:30.995755Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:a65b7707a0765a8c2da53f7326ed4f60aacf8d57c2c84c8c073b7327e67e0a42","observation_id":"90063812-f3e4-4fff-a5b4-70dccbbf3b26","resolution":{"observed_at":"2026-08-14T12:36:31.375793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.353640Z","title":"Multiround private information retrieval: Capacity and storage overhead,","venue":null,"work_id":"9d1430d3-bdb5-4b8e-9668-e917c9d85918","year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.001557Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:e86b8766d89b68154220b68523ec510a845e447f1dc0447be4ee234cf60d8098","observation_id":"98de03d3-78b1-4b2d-a51d-382531d2ec61","resolution":{"observed_at":"2026-08-14T12:36:31.359144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.335670Z","title":"A Shannon-Theoretic appro ach to the storage-retrieval tradeoff in pir systems,","venue":null,"work_id":"4fa4d1ca-ad06-41b0-8eba-0732b566e7e7","year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.006877Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:b3c4093e7aa1957d26929f66b7cdedb630cc465dc5ab7328b9099cfb85f69947","observation_id":"b8d2b836-7c7d-4ecf-96f6-9f37df8ea6d2","resolution":{"observed_at":"2026-08-14T12:36:31.341916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.318803Z","title":"Private information retrieval from mds coded data in distributed storage systems,","venue":null,"work_id":"cc2d552e-b74e-4d77-9b15-14391a75dde7","year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.011626Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:28fc1d0fb97259e019cad41466919c8fabcb7c699221943d4fd381d3fb3d4d2a","observation_id":"f5ed3ae5-ff56-4fc9-a5d4-1b94c5cbcd95","resolution":{"observed_at":"2026-08-14T12:36:31.324576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.301355Z","title":"Private information retrieval f rom MDS coded data with colluding servers: Settling a conjecture by Freij-Hollanti et al","venue":null,"work_id":"354f4cd1-8041-4f55-b1e9-71c9bf813d45","year":2018},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.016436Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:3c83839ad9358790f147355876d31984c1a178864decaabb3403af507bbb5277","observation_id":"9a06cb4a-856e-40fd-9ea5-e92b6ab5e2fa","resolution":{"observed_at":"2026-08-14T12:36:31.306741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.281388Z","title":"Symmetric private informatio n retrieval for mds coded distributed storage,","venue":null,"work_id":"8e0f6c3f-7324-4469-9a6b-6fddec6cf9ac","year":2017},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.021075Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:25c12f672dec58f9a2d859975146c20a13d52160dfe7657514716088e238b248","observation_id":"0c2eed1a-c07d-4e31-a3e9-f5f3ee3c4632","resolution":{"observed_at":"2026-08-14T12:36:31.287301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.264070Z","title":"Capacity-achieving priva te information retrieval codes from MDS-coded databases with minimum message size,","venue":null,"work_id":"a050dd84-1367-4da4-9cec-bdf701025269","year":2019},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.026023Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:2cd840874f3737337fdb9a44a708c3de076728930bfb5701c553231f6d8787e0","observation_id":"5a82ebd6-1830-418d-8091-168bc9438d3b","resolution":{"observed_at":"2026-08-14T12:36:31.270066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.246968Z","title":"The rank of circulant matrices,","venue":null,"work_id":"5f6e571e-9e78-46e1-89c7-6c03bbc903a3","year":1956},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.031123Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:78c3dc84e2b621d8dd91321ceed1e7dee3c61458ffb0f1be6795898616b9d453","observation_id":"dafc820a-b14d-431e-9aae-594d6b8fb362","resolution":{"observed_at":"2026-08-14T12:36:31.252255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.228835Z","title":"Lidl and H","venue":null,"work_id":"ee8dfe8d-f1ed-4152-8840-c68cb9a42fee","year":1994},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.035882Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:89133b7ba351291d9d46a15a092d77678b1bc6ab0985bcedaf80dfbb6d013365","observation_id":"b16c2df8-ea84-46c0-b375-e9c2649d2907","resolution":{"observed_at":"2026-08-14T12:36:31.234688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:31.209852Z","title":"Exact results for deterministic c ellular automata with additive rules,","venue":null,"work_id":"dae69877-bc97-4ea2-ba2c-28414adf6926","year":1986},"citing_paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:31.041318Z"},"links":{"citing_paper":"/paper/1908.07091"},"observation_digest":"sha256:0c84204f0521716d86b193d0d4056263f6723b12780e913271cf6e082dd6b4bf","observation_id":"30986de6-792c-421e-8acc-80c3006902f2","resolution":{"observed_at":"2026-08-14T12:36:31.215509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.07091","last_updated":"2019-08-19T22:42:40Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T12:24:41.028099Z","submitted_at":"2019-08-19T22:42:40Z","title":"Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":3,"verified_fuzzy":23},"total_outbound_references":29},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:1908.07091."}