{"as_of":"2026-08-10T06:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5baa6521b98aedca4a57d138d890001719c5906ea62a554ba4ec3a080ff25da4","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:10:56.596455Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T02:23:56.351327Z","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-23T07:32:43.161998Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"cited_work":{"arxiv_id":"2507.01204","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.01204","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"LotteryCodec: Searching the implicit representation in a random network for low-complexity image compression","venue":null,"work_id":"588735a2-98af-418e-b87c-4c7afbece1d6","year":2025},"citing_paper":{"arxiv_id":"2412.10433","last_updated":"2025-10-21T00:46:08Z","snapshot_observed_at":"2026-08-08T19:58:13.916871Z","submitted_at":"2024-12-11T03:22:00Z","title":"Implicit Neural Compression of Point Clouds","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-23T07:29:08.989850Z"},"links":{"cited_paper":"/paper/2507.01204","citing_paper":"/paper/2412.10433"},"observation_digest":"sha256:3d50a68b5b9ebf0efc6b2d3d1a9b72948c220d9beb222b639c1fff2f0feb83e6","observation_id":"f85116f2-f381-4655-b534-cf106a162bdf","resolution":{"observed_at":"2026-05-23T07:32:43.165763Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"cited_work":{"arxiv_id":"2507.01204","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.01204","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"LotteryCodec: Searching the implicit representation in a random network for low-complexity image compression","venue":null,"work_id":"588735a2-98af-418e-b87c-4c7afbece1d6","year":2025},"citing_paper":{"arxiv_id":"2605.02726","last_updated":"2026-07-31T14:11:16Z","snapshot_observed_at":"2026-08-05T23:14:24.678213Z","submitted_at":"2026-05-04T15:26:16Z","title":"Cool-chic 5.0: Faster Encoding and Inter-Feature Entropy Modeling for Overfitted Image Compression","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T02:19:11.818526Z"},"links":{"cited_paper":"/paper/2507.01204","citing_paper":"/paper/2605.02726"},"observation_digest":"sha256:6267052f69797467f9581c59ca0c6bcf8a19e76a55fa656b657ebc9f6c343d58","observation_id":"b3ed3706-b938-4127-bb71-02edc6f8b44c","resolution":{"observed_at":"2026-05-11T22:51:23.039967Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.01204","snapshot_observed_at":"2026-08-03T02:23:56.351327Z","title":"Lotterycodec: Searching the implicit representation in a random network for low-complexity image compression,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.02726","last_updated":"2026-07-31T14:11:16Z","snapshot_observed_at":"2026-08-05T23:14:24.678213Z","submitted_at":"2026-05-04T15:26:16Z","title":"Cool-chic 5.0: Faster Encoding and Inter-Feature Entropy Modeling for Overfitted Image Compression","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:56.351327Z"},"links":{"cited_paper":"/paper/2507.01204","citing_paper":"/paper/2605.02726"},"observation_digest":"sha256:bed7bf88f8e8e7323134cfd47e85fdda1c67e00df109abbf04cddeea30b65623","observation_id":"ff6b629e-d9da-4c31-b90d-7a5f69f815f8","resolution":{"observed_at":"2026-08-03T02:23:56.351327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.01204/citation-record","integrity":"/paper/2507.01204/integrity","json":"/paper/2507.01204/citation-record.json","paper":"/paper/2507.01204"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:10:57.130564Z","title":"Latent modulation Quantization","venue":null,"work_id":"6acca7c5-7667-4fdf-8685-d44f37cf5d31","year":2024},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.533540Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:cc0b3b8c5b60053728402375e7c8ced0a42c68eea24367a0a8d0865041c6c5c7","observation_id":"bfe708ed-6961-4ddc-8290-85799775bf77","resolution":{"observed_at":"2026-08-06T21:10:57.136148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:56.979734Z","title":"This approach, however, provides the potential of reducing inference complexity and exploring alternative modulation strategies in future research","venue":null,"work_id":"96bab854-10da-4377-8d82-521af98631fb","year":2020},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.579751Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:f9c379b859d7c48a801ecdd880c68418774419e5b61e4a670956e4bc08a820b3","observation_id":"017e4210-59ef-4a96-9530-8c0efda4e66e","resolution":{"observed_at":"2026-08-06T21:10:56.986638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:56.944818Z","title":"Orange indicates GPU computation; blue indicates CPU computation","venue":null,"work_id":"cef92d48-44fd-44c4-b189-3b5bd9019829","year":null},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.591530Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:fd44351e8202316a81589550e5dc30a7ef9cebe5cbe7b18b53ad9cac5dd390c6","observation_id":"dae021b2-c9df-43df-9847-1bc9824fab36","resolution":{"observed_at":"2026-08-06T21:10:56.950968Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:56.962966Z","title":null,"venue":null,"work_id":"08deaff4-d762-411e-bd8c-13f4a16ddf10","year":2024},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.585711Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:531bdaeaa8b15c78cbd4fc3db1b86dff6dfe4db3f14b16f42878f9992808ec84","observation_id":"66651d48-e015-465a-afbb-20fd916d7777","resolution":{"observed_at":"2026-08-06T21:10:56.968103Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:56.477864Z","title":"Bross, B., Chen, J., Ohm, J.-R., Sullivan, G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.477864Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:89cbd19d893ca80a99f4d1ace8ac498a38dd988a999121c15ca55aa5d6b620e7","observation_id":"f8810900-b393-488c-9447-12dd9f35d9fe","resolution":{"observed_at":"2026-08-06T21:10:56.477864Z","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-06T21:10:57.186978Z","title":"Cool-chic: Perceptually tuned low complexity overfitted image coder","venue":null,"work_id":"63bca3b8-6e50-4f65-a0cd-ddb831912dd7","year":2024},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.511034Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:ccb8be738f4629585259a885ce3e22cd08ecbdaa0ed9c473e91941ed74ae3d27","observation_id":"8c43ed98-dcb7-4abe-bd45-3723ebd0e71f","resolution":{"observed_at":"2026-08-06T21:10:57.192928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.166554Z","title":"Low-complexity overfitted neural image codec","venue":null,"work_id":"c1bf9b5f-2cab-4673-a6d8-384644e25cfd","year":2023},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.516318Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:30b56327f0b2794d1efeb9aa72aa98694e86d690c24bd01b3e236373449ca515","observation_id":"181b42f2-f2f6-4da8-8206-e1d44581e364","resolution":{"observed_at":"2026-08-06T21:10:57.172250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05357","last_updated":"2025-04-07T09:30:38Z","snapshot_observed_at":"2026-08-07T16:08:03.278678Z","submitted_at":"2025-04-07T09:30:38Z","title":"Find A Winning Sign: Sign Is All We Need to Win the Lottery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05357","snapshot_observed_at":"2026-08-06T21:10:56.522858Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.522858Z"},"links":{"cited_paper":"/paper/2504.05357","citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:d9b0a9c63db9e499d6a0bab92ea17bab6e7a365a32b4b703a80fd08a719184a0","observation_id":"8ceee587-bfb3-486c-9fe6-66e58d0de6f9","resolution":{"observed_at":"2026-08-06T21:10:56.522858Z","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-06T21:10:56.999270Z","title":null,"venue":null,"work_id":"26257441-22c7-4b02-9a20-809d6c4efe49","year":2018},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.573665Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:4cdde81b10529b226dc9ebf45c19c4087cace9529fe14b192dca121eec8359f4","observation_id":"f5fdea57-d3b9-4e5a-8495-9e1fcfa1e66f","resolution":{"observed_at":"2026-08-06T21:10:57.004813Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.111194Z","title":"The resulting rate contributed by ˆ zis then given by: R(ˆ z) = − log2 pψ(ˆ z) = − X i,j log2 pψ(ˆzi,j|ci,j)","venue":null,"work_id":"9a462041-11a9-4277-833c-df3ea8bf08e4","year":2012},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.539925Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:8a443ce6d16ab421fb4346fde2435211019f5ae82933a3f9acac11efa96d888e","observation_id":"cbc6fac0-86cf-4b0e-8ad1-ff06f8200892","resolution":{"observed_at":"2026-08-06T21:10:57.117097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.093761Z","title":"We measure PSNR on RGB channels and quantify RD performance using the BD-rate metric (Gisle, 2001)","venue":null,"work_id":"a02cb4ec-cf39-4e19-b6ec-bcc65040c4fc","year":2001},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.544658Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:529dd991caffb65616afb9c8f4d13c415764925fcd9613502cfb524edac25f64","observation_id":"3b00a79f-2e78-4f58-932b-355ee03942d2","resolution":{"observed_at":"2026-08-06T21:10:57.099459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.076037Z","title":"For a fair and more aligned comparison, we update VTM baseline into VTM-19.1 from CompressAI (B´egaint et al.,","venue":null,"work_id":"1c02159e-b9d9-43c4-98d7-0db55b881fa3","year":2024},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.549417Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:32c715f75834711f17190150b409814b0ed0074c0c113f44b6cc4268febfaa92","observation_id":"337b29b0-2196-4e59-b37c-a96a43cdba7b","resolution":{"observed_at":"2026-08-06T21:10:57.081365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.057811Z","title":"We also open-resourced all above baselines and datapoints in our project page for future alignment","venue":null,"work_id":"23e8c452-9478-4677-9134-c8de0a758717","year":2018},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.555398Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:9dc0adbbfd0c9f6b271ed62a66c7af31ddc6e341d48421802893fd88e71c5bd4","observation_id":"ea901fac-5321-45a6-b9f5-10f4b90cdc41","resolution":{"observed_at":"2026-08-06T21:10:57.063816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.039345Z","title":null,"venue":null,"work_id":"08556056-c5b8-4dc4-97b1-e8f10febec93","year":2020},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.560504Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:9fb5e7146214de59f4b12dba7c47bfb0607c94f67d31c4d7d9f43b5d76a651b8","observation_id":"0c17773c-1b5d-4a52-a5bb-e12f490c20c3","resolution":{"observed_at":"2026-08-06T21:10:57.044982Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:56.924109Z","title":"davide-ragusa-716 in CLIC2020 with optimal result PSNR 37.18 at bpp 0.196","venue":null,"work_id":"4562a483-e110-4acf-91ef-fb2676f4ebbc","year":1945},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.596455Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:af4df9a0b9f0c87999dcfb77ac8e02ee6350522b41f238771d50e972057c5cd7","observation_id":"ae5b3fe8-f147-43fe-935d-8834b8a30a48","resolution":{"observed_at":"2026-08-06T21:10:56.931723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.244668Z","title":"Proving the strong lottery ticket hypothesis for convolutional neural networks","venue":null,"work_id":"c5430831-d789-44fa-8c1a-95a7f1f0d3f2","year":2022},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.483517Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:fe8634fe648c70573c2f4f6127c37e4b8fbb753d301b8b4d6f79a31519cf13b9","observation_id":"40e46d2d-be12-4a47-8909-8339fdbf90a1","resolution":{"observed_at":"2026-08-06T21:10:57.249681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.206111Z","title":null,"venue":null,"work_id":"85687a8c-98cb-45fe-85a4-c98e8cfb124b","year":2023},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.500364Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:b736bd0346ac9b1469a9eaa4ba6813ffc3b2e303dc00b9d6854d5e1fbd78ddeb","observation_id":"1498ccf7-40ad-4208-8231-83d6552c6699","resolution":{"observed_at":"2026-08-06T21:10:57.212649Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.263306Z","title":"Overfitted image coding at reduced complexity","venue":null,"work_id":"e82e147a-a5be-4b5d-a7b6-2e9083ee24cf","year":2024},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.472347Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:94e145935966e6749f5806dff6f65d6befd277cb96d7a504d981786af3b3ac54","observation_id":"c9f9cf85-8d44-429d-91ca-6ef7987c6d07","resolution":{"observed_at":"2026-08-06T21:10:57.268886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.018740Z","title":null,"venue":null,"work_id":"9471192e-c4a9-45cd-bbd1-ff361ec02734","year":2020},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.567669Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:2a3d644fcf8af011030ac77200b9da3bcecb11d321ec5c6680ff1beb431ae1c7","observation_id":"4636afc6-b427-407d-80f1-7bf523438b2a","resolution":{"observed_at":"2026-08-06T21:10:57.023982Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00505","last_updated":"2025-03-24T01:55:22Z","snapshot_observed_at":"2026-08-09T19:36:42.619544Z","submitted_at":"2024-11-30T15:05:01Z","title":"Good, Cheap, and Fast: Overfitted Image Compression with Wasserstein Distortion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00505","snapshot_observed_at":"2026-08-06T21:10:56.459996Z","title":"Good, cheap, and fast: Overfitted image com- pression with wasserstein distortion","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.459996Z"},"links":{"cited_paper":"/paper/2412.00505","citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:5319add239760f993697bf470f78e588d212246f0cbf9bf940e1a610db4c46a7","observation_id":"59c42254-f8ac-4f8e-b02c-9e499ae699d9","resolution":{"observed_at":"2026-08-06T21:10:56.459996Z","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-06T21:10:57.147887Z","title":null,"venue":null,"work_id":"4136b60d-8105-4a4b-b48c-85a96b7015e5","year":2024},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.528310Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:04c59c58233e1f6b4ed7f7b0f9e56f48247255d051a3a6d6e022f0ed12bc9a98","observation_id":"bffb3d8c-0405-487b-916d-593db92efd22","resolution":{"observed_at":"2026-08-06T21:10:57.153580Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:57.280734Z","title":"J., and Johnston, N","venue":null,"work_id":"69cb1be1-662c-4aac-ab8d-7d27ccaf06fd","year":2018},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.453717Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:0cc615fe46f2d2afcb80e9df5753a82571f74b2f4b2cb2f7dd7988a3ae1f8871","observation_id":"3155f86f-4641-4bc5-82a2-e08783ff2dde","resolution":{"observed_at":"2026-08-06T21:10:57.286637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:10:56.495529Z","title":"Coin++: neural compression across modalities","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.495529Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:0171615f20da4289a506a690aafbd9866b4887e4c48cc4c39e01976c6ab5977b","observation_id":"6866e634-c812-4f25-8adb-ce2293948c82","resolution":{"observed_at":"2026-08-06T21:10:56.495529Z","resolver_source":null,"status":"malformed_identifier"},"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-06T21:10:57.226461Z","title":"W., and Doucet, A","venue":null,"work_id":"9c53d353-5bb1-425d-87bf-2d0735c2fbed","year":2021},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.489657Z"},"links":{"citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:06887c006ce361d7274bad320b8f429bf952715a0b599d6826f051ea694f9052","observation_id":"4c71920f-48d6-42d5-9451-d412b074db1a","resolution":{"observed_at":"2026-08-06T21:10:57.232705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00149","last_updated":"2016-02-15T06:25:40Z","snapshot_observed_at":"2026-08-04T16:59:47.843960Z","submitted_at":"2015-10-01T09:03:44Z","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00149","snapshot_observed_at":"2026-08-06T21:10:56.505491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.505491Z"},"links":{"cited_paper":"/paper/1510.00149","citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:44ac5fc4c5d48046133549da40e25fcda8026eab856a85dae315cd6d77ea284d","observation_id":"8d6a9e31-d20d-489a-84ef-640ac0869422","resolution":{"observed_at":"2026-08-06T21:10:56.505491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.03029","last_updated":"2020-11-05T18:40:50Z","snapshot_observed_at":"2026-08-10T03:37:02.318287Z","submitted_at":"2020-11-05T18:40:50Z","title":"CompressAI: a PyTorch library and evaluation platform for end-to-end compression research","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.03029","snapshot_observed_at":"2026-08-06T21:10:56.466122Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:56.466122Z"},"links":{"cited_paper":"/paper/2011.03029","citing_paper":"/paper/2507.01204"},"observation_digest":"sha256:340b2a7ca0369b171c15fc34d1af6980fd52e6f4ac1e7362358bff55009befd8","observation_id":"1a0547b5-0193-4f75-9222-fc499441d59e","resolution":{"observed_at":"2026-08-06T21:10:56.466122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.01204","last_updated":"2025-09-03T23:28:27Z","latest_version":2,"primary_category":"eess.IV","snapshot_observed_at":"2026-08-09T19:37:28.897056Z","submitted_at":"2025-07-01T21:48:16Z","title":"LotteryCodec: Searching the Implicit Representation in a Random Network for Low-Complexity Image Compression"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":26},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 3 inbound Pith citation observations for arXiv:2507.01204."}