{"as_of":"2026-08-07T13:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af6e7e46910675ab954fb53b35ab507c82d31e5111d408241d6feed4084c4b61","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-07T06:34:17.273281+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-05-10T18:41:20.775478Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T00:10:50.601501Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.11636","last_updated":"2025-01-20T18:11:59Z","snapshot_observed_at":"2026-08-06T09:35:40.231785Z","submitted_at":"2025-01-20T18:11:59Z","title":"Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels","version":1},"cited_work":{"arxiv_id":"2501.11636","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.11636","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8712c5d1-7201-40a8-9680-a820031f7988","year":2025},"citing_paper":{"arxiv_id":"2604.05694","last_updated":"2026-04-07T10:45:24Z","snapshot_observed_at":"2026-07-06T22:54:21.571606Z","submitted_at":"2026-04-07T10:45:24Z","title":"Foundations of Future Communication Systems: Innovations in Communication - A Report","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T18:41:20.775478Z"},"links":{"cited_paper":"/paper/2501.11636","citing_paper":"/paper/2604.05694"},"observation_digest":"sha256:429ea62464e6a62414ea678dccda21a2ba3369f70dd69135d2285fd9c32d2bcd","observation_id":"86c4a60f-9434-46bc-a5a6-d7c3cb6b7ecd","resolution":{"observed_at":"2026-05-11T00:10:50.604033Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.11636/citation-record","integrity":"/paper/2501.11636/integrity","json":"/paper/2501.11636/citation-record.json","paper":"/paper/2501.11636"},"outbound":[],"paper":{"arxiv_id":"2501.11636","last_updated":"2025-01-20T18:11:59Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T09:35:40.231785Z","submitted_at":"2025-01-20T18:11:59Z","title":"Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2501.11636."}