{"as_of":"2026-08-14T07:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70c986c6f81b3269036abe49bdc8062c21a283a159987d969924c8598518a26c","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-14T06:32:32.682623+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-08T17:25:05.921487Z","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-06-30T18:45:00.036224Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.00889","last_updated":"2020-04-22T20:19:19Z","snapshot_observed_at":"2026-08-12T23:26:23.959236Z","submitted_at":"2019-06-03T15:48:38Z","title":"Learning to solve the credit assignment problem","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.00889","snapshot_observed_at":"2026-08-08T17:25:05.921487Z","title":"J., Prakash, P","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2502.05925","last_updated":"2026-07-25T15:22:40Z","snapshot_observed_at":"2026-08-13T20:29:25.724915Z","submitted_at":"2025-02-09T14:59:57Z","title":"Sign-Symmetry Learning Rules are Robust Fine-Tuners","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T17:25:05.921487Z"},"links":{"cited_paper":"/paper/1906.00889","citing_paper":"/paper/2502.05925"},"observation_digest":"sha256:8b718d4eb1852590857fc297c644f6f13e7cc6a80f6567e7281bbfd0219abefd","observation_id":"9a97f1e6-d7d5-443a-a3e9-8adb3e5b9623","resolution":{"observed_at":"2026-08-08T17:25:05.921487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00889","last_updated":"2020-04-22T20:19:19Z","snapshot_observed_at":"2026-08-12T23:26:23.959236Z","submitted_at":"2019-06-03T15:48:38Z","title":"Learning to solve the credit assignment problem","version":4},"cited_work":{"arxiv_id":"1906.00889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.00889","snapshot_observed_at":"2026-06-30T18:45:00.036224Z","title":"J., Prakash, P","venue":null,"work_id":"2b742f3d-402b-41c8-9f90-7713eb6c0947","year":2019},"citing_paper":{"arxiv_id":"2503.02642","last_updated":"2026-04-08T08:57:05Z","snapshot_observed_at":"2026-07-06T20:46:32.628207Z","submitted_at":"2025-03-04T14:05:39Z","title":"Spike-based alignment learning solves the weight transport problem","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-23T02:02:38.546152Z"},"links":{"cited_paper":"/paper/1906.00889","citing_paper":"/paper/2503.02642"},"observation_digest":"sha256:5ad638d1a459540ef182d224c01d6200b44ac5734cf37d4e3d1ee171682b2e48","observation_id":"f013d6cf-6dbf-4cb6-b2ec-b261887d6481","resolution":{"observed_at":"2026-05-23T02:05:19.544218Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00889","last_updated":"2020-04-22T20:19:19Z","snapshot_observed_at":"2026-08-12T23:26:23.959236Z","submitted_at":"2019-06-03T15:48:38Z","title":"Learning to solve the credit assignment problem","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.00889","snapshot_observed_at":"2026-08-07T14:02:49.925331Z","title":"Learning to solve the credit assignment problem.arXiv preprint arXiv:1906.00889, 2019","venue":null,"work_id":null,"year":1906},"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":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:02:49.925331Z"},"links":{"cited_paper":"/paper/1906.00889","citing_paper":"/paper/2505.20417"},"observation_digest":"sha256:d5132e81459fac3c6dc05e48286a5ab83fcf6ae2f2e62ff61633319229954995","observation_id":"5940e98e-e964-4d66-8e02-ca2dd45ca717","resolution":{"observed_at":"2026-08-07T14:02:49.925331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00889","last_updated":"2020-04-22T20:19:19Z","snapshot_observed_at":"2026-08-12T23:26:23.959236Z","submitted_at":"2019-06-03T15:48:38Z","title":"Learning to solve the credit assignment problem","version":4},"cited_work":{"arxiv_id":"1906.00889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.00889","snapshot_observed_at":"2026-06-30T18:45:00.036224Z","title":"J., Prakash, P","venue":null,"work_id":"2b742f3d-402b-41c8-9f90-7713eb6c0947","year":2019},"citing_paper":{"arxiv_id":"2605.24005","last_updated":"2026-05-30T07:28:43Z","snapshot_observed_at":"2026-08-12T13:19:28.535082Z","submitted_at":"2026-05-19T07:27:50Z","title":"LC-ERD: Mining Latent Logic for Self-Evolving Reasoning via Consistency-Regulated Reward Decomposition","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-30T18:44:14.878564Z"},"links":{"cited_paper":"/paper/1906.00889","citing_paper":"/paper/2605.24005"},"observation_digest":"sha256:f0b649b6d7a9469e41a4d66bf502838a6eb6d45a0821581a758743bec717f71c","observation_id":"2b711512-2679-4cfb-8dc1-869bc791bd02","resolution":{"observed_at":"2026-06-30T18:45:00.040459Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1906.00889/citation-record","integrity":"/paper/1906.00889/integrity","json":"/paper/1906.00889/citation-record.json","paper":"/paper/1906.00889"},"outbound":[],"paper":{"arxiv_id":"1906.00889","last_updated":"2020-04-22T20:19:19Z","latest_version":4,"primary_category":"q-bio.NC","snapshot_observed_at":"2026-08-12T23:26:23.959236Z","submitted_at":"2019-06-03T15:48:38Z","title":"Learning to solve the credit assignment problem"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1906.00889."}