{"as_of":"2026-08-17T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1822728a785f35ef491c60fcce456052453bb3db40a2e1732c17a5a947720f24","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:53:29.970787Z","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-30T03:04:15.198692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.00335","last_updated":"2025-02-17T23:41:50Z","snapshot_observed_at":"2026-08-16T14:30:42.771799Z","submitted_at":"2023-12-30T21:49:47Z","title":"Benchmarking Hebbian learning rules for associative memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.00335","snapshot_observed_at":"2026-08-11T04:53:29.970787Z","title":"Lansner, N.B","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.18349","last_updated":"2024-12-24T11:22:18Z","snapshot_observed_at":"2026-08-15T11:02:06.051788Z","submitted_at":"2024-12-24T11:22:18Z","title":"Neural auto-association with optimal Bayesian learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T04:53:29.970787Z"},"links":{"cited_paper":"/paper/2401.00335","citing_paper":"/paper/2412.18349"},"observation_digest":"sha256:863bfb8f7b48792a4a2130f27a4d78924714def0e743d114210839e2cb4d1701","observation_id":"6abe7eb1-8aa5-4f83-a7d5-8ad78b7ee13c","resolution":{"observed_at":"2026-08-11T04:53:29.970787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.00335","last_updated":"2025-02-17T23:41:50Z","snapshot_observed_at":"2026-08-16T14:30:42.771799Z","submitted_at":"2023-12-30T21:49:47Z","title":"Benchmarking Hebbian learning rules for associative memory","version":2},"cited_work":{"arxiv_id":"2401.00335","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.00335","snapshot_observed_at":"2026-06-30T03:04:15.198692Z","title":"Lansner, N.B","venue":null,"work_id":"985195f1-38ce-480a-8e72-66e75b99ab77","year":2025},"citing_paper":{"arxiv_id":"2606.29528","last_updated":"2026-06-28T17:44:13Z","snapshot_observed_at":"2026-08-14T23:27:34.480662Z","submitted_at":"2026-06-28T17:44:13Z","title":"Supervised Hebbian learning in Deep Counterstream Associative Networks","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-30T01:48:31.085507Z"},"links":{"cited_paper":"/paper/2401.00335","citing_paper":"/paper/2606.29528"},"observation_digest":"sha256:09416d93477cf52d928d9b4638a2588f9785407409d2d31deb372c1884b7ef51","observation_id":"ceeaa5e3-6e6e-4e0d-ab77-0b466df0ae29","resolution":{"observed_at":"2026-06-30T03:04:15.200562Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.00335/citation-record","integrity":"/paper/2401.00335/integrity","json":"/paper/2401.00335/citation-record.json","paper":"/paper/2401.00335"},"outbound":[],"paper":{"arxiv_id":"2401.00335","last_updated":"2025-02-17T23:41:50Z","latest_version":2,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-16T14:30:42.771799Z","submitted_at":"2023-12-30T21:49:47Z","title":"Benchmarking Hebbian learning rules for associative memory"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2401.00335."}