{"as_of":"2026-08-15T00:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:27fa01dd2a1d668ee18742cec521bcc4d088f987b7de8c22b79f087b1fa99b66","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:35:10.192224Z","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:35:10.395421Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.00440","last_updated":"2018-09-30T18:27:30Z","snapshot_observed_at":"2026-08-14T18:21:27.871391Z","submitted_at":"2018-09-30T18:27:30Z","title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters","version":1},"cited_work":{"arxiv_id":"1810.00440","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.00440","snapshot_observed_at":"2026-08-11T15:35:10.395421Z","title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters","venue":"stat.ML","work_id":"040a2cc8-16e7-4f10-b31f-527f60eb411f","year":2018},"citing_paper":{"arxiv_id":"2412.10935","last_updated":"2024-12-26T21:12:31Z","snapshot_observed_at":"2026-08-13T20:01:25.534750Z","submitted_at":"2024-12-14T19:06:01Z","title":"Progressive Compression with Universally Quantized Diffusion Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T15:35:10.192224Z"},"links":{"cited_paper":"/paper/1810.00440","citing_paper":"/paper/2412.10935"},"observation_digest":"sha256:d0d96957d9e32e3b25021503fd9e575b4355561d7745ab9c36b0f926f57a800f","observation_id":"c012c4a5-9624-4901-b3f1-8df1bc3a34a8","resolution":{"observed_at":"2026-08-11T15:35:10.399707Z","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/1810.00440/citation-record","integrity":"/paper/1810.00440/integrity","json":"/paper/1810.00440/citation-record.json","paper":"/paper/1810.00440"},"outbound":[],"paper":{"arxiv_id":"1810.00440","last_updated":"2018-09-30T18:27:30Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T18:21:27.871391Z","submitted_at":"2018-09-30T18:27:30Z","title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters"},"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 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1810.00440."}