{"as_of":"2026-08-14T23:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9fbcf30d618ef7c8e422ce03ec118e1d6c3a446edeb15827bdbc224ad59cd95","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:29:08.590000Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T15:29:08.755929Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.07793","last_updated":"2023-08-15T14:17:35Z","snapshot_observed_at":"2026-08-13T10:34:15.692703Z","submitted_at":"2023-08-15T14:17:35Z","title":"Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions","version":1},"cited_work":{"arxiv_id":"2308.07793","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.07793","snapshot_observed_at":"2026-08-11T15:29:08.755929Z","title":"Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions","venue":"cs.IT","work_id":"bcfbb2ac-4baf-4a04-abe9-f020fafdcc57","year":2023},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.590000Z"},"links":{"cited_paper":"/paper/2308.07793","citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:cb689567a136290a62450b4088525fbd0876bf6957dbae13d2e3b7bc1ae97833","observation_id":"9b8b1739-065c-409f-b47e-dd9d4308c7fc","resolution":{"observed_at":"2026-08-11T15:29:08.764461Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2308.07793/citation-record","integrity":"/paper/2308.07793/integrity","json":"/paper/2308.07793/citation-record.json","paper":"/paper/2308.07793"},"outbound":[],"paper":{"arxiv_id":"2308.07793","last_updated":"2023-08-15T14:17:35Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T10:34:15.692703Z","submitted_at":"2023-08-15T14:17:35Z","title":"Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2308.07793."}