{"as_of":"2026-08-06T11:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:03bd60b2132f4933e0dbd8316ca3c5a8b1ba87641cedadbb6215d2410192014c","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-06T06:34:29.942622+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-05T00:40:08.337752Z","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-02T22:27:26.359636Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","snapshot_observed_at":"2026-07-06T21:30:57.177648Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20417","snapshot_observed_at":"2026-08-03T22:48:12.321881Z","title":"Javier Castro, Daniel G´omez, and Juan Tejada","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2511.10687","last_updated":"2026-07-01T23:47:17Z","snapshot_observed_at":"2026-08-04T13:43:41.714396Z","submitted_at":"2025-11-11T22:21:08Z","title":"Who Gets the Reward & Who Gets the Blame? Evaluation-Aligned Training Signals for Multi-LLM Agents","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T22:48:12.321881Z"},"links":{"cited_paper":"/paper/2505.20417","citing_paper":"/paper/2511.10687"},"observation_digest":"sha256:96f548ab979da1d5d33e832a2ce94aba91ca35e07efaf2a80ced521a0dfa8346","observation_id":"6fa6716e-04e7-41c2-a61f-c2dcbd4576e4","resolution":{"observed_at":"2026-08-03T22:48:12.321881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","snapshot_observed_at":"2026-07-06T21:30:57.177648Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF","version":1},"cited_work":{"arxiv_id":"2505.20417","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20417","snapshot_observed_at":"2026-07-02T22:27:26.359636Z","title":"Scar: Shapley credit assignment for more efficient rlhf.arXiv preprint arXiv:2505.20417","venue":null,"work_id":"cc340c66-6fdc-4882-851f-3e72d0c1f64e","year":null},"citing_paper":{"arxiv_id":"2604.09459","last_updated":"2026-04-13T12:08:22Z","snapshot_observed_at":"2026-07-06T22:58:21.624968Z","submitted_at":"2026-04-10T16:17:44Z","title":"From Reasoning to Agentic: Credit Assignment in Reinforcement Learning for Large Language Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:09:36.341574Z"},"links":{"cited_paper":"/paper/2505.20417","citing_paper":"/paper/2604.09459"},"observation_digest":"sha256:49b2371863a487b793da60d961c620275a6e32e088d4ad978b1b85477f099ddf","observation_id":"8960c0f9-2673-479a-ae7b-632506a527a7","resolution":{"observed_at":"2026-05-11T07:30:58.332657Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","snapshot_observed_at":"2026-07-06T21:30:57.177648Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF","version":1},"cited_work":{"arxiv_id":"2505.20417","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20417","snapshot_observed_at":"2026-07-02T22:27:26.359636Z","title":"Scar: Shapley credit assignment for more efficient rlhf.arXiv preprint arXiv:2505.20417","venue":null,"work_id":"cc340c66-6fdc-4882-851f-3e72d0c1f64e","year":null},"citing_paper":{"arxiv_id":"2606.00257","last_updated":"2026-05-29T18:42:06Z","snapshot_observed_at":"2026-07-06T23:41:01.066075Z","submitted_at":"2026-05-29T18:42:06Z","title":"ARCA: Adapter-Residual Credit Assignment When Token Signals Degenerate","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T22:54:53.415067Z"},"links":{"cited_paper":"/paper/2505.20417","citing_paper":"/paper/2606.00257"},"observation_digest":"sha256:a5dc94a0e157a6b17f25484a5a3d85a18f9786f8c17350b9a9b49503b08f46dd","observation_id":"cf666e19-0e8c-438b-bb20-cd208cea4c1f","resolution":{"observed_at":"2026-07-01T19:16:00.834043Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","snapshot_observed_at":"2026-07-06T21:30:57.177648Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF","version":1},"cited_work":{"arxiv_id":"2505.20417","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20417","snapshot_observed_at":"2026-07-02T22:27:26.359636Z","title":"Scar: Shapley credit assignment for more efficient rlhf.arXiv preprint arXiv:2505.20417","venue":null,"work_id":"cc340c66-6fdc-4882-851f-3e72d0c1f64e","year":null},"citing_paper":{"arxiv_id":"2606.09932","last_updated":"2026-06-07T17:58:58Z","snapshot_observed_at":"2026-07-06T23:49:12.754871Z","submitted_at":"2026-06-07T17:58:58Z","title":"When RL Fails after SFT: Rejuvenating Model Plasticity for Robust SFT-to-RL Handoff","version":1},"reference_index":140,"source":"arxiv_source","source_observed_at":"2026-06-27T18:49:47.876179Z"},"links":{"cited_paper":"/paper/2505.20417","citing_paper":"/paper/2606.09932"},"observation_digest":"sha256:e81af1459f40b228269f49372c60042068c76e5493f2375796e9f2c795dc1ae5","observation_id":"1f7f29c1-b6aa-4e99-aa72-7a6820d4e224","resolution":{"observed_at":"2026-07-02T22:27:26.361615Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","snapshot_observed_at":"2026-07-06T21:30:57.177648Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20417","snapshot_observed_at":"2026-08-02T13:58:43.421940Z","title":"Scar: Shapley credit assignment for more efficient rlhf.arXiv preprint arXiv:2505.20417, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18258","last_updated":"2026-05-15T09:09:57Z","snapshot_observed_at":"2026-08-05T22:55:18.977710Z","submitted_at":"2026-05-15T09:09:57Z","title":"S2T-RLHF: Hierarchical Credit Assignment for Stable Preference-Based RLHF","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T13:58:43.421940Z"},"links":{"cited_paper":"/paper/2505.20417","citing_paper":"/paper/2607.18258"},"observation_digest":"sha256:054e08f07a3d9c81da0626f896e1a153e62ddf570dc022c9aab949f19364f2ee","observation_id":"033c1848-ef05-4e5d-80ec-ad830e59491a","resolution":{"observed_at":"2026-08-02T13:58:43.421940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","snapshot_observed_at":"2026-07-06T21:30:57.177648Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20417","snapshot_observed_at":"2026-08-05T00:40:08.337752Z","title":"arXiv preprint arXiv:2505.20417","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00584","last_updated":"2026-08-01T10:45:03Z","snapshot_observed_at":"2026-08-06T11:12:52.617194Z","submitted_at":"2026-08-01T10:45:03Z","title":"Element-Aware Group Learning for E-Commerce Image Generation","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T00:40:08.337752Z"},"links":{"cited_paper":"/paper/2505.20417","citing_paper":"/paper/2608.00584"},"observation_digest":"sha256:9538f75d17499e86c7a7778eea99b8da48dc2936c328e42d9aacbc53e47d4838","observation_id":"9b46fde3-7666-4fc7-9a59-dc7a74bc6b9d","resolution":{"observed_at":"2026-08-05T00:40:08.337752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.20417/citation-record","integrity":"/paper/2505.20417/integrity","json":"/paper/2505.20417/citation-record.json","paper":"/paper/2505.20417"},"outbound":[],"paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T21:30:57.177648Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2505.20417."}