{"as_of":"2026-08-08T03:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05cf61de32d040654c0a5577c1577ea8965e38eb91a535e9fc75a512ea389f06","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-07T06:34:17.273281+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:33:12.143489Z","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-03T08:17:45.521021Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.00631","last_updated":"2025-08-29T17:58:46Z","snapshot_observed_at":"2026-08-02T11:20:30.801285Z","submitted_at":"2024-12-01T01:01:09Z","title":"ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00631","snapshot_observed_at":"2026-08-07T14:33:12.143489Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18527","last_updated":"2025-05-24T05:45:32Z","snapshot_observed_at":"2026-08-07T14:27:52.256771Z","submitted_at":"2025-05-24T05:45:32Z","title":"CLaDMoP: Learning Transferrable Models from Successful Clinical Trials via LLMs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:12.143489Z"},"links":{"cited_paper":"/paper/2412.00631","citing_paper":"/paper/2505.18527"},"observation_digest":"sha256:9c8434b5341070984bd2cbe996cb263a3e161d6a20232b5e3f64fc4e20f061a6","observation_id":"1f9337d4-fd4b-4e68-b4c6-cd529654f52e","resolution":{"observed_at":"2026-08-07T14:33:12.143489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00631","last_updated":"2025-08-29T17:58:46Z","snapshot_observed_at":"2026-08-02T11:20:30.801285Z","submitted_at":"2024-12-01T01:01:09Z","title":"ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00631","snapshot_observed_at":"2026-08-06T17:06:43.002860Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11807","last_updated":"2025-07-16T00:03:07Z","snapshot_observed_at":"2026-08-07T09:44:08.446925Z","submitted_at":"2025-07-16T00:03:07Z","title":"CLID-MU: Cross-Layer Information Divergence Based Meta Update Strategy for Learning with Noisy Labels","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:43.002860Z"},"links":{"cited_paper":"/paper/2412.00631","citing_paper":"/paper/2507.11807"},"observation_digest":"sha256:f8666648088d2911fe97fde3655e483cb12ef8559682b5a73bab17078ca028f8","observation_id":"dc175a45-8b26-4d59-9487-06141d02fccc","resolution":{"observed_at":"2026-08-06T17:06:43.002860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00631","last_updated":"2025-08-29T17:58:46Z","snapshot_observed_at":"2026-08-02T11:20:30.801285Z","submitted_at":"2024-12-01T01:01:09Z","title":"ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00631","snapshot_observed_at":"2026-08-05T17:02:40.533225Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.17202","last_updated":"2025-08-29T17:46:43Z","snapshot_observed_at":"2026-08-05T17:02:22.140745Z","submitted_at":"2025-08-24T03:34:40Z","title":"Active Domain Knowledge Acquisition with 100-Dollar Budget: Enhancing LLMs via Cost-Efficient, Expert-Involved Interaction in Sensitive Domains","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T17:02:40.533225Z"},"links":{"cited_paper":"/paper/2412.00631","citing_paper":"/paper/2508.17202"},"observation_digest":"sha256:dbe18e9341a1bb96b960b4dea193fb3a2fe9155de860bd6c9c4defbc6ebdb1d2","observation_id":"0c19ba50-eb8a-468b-9171-5c953645518b","resolution":{"observed_at":"2026-08-05T17:02:40.533225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00631","last_updated":"2025-08-29T17:58:46Z","snapshot_observed_at":"2026-08-02T11:20:30.801285Z","submitted_at":"2024-12-01T01:01:09Z","title":"ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning","version":2},"cited_work":{"arxiv_id":"2412.00631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00631","snapshot_observed_at":"2026-07-03T08:17:45.521021Z","title":"Rose: A reward-oriented data selection framework for llm task-specific instruction tuning","venue":null,"work_id":"53aca014-fe23-4902-b583-13e3829df3d8","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2412.00631","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:404a106271be5f9db9e161c1dba71449dd29711135070c35baa41751c8d65e05","observation_id":"50e43d54-8a0d-4742-8df3-5a3e9045f193","resolution":{"observed_at":"2026-05-12T02:51:17.982139Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00631","last_updated":"2025-08-29T17:58:46Z","snapshot_observed_at":"2026-08-02T11:20:30.801285Z","submitted_at":"2024-12-01T01:01:09Z","title":"ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning","version":2},"cited_work":{"arxiv_id":"2412.00631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00631","snapshot_observed_at":"2026-07-03T08:17:45.521021Z","title":"Rose: A reward-oriented data selection framework for llm task-specific instruction tuning","venue":null,"work_id":"53aca014-fe23-4902-b583-13e3829df3d8","year":2025},"citing_paper":{"arxiv_id":"2606.18286","last_updated":"2026-06-10T04:46:04Z","snapshot_observed_at":"2026-08-07T16:29:18.257991Z","submitted_at":"2026-06-10T04:46:04Z","title":"CODEBLOCK: Learning to Supervise Code at the Right Granularity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T10:52:00.147391Z"},"links":{"cited_paper":"/paper/2412.00631","citing_paper":"/paper/2606.18286"},"observation_digest":"sha256:dc2a06ab518689d05c3d2beb875a6db4ea0135b6629e780fae828701f7a5dfc8","observation_id":"53ce32c5-741f-41a9-9b13-05c91144cb63","resolution":{"observed_at":"2026-07-03T08:17:45.522648Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.00631/citation-record","integrity":"/paper/2412.00631/integrity","json":"/paper/2412.00631/citation-record.json","paper":"/paper/2412.00631"},"outbound":[],"paper":{"arxiv_id":"2412.00631","last_updated":"2025-08-29T17:58:46Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T11:20:30.801285Z","submitted_at":"2024-12-01T01:01:09Z","title":"ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2412.00631."}