{"as_of":"2026-08-10T16:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c3cac2f06c4f6e89dc66d1e53887ad74ae9fa25f8ebf0a58edb89097f1207a66","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T18:51:12.666613Z","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-03T04:27:36.509893Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.03827","last_updated":"2024-11-10T19:25:40Z","snapshot_observed_at":"2026-07-06T17:55:53.304768Z","submitted_at":"2024-04-04T23:05:30Z","title":"Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03827","snapshot_observed_at":"2026-08-09T18:51:12.666613Z","title":"Uniform mem- ory retrieval with larger capacity for modern hopfield models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00500","last_updated":"2025-02-04T15:19:12Z","snapshot_observed_at":"2026-08-10T02:49:33.781140Z","submitted_at":"2025-02-01T17:40:11Z","title":"Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-09T18:51:12.666613Z"},"links":{"cited_paper":"/paper/2404.03827","citing_paper":"/paper/2502.00500"},"observation_digest":"sha256:7367634381c44570f2485e9d17b6601a04fcf1a11b87c8a2513a3b1128cbd9af","observation_id":"5e0dea50-d831-40cf-bb09-587e5e236dd4","resolution":{"observed_at":"2026-08-09T18:51:12.666613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03827","last_updated":"2024-11-10T19:25:40Z","snapshot_observed_at":"2026-07-06T17:55:53.304768Z","submitted_at":"2024-04-04T23:05:30Z","title":"Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03827","snapshot_observed_at":"2026-08-06T16:14:31.849934Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.14386","last_updated":"2025-07-18T22:23:05Z","snapshot_observed_at":"2026-08-10T01:32:43.467276Z","submitted_at":"2025-07-18T22:23:05Z","title":"Training oscillator Ising machines to assign the dynamic stability of their equilibrium points","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:14:31.849934Z"},"links":{"cited_paper":"/paper/2404.03827","citing_paper":"/paper/2507.14386"},"observation_digest":"sha256:399a8166e40343a530e7b0caf4779cea33f300fe178fb0e36ee55c04948ab25b","observation_id":"65085db3-f57c-423d-9329-27ac04c0323d","resolution":{"observed_at":"2026-08-06T16:14:31.849934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03827","last_updated":"2024-11-10T19:25:40Z","snapshot_observed_at":"2026-07-06T17:55:53.304768Z","submitted_at":"2024-04-04T23:05:30Z","title":"Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models","version":3},"cited_work":{"arxiv_id":"2404.03827","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03827","snapshot_observed_at":"2026-07-03T04:27:36.509893Z","title":"arXiv preprint arXiv:2404.03827 , year=","venue":null,"work_id":"659055a3-bb6e-4943-bc62-87c764ae1e0b","year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"cited_paper":"/paper/2404.03827","citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:fe6ede82a7ecb25d3203c52b755c576963db2db414842ebd8ae1493d3a829f33","observation_id":"b39db54b-0f73-46da-a1c0-10022d27bac0","resolution":{"observed_at":"2026-07-03T04:27:36.511516Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.03827/citation-record","integrity":"/paper/2404.03827/integrity","json":"/paper/2404.03827/citation-record.json","paper":"/paper/2404.03827"},"outbound":[],"paper":{"arxiv_id":"2404.03827","last_updated":"2024-11-10T19:25:40Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:55:53.304768Z","submitted_at":"2024-04-04T23:05:30Z","title":"Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2404.03827."}