{"as_of":"2026-08-15T09:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d37838c6c2497c39fceeae43f9f190d937184b7233a7d1846ec802c47705115a","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-15T06:32:42.880941+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-07-30T21:51:38.771733Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2601.15505","last_updated":"2026-05-13T15:39:42Z","snapshot_observed_at":"2026-08-11T18:59:04.674021Z","submitted_at":"2026-01-21T22:24:46Z","title":"Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.15505","snapshot_observed_at":"2026-07-30T21:51:38.771733Z","title":"Stabilizer-code channel transforms beyond repetition codes for improved hashing bounds,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23450","last_updated":"2026-07-26T04:29:18Z","snapshot_observed_at":"2026-08-06T14:14:34.454735Z","submitted_at":"2026-07-26T04:29:18Z","title":"A strong converse for stabilizer codes over Pauli channels via the blowing-up lemma","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-30T21:51:38.771733Z"},"links":{"cited_paper":"/paper/2601.15505","citing_paper":"/paper/2607.23450"},"observation_digest":"sha256:950747a223a8a4ebfcba5150302fb7248c433f804cd0fd705d428fcd74ef6e8e","observation_id":"cb0f7db2-66ef-4129-bb50-73d9fddc60a3","resolution":{"observed_at":"2026-07-30T21:51:38.771733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.15505/citation-record","integrity":"/paper/2601.15505/integrity","json":"/paper/2601.15505/citation-record.json","paper":"/paper/2601.15505"},"outbound":[],"paper":{"arxiv_id":"2601.15505","last_updated":"2026-05-13T15:39:42Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-11T18:59:04.674021Z","submitted_at":"2026-01-21T22:24:46Z","title":"Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2601.15505."}