{"as_of":"2026-08-09T01:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ef8ddc5ba4a42081c8d25ea3bab026fea8bbd8b72750c59b195a3d177598459","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:08:11.562127Z","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-07-02T07:36:44.887531Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.03563","last_updated":"2024-09-05T14:19:45Z","snapshot_observed_at":"2026-07-06T19:11:01.164926Z","submitted_at":"2024-09-05T14:19:45Z","title":"100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.03563","snapshot_observed_at":"2026-08-07T14:08:11.562127Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19959","last_updated":"2025-07-30T16:46:12Z","snapshot_observed_at":"2026-08-09T01:20:29.114355Z","submitted_at":"2025-05-26T13:21:18Z","title":"MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T14:08:11.562127Z"},"links":{"cited_paper":"/paper/2409.03563","citing_paper":"/paper/2505.19959"},"observation_digest":"sha256:3ff1e799d15222085c1ca6a79c501b97443372faba37efd07c9b8657f520fa19","observation_id":"9a27f10b-e3da-4e11-8b1f-2892246834e9","resolution":{"observed_at":"2026-08-07T14:08:11.562127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03563","last_updated":"2024-09-05T14:19:45Z","snapshot_observed_at":"2026-07-06T19:11:01.164926Z","submitted_at":"2024-09-05T14:19:45Z","title":"100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.03563","snapshot_observed_at":"2026-08-07T00:42:01.431425Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13216","last_updated":"2025-06-16T08:16:03Z","snapshot_observed_at":"2026-08-07T00:34:23.901032Z","submitted_at":"2025-06-16T08:16:03Z","title":"Capability Salience Vector: Fine-grained Alignment of Loss and Capabilities for Downstream Task Scaling Law","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T00:42:01.431425Z"},"links":{"cited_paper":"/paper/2409.03563","citing_paper":"/paper/2506.13216"},"observation_digest":"sha256:442605319a06068f4cd96101cdf15b02d41c112647509ad6314fca3c45d2cde1","observation_id":"c101de66-854a-412a-97a9-21b2d6f251a1","resolution":{"observed_at":"2026-08-07T00:42:01.431425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03563","last_updated":"2024-09-05T14:19:45Z","snapshot_observed_at":"2026-07-06T19:11:01.164926Z","submitted_at":"2024-09-05T14:19:45Z","title":"100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instances","version":1},"cited_work":{"arxiv_id":"2409.03563","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03563","snapshot_observed_at":"2026-07-02T07:36:44.887531Z","title":"Zhihong Pan, Kai Zhang, Yuze Zhao, and Yupeng Han","venue":null,"work_id":"ca9d9a55-e3d6-4e3a-9ecc-713fecf937b0","year":2024},"citing_paper":{"arxiv_id":"2605.06110","last_updated":"2026-05-08T14:07:34Z","snapshot_observed_at":"2026-08-08T09:29:34.106054Z","submitted_at":"2026-05-07T12:24:21Z","title":"On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T10:39:39.482599Z"},"links":{"cited_paper":"/paper/2409.03563","citing_paper":"/paper/2605.06110"},"observation_digest":"sha256:d27aff52d97c3ad41ef6486094c1c8da5947073f777d3751450e38e920fe6743","observation_id":"942eebdc-6744-4848-a405-09fff4522e72","resolution":{"observed_at":"2026-05-11T19:56:09.094860Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03563","last_updated":"2024-09-05T14:19:45Z","snapshot_observed_at":"2026-07-06T19:11:01.164926Z","submitted_at":"2024-09-05T14:19:45Z","title":"100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instances","version":1},"cited_work":{"arxiv_id":"2409.03563","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03563","snapshot_observed_at":"2026-07-02T07:36:44.887531Z","title":"Zhihong Pan, Kai Zhang, Yuze Zhao, and Yupeng Han","venue":null,"work_id":"ca9d9a55-e3d6-4e3a-9ecc-713fecf937b0","year":2024},"citing_paper":{"arxiv_id":"2605.06110","last_updated":"2026-05-08T14:07:34Z","snapshot_observed_at":"2026-08-08T09:29:34.106054Z","submitted_at":"2026-05-07T12:24:21Z","title":"On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-11T02:14:55.216480Z"},"links":{"cited_paper":"/paper/2409.03563","citing_paper":"/paper/2605.06110"},"observation_digest":"sha256:6a483ef8470e44c31287f49c26d21872939b279ff8f54be1934d313cf21facf8","observation_id":"7cac024d-b245-48a1-bb83-eb5fae5b2879","resolution":{"observed_at":"2026-05-11T03:50:55.016079Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03563","last_updated":"2024-09-05T14:19:45Z","snapshot_observed_at":"2026-07-06T19:11:01.164926Z","submitted_at":"2024-09-05T14:19:45Z","title":"100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instances","version":1},"cited_work":{"arxiv_id":"2409.03563","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03563","snapshot_observed_at":"2026-07-02T07:36:44.887531Z","title":"Zhihong Pan, Kai Zhang, Yuze Zhao, and Yupeng Han","venue":null,"work_id":"ca9d9a55-e3d6-4e3a-9ecc-713fecf937b0","year":2024},"citing_paper":{"arxiv_id":"2605.25773","last_updated":"2026-05-29T17:41:55Z","snapshot_observed_at":"2026-08-05T10:12:01.305102Z","submitted_at":"2026-05-25T12:23:31Z","title":"Efficient Benchmarking Is Just Feature Selection and Multiple Regression","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-06-29T20:20:15.314971Z"},"links":{"cited_paper":"/paper/2409.03563","citing_paper":"/paper/2605.25773"},"observation_digest":"sha256:2827759a735387409493849e774502fc02d6465628943452273c56a822732633","observation_id":"6bcb9df7-67c6-4446-925a-c48b8ee25d64","resolution":{"observed_at":"2026-06-30T00:24:05.140715Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03563","last_updated":"2024-09-05T14:19:45Z","snapshot_observed_at":"2026-07-06T19:11:01.164926Z","submitted_at":"2024-09-05T14:19:45Z","title":"100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instances","version":1},"cited_work":{"arxiv_id":"2409.03563","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03563","snapshot_observed_at":"2026-07-02T07:36:44.887531Z","title":"Zhihong Pan, Kai Zhang, Yuze Zhao, and Yupeng Han","venue":null,"work_id":"ca9d9a55-e3d6-4e3a-9ecc-713fecf937b0","year":2024},"citing_paper":{"arxiv_id":"2606.05029","last_updated":"2026-06-03T15:57:42Z","snapshot_observed_at":"2026-08-01T16:51:47.025025Z","submitted_at":"2026-06-03T15:57:42Z","title":"Validity Threats for Foundation Model Research","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-28T06:52:41.653304Z"},"links":{"cited_paper":"/paper/2409.03563","citing_paper":"/paper/2606.05029"},"observation_digest":"sha256:2f0cb5eba6d1c5d62ab00f9e33d9f90cfca9b317a5873415f5d9b2408abd2a62","observation_id":"cffa78bc-0b7b-42e7-bb39-54bd6342fc46","resolution":{"observed_at":"2026-07-02T07:36:44.888977Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.03563/citation-record","integrity":"/paper/2409.03563/integrity","json":"/paper/2409.03563/citation-record.json","paper":"/paper/2409.03563"},"outbound":[],"paper":{"arxiv_id":"2409.03563","last_updated":"2024-09-05T14:19:45Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T19:11:01.164926Z","submitted_at":"2024-09-05T14:19:45Z","title":"100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instances"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2409.03563."}