{"as_of":"2026-08-09T11:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48fa9115396a3153566189c567220cf9c7a1d930e97e2bce0910a5192393de8c","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:44:23.206606Z","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-19T17:57:42.484566Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.03013","last_updated":"2022-11-06T02:59:27Z","snapshot_observed_at":"2026-07-06T14:14:54.215334Z","submitted_at":"2022-11-06T02:59:27Z","title":"Robust Lottery Tickets for Pre-trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.03013","snapshot_observed_at":"2026-08-07T14:44:23.206606Z","title":"Robust Lottery Tickets for Pre-trained Language Models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.17909","last_updated":"2025-05-23T13:53:21Z","snapshot_observed_at":"2026-08-07T18:19:48.354728Z","submitted_at":"2025-05-23T13:53:21Z","title":"NeuroTrails: Training with Dynamic Sparse Heads as the Key to Effective Ensembling","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-07T14:44:23.206606Z"},"links":{"cited_paper":"/paper/2211.03013","citing_paper":"/paper/2505.17909"},"observation_digest":"sha256:64e3cb9de4c4727d0d0bc943369797e5da2a2bf67e1ccd4a5d4ce33e3631a449","observation_id":"fcc68dc2-e072-4c77-b691-d4632248eb78","resolution":{"observed_at":"2026-08-07T14:44:23.206606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.03013","last_updated":"2022-11-06T02:59:27Z","snapshot_observed_at":"2026-07-06T14:14:54.215334Z","submitted_at":"2022-11-06T02:59:27Z","title":"Robust Lottery Tickets for Pre-trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.03013","snapshot_observed_at":"2026-08-05T12:01:38.099132Z","title":"Robust lottery tickets for pre-trained language models,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.02033","last_updated":"2025-09-02T07:21:36Z","snapshot_observed_at":"2026-08-07T22:46:43.934821Z","submitted_at":"2025-09-02T07:21:36Z","title":"StructCoh: Structured Contrastive Learning for Context-Aware Text Semantic Matching","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T12:01:38.099132Z"},"links":{"cited_paper":"/paper/2211.03013","citing_paper":"/paper/2509.02033"},"observation_digest":"sha256:e995521fe0f7e49315b5aeb28fa5471e928c6514092da966ccba939f5e668e78","observation_id":"93f50828-dbed-43a5-b1f5-b19abf74ec44","resolution":{"observed_at":"2026-08-05T12:01:38.099132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.03013","last_updated":"2022-11-06T02:59:27Z","snapshot_observed_at":"2026-07-06T14:14:54.215334Z","submitted_at":"2022-11-06T02:59:27Z","title":"Robust Lottery Tickets for Pre-trained Language Models","version":1},"cited_work":{"arxiv_id":"2211.03013","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.03013","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ro- bust lottery tickets for pre-trained language models","venue":null,"work_id":"aadcbae4-1882-40cd-99f8-f31bde8c8a8d","year":2022},"citing_paper":{"arxiv_id":"2604.17051","last_updated":"2026-04-18T16:13:49Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T16:13:49Z","title":"Efficient Task Adaptation in Large Language Models via Selective Parameter Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T06:21:59.735341Z"},"links":{"cited_paper":"/paper/2211.03013","citing_paper":"/paper/2604.17051"},"observation_digest":"sha256:b5c3829a9ba51f9f89fd34a99795e835485b5228c59156f5a9b5c9764c86db44","observation_id":"013507e0-c7e5-49bb-abd6-809561df1065","resolution":{"observed_at":"2026-05-10T06:26:27.723307Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.03013","last_updated":"2022-11-06T02:59:27Z","snapshot_observed_at":"2026-07-06T14:14:54.215334Z","submitted_at":"2022-11-06T02:59:27Z","title":"Robust Lottery Tickets for Pre-trained Language Models","version":1},"cited_work":{"arxiv_id":"2211.03013","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.03013","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ro- bust lottery tickets for pre-trained language models","venue":null,"work_id":"aadcbae4-1882-40cd-99f8-f31bde8c8a8d","year":2022},"citing_paper":{"arxiv_id":"2605.15208","last_updated":"2026-05-02T05:41:47Z","snapshot_observed_at":"2026-08-08T23:09:32.922093Z","submitted_at":"2026-05-02T05:41:47Z","title":"Quantization Undoes Alignment: Bias Emergence in Compressed LLMs Across Models and Precision Levels","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T17:55:35.764347Z"},"links":{"cited_paper":"/paper/2211.03013","citing_paper":"/paper/2605.15208"},"observation_digest":"sha256:327e2d8c00114973f40e7ed9bf81d45ecd5ce54081f52ac88993ce3cf65e1a68","observation_id":"4a18eb4c-ea0b-49a1-bfe0-376588f60048","resolution":{"observed_at":"2026-05-19T17:57:42.487055Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.03013","last_updated":"2022-11-06T02:59:27Z","snapshot_observed_at":"2026-07-06T14:14:54.215334Z","submitted_at":"2022-11-06T02:59:27Z","title":"Robust Lottery Tickets for Pre-trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.03013","snapshot_observed_at":"2026-07-12T19:07:54.710156Z","title":"Robust lottery tickets for pre-trained language models.arXiv preprint arXiv:2211.03013, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.05181","last_updated":"2026-06-22T08:05:27Z","snapshot_observed_at":"2026-08-06T03:59:57.303623Z","submitted_at":"2026-04-18T16:19:32Z","title":"Multi-Granularity Reasoning for Natural Language Inference","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-12T19:07:54.710156Z"},"links":{"cited_paper":"/paper/2211.03013","citing_paper":"/paper/2606.05181"},"observation_digest":"sha256:86610b081868572ea2f48f76109e8a0f4829dfc6e751d6124cdf2eeb8c503097","observation_id":"338ad014-d7d3-479d-9c46-f24a5ea390d5","resolution":{"observed_at":"2026-07-12T19:07:54.710156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.03013/citation-record","integrity":"/paper/2211.03013/integrity","json":"/paper/2211.03013/citation-record.json","paper":"/paper/2211.03013"},"outbound":[],"paper":{"arxiv_id":"2211.03013","last_updated":"2022-11-06T02:59:27Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T14:14:54.215334Z","submitted_at":"2022-11-06T02:59:27Z","title":"Robust Lottery Tickets for Pre-trained Language Models"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2211.03013."}