{"as_of":"2026-08-04T07:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0c8ddd2a2492139a4a219639c6c0c1d893348c30424d2de3b7707a8db1205e3","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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-08-01T21:41:53.763438Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.02738","last_updated":"2023-10-03T01:16:33Z","snapshot_observed_at":"2026-07-06T15:50:53.355649Z","submitted_at":"2023-07-06T02:51:54Z","title":"RecallM: An Adaptable Memory Mechanism with Temporal Understanding for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02738","snapshot_observed_at":"2026-08-01T21:41:53.763438Z","title":"arXiv preprint arXiv:2307.02738 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16019","last_updated":"2026-07-17T14:55:34Z","snapshot_observed_at":"2026-08-04T05:50:12.902251Z","submitted_at":"2026-07-17T14:55:34Z","title":"Presentation, Not Mechanism: A Render Confound in Deprecation-Aware Memory Evaluation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T21:41:53.763438Z"},"links":{"cited_paper":"/paper/2307.02738","citing_paper":"/paper/2607.16019"},"observation_digest":"sha256:bd8cf2ee00e576bf35fb9f79f3b90aeb7b0095b03cc499191df376f72eedf2ed","observation_id":"956ab52c-d1bc-4da7-8467-4401d4f126a8","resolution":{"observed_at":"2026-08-01T21:41:53.763438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2307.02738/citation-record","integrity":"/paper/2307.02738/integrity","json":"/paper/2307.02738/citation-record.json","paper":"/paper/2307.02738"},"outbound":[],"paper":{"arxiv_id":"2307.02738","last_updated":"2023-10-03T01:16:33Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T15:50:53.355649Z","submitted_at":"2023-07-06T02:51:54Z","title":"RecallM: An Adaptable Memory Mechanism with Temporal Understanding for Large Language 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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2307.02738."}