{"as_of":"2026-08-16T10:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:268ecfae0a93c1fe1080cc86948f60bd5b03e32ffa6691e4fb5f4b6e3cd09716","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:57:35.510262Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T13:19:35.424177Z","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-11T18:56:06.804172Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"cited_work":{"arxiv_id":"2501.03176","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.03176","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d8450e37-0709-4f80-8da9-35079b1b2f1b","year":2025},"citing_paper":{"arxiv_id":"2605.06240","last_updated":"2026-05-07T13:24:58Z","snapshot_observed_at":"2026-07-06T23:18:46.145104Z","submitted_at":"2026-05-07T13:24:58Z","title":"Cumulative-Goodness Free-Riding in Forward-Forward Networks: Real, Repairable, but Not Accuracy-Dominant","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-08T13:19:35.424177Z"},"links":{"cited_paper":"/paper/2501.03176","citing_paper":"/paper/2605.06240"},"observation_digest":"sha256:932bbd9196f9925773904f42cc6c6991099bfaa097acc469899c4ffce03f8983","observation_id":"d5f64be8-a6d9-4648-b2bd-6a7ffc04fc2a","resolution":{"observed_at":"2026-05-11T18:56:06.815954Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.03176/citation-record","integrity":"/paper/2501.03176/integrity","json":"/paper/2501.03176/citation-record.json","paper":"/paper/2501.03176"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.902870Z","title":"De ep residual learning for image recognition, 2015","venue":null,"work_id":"4ec80ac5-5e53-432f-9a0e-0c541eb06146","year":2015},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.449982Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:10ac3d45e24614f0a608f582ce7f3b40ccdbe3d5d9cedd29138332bedff1e076","observation_id":"2c532fad-f068-4822-9e48-70324142053e","resolution":{"observed_at":"2026-08-10T21:57:35.910024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.884177Z","title":"Searching for mobilenetv3","venue":null,"work_id":"356206a1-3fd7-472a-87b9-e10bc58c91bd","year":2019},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.455996Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:46bd372cded3641d516dd56e088754dca26b5e1a72ece6d15f31e3939a2026c7","observation_id":"86cf516d-9146-4fae-b4bb-0fd4e7ed0932","resolution":{"observed_at":"2026-08-10T21:57:35.889633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.864073Z","title":"Convolutional channel-wise competitive le arning for the forward-forward algorithm","venue":null,"work_id":"9fd5c142-3d56-4f43-b761-2c1602c5de05","year":2024},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.461419Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:014bbc2ba4fb0f9bbcaa38b3433cdcba16987c5932907fe41db5f2062cfdb9cf","observation_id":"bc793a04-402b-424c-9b6c-69e655604500","resolution":{"observed_at":"2026-08-10T21:57:35.870712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.13345","last_updated":"2022-12-27T02:54:46Z","snapshot_observed_at":"2026-08-16T05:49:12.372387Z","submitted_at":"2022-12-27T02:54:46Z","title":"The Forward-Forward Algorithm: Some Preliminary Investigations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.13345","snapshot_observed_at":"2026-08-10T21:57:35.466549Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.466549Z"},"links":{"cited_paper":"/paper/2212.13345","citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:0e73164d8da3d43a3a39dce7e36a18eb71b16405fdf32d1f8946ef8e21da5df7","observation_id":"5e037e8f-4d27-45de-8c52-f54503c0075e","resolution":{"observed_at":"2026-08-10T21:57:35.466549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.472384Z","title":"Train- ing convolutional neural networks with the forward-forwar d algorithm","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.472384Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:29903478c30196249fa99dfccab852be012119a6f9682be2cdc95fee240b2228","observation_id":"9c42e7d2-4e9b-4d20-b3c5-40343eff8e48","resolution":{"observed_at":"2026-08-10T21:57:35.472384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.843507Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":"ee6c5843-de48-4c51-ba9d-af3c1cbee393","year":1998},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.477721Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:a5eaa6e3a571cd523219ba4d759497600dc170c7fc3b0eba8d4d367ea8e62fa6","observation_id":"0a190f2c-1cb6-444a-877e-c3303675ba27","resolution":{"observed_at":"2026-08-10T21:57:35.848808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.826218Z","title":"Fashion-mn ist: a novel image dataset for benchmarking machine learning algorithms, 2017","venue":null,"work_id":"b11ba7d9-bf96-4fc8-bafc-3e4796fcaaf9","year":2017},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.483948Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:fa73fbbd410a3c879c8845760ded5982ae5e96c1f2abf1e634d3a9012706e808","observation_id":"3a6a6688-687f-4e22-b378-15b8c5ffc2e3","resolution":{"observed_at":"2026-08-10T21:57:35.831663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.806386Z","title":"Resource-efficient medical image analysis with self-adapting forward-forward networks","venue":null,"work_id":"44777874-104b-4320-b1fd-7ba7f3f73ec9","year":2024},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.489341Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:ba32a9239218bcdcf9b1ea4c2648badcf7617c5c06a5729ccaf064f426f81f0d","observation_id":"2d4c1289-ad1a-4bdf-8d7a-d4c6258b58fb","resolution":{"observed_at":"2026-08-10T21:57:35.812375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11593","last_updated":"2025-03-27T15:57:57Z","snapshot_observed_at":"2026-08-12T22:42:52.872467Z","submitted_at":"2024-09-17T22:58:20Z","title":"Self-Contrastive Forward-Forward Algorithm","version":2},"cited_work":{"arxiv_id":"2409.11593","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.11593","snapshot_observed_at":"2026-08-10T21:57:35.581629Z","title":"Self-Contrastive Forward-Forward Algorithm","venue":"cs.LG","work_id":"5787821b-5cba-4e76-ac8d-7c364dacdd89","year":2024},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.494408Z"},"links":{"cited_paper":"/paper/2409.11593","citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:97e509643c63d88bb3d7744b9cf8779a6dc66ff1e4d42c97371450fb86b64f0b","observation_id":"ccb7c622-5a33-48e3-ae8c-09e55483ed4b","resolution":{"observed_at":"2026-08-10T21:57:35.591227Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.03432","last_updated":"2024-05-26T16:40:11Z","snapshot_observed_at":"2026-08-13T00:14:00.959799Z","submitted_at":"2024-05-06T12:54:22Z","title":"Improved Forward-Forward Contrastive Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.03432","snapshot_observed_at":"2026-08-10T21:57:35.499765Z","title":"Improved forward-forward contrastive lea rning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.499765Z"},"links":{"cited_paper":"/paper/2405.03432","citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:55bc8cda699f9f54775b76aa26a4fcf25387ef903f77ab970bde7f32bbcdfdee","observation_id":"e91591e4-4004-41a3-acdf-cec982770755","resolution":{"observed_at":"2026-08-10T21:57:35.499765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.788314Z","title":"Learning multi ple layers of features from tiny images","venue":null,"work_id":"7d737084-8a06-4cd4-a879-7ebf9ba2de09","year":2009},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.505023Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:78d0ca02cc97a6df0a24419852a516e02944ce1f35cb8e32f9b10410a5dcda67","observation_id":"a05d71ea-6dfa-442d-8926-5ff49bfa028f","resolution":{"observed_at":"2026-08-10T21:57:35.793726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:35.772209Z","title":"Imagenette: A smaller subset of 10 easil y classified classes from imagenet, March 2019","venue":null,"work_id":"aac640cc-f1a0-4392-b258-860253121042","year":2019},"citing_paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:35.510262Z"},"links":{"citing_paper":"/paper/2501.03176"},"observation_digest":"sha256:9e6a8f39a83091177aa0f0aa9ff886b48fe50c728f93cac6305beb2d6d9b6807","observation_id":"977abc93-78f5-407b-8af6-c2ad33b1ae94","resolution":{"observed_at":"2026-08-10T21:57:35.777416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.03176","last_updated":"2025-01-06T17:49:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T09:43:31.561693Z","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":12},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 1 inbound Pith citation observation for arXiv:2501.03176."}