{"as_of":"2026-08-17T00:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92b4387d3858cf53753004481f313cc4bfdc2f2f0aede6c99c18c1649f2f8bdc","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:28:32.316502Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"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.07215/citation-record","integrity":"/paper/1908.07215/integrity","json":"/paper/1908.07215/citation-record.json","paper":"/paper/1908.07215"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:28:32.169962Z","title":"Proof verification and the hardness of approximation problems","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.169962Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:49cb1a36b80fc6d8615897d2527f9ee4b27e0b78b975661cefe189c127f783c9","observation_id":"86022939-0fc7-4b99-9963-6eb0d6478375","resolution":{"observed_at":"2026-08-14T12:28:32.169962Z","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:28:32.667273Z","title":"Non-deterministic exponential time has two-prover interactive protocols","venue":null,"work_id":"396e4fbb-11fb-4364-9855-908c5b900e9c","year":1991},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.177615Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:bf67f51f4745095cfe06ed152d7dac903531fab363c32df1c885125d1f8f734f","observation_id":"3f5ed874-97cc-4e33-956f-8020d0933ac8","resolution":{"observed_at":"2026-08-14T12:28:32.734852Z","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:28:32.654855Z","title":"BPP has subexponential time simulations unless EXPTIME has publishable proofs","venue":null,"work_id":"53063322-9222-4a0a-ade4-768e8d71227d","year":1993},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.181364Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:124447ef69d828bc44aa48ad36d907e5864ecf5898d0fd33de26d8134591d450","observation_id":"7ccaf281-9b82-4fe8-b53b-664ea29886a9","resolution":{"observed_at":"2026-08-14T12:28:32.658685Z","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:28:32.644340Z","title":"Ideals, varieties, and algorithms","venue":null,"work_id":"321462f8-bf9e-45db-957c-3d25250a5ffb","year":2007},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.185350Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:3459735714e086f945d790071a236f71dc1d5eaf345eba1dd02655bdb968fe1f","observation_id":"2973b3cc-da72-4270-b99e-5097f00ee1f2","resolution":{"observed_at":"2026-08-14T12:28:32.647364Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:28:32.189009Z","title":"DeMillo and Richard J","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.189009Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:8194fd9857338dc26767205c6ad24e0500a817740c659f676a9ef578cfb677d8","observation_id":"b76ccbd4-aec1-43bc-b50b-13ede65f1d41","resolution":{"observed_at":"2026-08-14T12:28:32.189009Z","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:28:32.586816Z","title":"David Forney Jr","venue":null,"work_id":"4b3cdd08-06cb-4fb9-83bb-8e74a6b7b0c0","year":1966},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.213426Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:0ceadc7a7e5d2043f6536732486de6b6a4afca1b8f88cc2e507fb2a951191a63","observation_id":"3e129ad0-59c8-4540-be9d-6e73873220f4","resolution":{"observed_at":"2026-08-14T12:28:32.628163Z","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:28:32.483267Z","title":"Kim and Swastik Kopparty","venue":null,"work_id":"10a77900-6e4f-4bc9-b235-1da6a380e8c5","year":2017},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.261376Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:9f06afcd9551a806dc523b1c01018b435208d0ca716fa56ce6f2d2a6d5bbb118","observation_id":"ec454ffa-28cf-47f4-94ab-c95356f072f0","resolution":{"observed_at":"2026-08-14T12:28:32.518886Z","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:28:32.470595Z","title":"Karloff, and Noam Nisan","venue":null,"work_id":"5afe2827-c736-432d-b3ff-a706b8a5320c","year":1992},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.296994Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:5725ad1c2a32f6dfae67e6c658c01220ed19a007f8bed980d7f0b7beb9218b33","observation_id":"1d2b915e-7a7c-4dc2-a5f6-15af297c4274","resolution":{"observed_at":"2026-08-14T12:28:32.474918Z","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:28:32.457377Z","title":null,"venue":null,"work_id":"38b5c78f-a06b-44f4-a8d3-762c2bb2714e","year":1927},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.300574Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:dd64d88e5ac8b18fb0acc7828e292e663b8a3f150bdd049c19433b709f7b1ab1","observation_id":"8f1f820a-09ea-4e93-9ff3-e27f463170f7","resolution":{"observed_at":"2026-08-14T12:28:32.461704Z","resolver_source":"raw_fallback","status":"unresolved"},"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:28:32.416407Z","title":null,"venue":null,"work_id":"b4422d38-cb8a-47ff-8719-4e065f6adfa2","year":1954},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.303894Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:e5871e0ca930795cee193393f37d80a5b91b63819a59864a67f208d020d84d09","observation_id":"dd9f7813-8f31-4845-9eb3-53def6b3d37d","resolution":{"observed_at":"2026-08-14T12:28:32.448291Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:28:32.306920Z","title":"Schwartz","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.306920Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:66d86a332d57d872293e02126a992f1685a829cfe21e9df5a219c328545e083c","observation_id":"52768fbe-86ce-42a8-b39a-4ba85ec44c14","resolution":{"observed_at":"2026-08-14T12:28:32.306920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:28:32.309798Z","title":"IP = PSPACE","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.309798Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:967bad627e3f28efbd32e27fb43093effda723bceb686f1a205d934a44347b4c","observation_id":"3016ea79-3202-427a-9c6a-f8edb68211df","resolution":{"observed_at":"2026-08-14T12:28:32.309798Z","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:28:32.384552Z","title":null,"venue":null,"work_id":"184ff79c-e35e-4e44-9c4f-2d991b4cd311","year":2001},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.312598Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:c1608c0b654240bf13c91d3de19c8c1a347e13c3f5113bcec20b11adce8b48b1","observation_id":"7cedc16a-d0aa-4e39-ae92-e5a3949ab25c","resolution":{"observed_at":"2026-08-14T12:28:32.391085Z","resolver_source":"raw_fallback","status":"unresolved"},"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:28:32.341812Z","title":"Probabilistic algorithms for sparse polynomials","venue":null,"work_id":"3cb5c146-414a-4435-8477-15d8111ac517","year":1979},"citing_paper":{"arxiv_id":"1908.07215","last_updated":"2019-08-20T08:25:14Z","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T12:28:32.316502Z"},"links":{"citing_paper":"/paper/1908.07215"},"observation_digest":"sha256:8de3d0d5533be442dbc83985ab4be9b28333f3038b901536c584885c2c8f886b","observation_id":"7a6c9844-db61-40bc-ae0b-863858df81db","resolution":{"observed_at":"2026-08-14T12:28:32.350330Z","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.07215","last_updated":"2019-08-20T08:25:14Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T14:42:59.868086Z","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":14},"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 17 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:1908.07215."}