{"as_of":"2026-08-11T10:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e66485f0a78bd2ea392d43d26926cadb98e6fd1db6d92021cb303eb17615d222","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:50:33.071922Z","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-11T16:31:10.001142Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.01731","last_updated":"2025-05-21T01:38:25Z","snapshot_observed_at":"2026-08-07T15:56:50.574852Z","submitted_at":"2025-05-03T07:57:02Z","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.01731","snapshot_observed_at":"2026-08-07T22:50:33.071922Z","title":"Efficient shapley value-based non-uniform pruning of large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.09053","last_updated":"2025-08-05T02:23:31Z","snapshot_observed_at":"2026-08-08T10:12:47.586452Z","submitted_at":"2025-02-13T08:08:27Z","title":"Game Theory Meets Large Language Models: A Systematic Survey with Taxonomy and New Frontiers","version":2},"reference_index":107,"source":"pdf_text","source_observed_at":"2026-08-07T22:50:33.071922Z"},"links":{"cited_paper":"/paper/2505.01731","citing_paper":"/paper/2502.09053"},"observation_digest":"sha256:ddd594ae7f68f78f7360f83179bf4f4520b944097577c400d4f09f4eda58fe56","observation_id":"e896f8e5-c03e-47ee-a4bd-204e67f5c09e","resolution":{"observed_at":"2026-08-07T22:50:33.071922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.01731","last_updated":"2025-05-21T01:38:25Z","snapshot_observed_at":"2026-08-07T15:56:50.574852Z","submitted_at":"2025-05-03T07:57:02Z","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.01731","snapshot_observed_at":"2026-08-07T14:02:52.368537Z","title":"Efficient shapley value-based non-uniform pruning of large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","snapshot_observed_at":"2026-08-11T00:09:29.999243Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:02:52.368537Z"},"links":{"cited_paper":"/paper/2505.01731","citing_paper":"/paper/2505.20417"},"observation_digest":"sha256:47b2d113db818c573092b4464ff097f124e447e1c14538093eb0612785dce781","observation_id":"a12e3bc6-8b46-4e75-af21-20a83437b598","resolution":{"observed_at":"2026-08-07T14:02:52.368537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.01731","last_updated":"2025-05-21T01:38:25Z","snapshot_observed_at":"2026-08-07T15:56:50.574852Z","submitted_at":"2025-05-03T07:57:02Z","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models","version":3},"cited_work":{"arxiv_id":"2505.01731","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.01731","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient Shapley value-based non-uniform pruning of large language models.arXiv preprint arXiv:2505.01731","venue":null,"work_id":"33f95901-de16-4a47-a6d1-3613b269ec6c","year":null},"citing_paper":{"arxiv_id":"2605.02404","last_updated":"2026-08-09T12:23:21Z","snapshot_observed_at":"2026-08-11T09:15:04.722777Z","submitted_at":"2026-05-04T09:46:47Z","title":"Statistically-Lossless Quantization of Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-09T16:22:13.399819Z"},"links":{"cited_paper":"/paper/2505.01731","citing_paper":"/paper/2605.02404"},"observation_digest":"sha256:71000376e80bde550dacc8dcc15bc7a23e60067288ebbe2595bbd648af3b1bad","observation_id":"0e11e93f-927b-41bd-81a9-7e687361a69e","resolution":{"observed_at":"2026-05-11T16:31:10.008373Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.01731","last_updated":"2025-05-21T01:38:25Z","snapshot_observed_at":"2026-08-07T15:56:50.574852Z","submitted_at":"2025-05-03T07:57:02Z","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.01731","snapshot_observed_at":"2026-08-05T10:26:24.621117Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03887","last_updated":"2026-08-04T16:22:30Z","snapshot_observed_at":"2026-08-10T03:18:34.990581Z","submitted_at":"2026-08-04T16:22:30Z","title":"Omega-S: A Functional Resilience Index for LLM Fine-Tuning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T10:26:24.621117Z"},"links":{"cited_paper":"/paper/2505.01731","citing_paper":"/paper/2608.03887"},"observation_digest":"sha256:4812ef50129e62926bbcca2d34fdc5bd492271f915fa26392a8263f36ba35449","observation_id":"4f4e7d1b-230f-41ad-93d6-02a12a112190","resolution":{"observed_at":"2026-08-05T10:26:24.621117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.01731/citation-record","integrity":"/paper/2505.01731/integrity","json":"/paper/2505.01731/citation-record.json","paper":"/paper/2505.01731"},"outbound":[],"paper":{"arxiv_id":"2505.01731","last_updated":"2025-05-21T01:38:25Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T15:56:50.574852Z","submitted_at":"2025-05-03T07:57:02Z","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2505.01731."}