{"as_of":"2026-08-19T15:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3c9a9d9e30e134b5729526ca4ad86b01c19d3d85ae2cf149490d12732409073b","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-19T06:32:44.657259+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-06-28T09:27:30.923556Z","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-02T17:07:12.288023Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.22372","last_updated":"2024-10-29T00:28:02Z","snapshot_observed_at":"2026-08-19T07:40:59.834376Z","submitted_at":"2024-10-29T00:28:02Z","title":"A Hierarchical Language Model For Interpretable Graph Reasoning","version":1},"cited_work":{"arxiv_id":"2410.22372","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22372","snapshot_observed_at":"2026-07-02T17:07:12.288023Z","title":"A Hierarchical Language Model For Interpretable Graph Reasoning","venue":null,"work_id":"9043496c-9891-47d2-937b-eae916159eb2","year":2024},"citing_paper":{"arxiv_id":"2606.03606","last_updated":"2026-06-03T12:40:36Z","snapshot_observed_at":"2026-08-05T13:58:58.657681Z","submitted_at":"2026-06-02T13:09:44Z","title":"Testing LLM Arithmetic Reasoning Generalization with Automatic Numeric-Remapping Attacks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T09:27:30.923556Z"},"links":{"cited_paper":"/paper/2410.22372","citing_paper":"/paper/2606.03606"},"observation_digest":"sha256:6ae27eff92e0da59d1fdf34793ca5b04d3f62e23b8fca2aa0014a04fc8b5f656","observation_id":"1a67e19a-8ed7-4fe2-b2e2-5647927ffbfa","resolution":{"observed_at":"2026-07-02T04:06:35.196458Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22372","last_updated":"2024-10-29T00:28:02Z","snapshot_observed_at":"2026-08-19T07:40:59.834376Z","submitted_at":"2024-10-29T00:28:02Z","title":"A Hierarchical Language Model For Interpretable Graph Reasoning","version":1},"cited_work":{"arxiv_id":"2410.22372","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22372","snapshot_observed_at":"2026-07-02T17:07:12.288023Z","title":"A Hierarchical Language Model For Interpretable Graph Reasoning","venue":null,"work_id":"9043496c-9891-47d2-937b-eae916159eb2","year":2024},"citing_paper":{"arxiv_id":"2606.06865","last_updated":"2026-06-05T03:24:38Z","snapshot_observed_at":"2026-07-06T23:46:37.903443Z","submitted_at":"2026-06-05T03:24:38Z","title":"Are Large Language Models Suitable for Graph Computation? Progress and Prospects","version":1},"reference_index":203,"source":"arxiv_source","source_observed_at":"2026-06-27T22:15:03.223540Z"},"links":{"cited_paper":"/paper/2410.22372","citing_paper":"/paper/2606.06865"},"observation_digest":"sha256:3ecec05d0d56488ed76cefca2799aa4bea8779b2e5bf10bfe16e56a0ae077f0e","observation_id":"d06a69c9-a387-404f-a1cc-5afd2017a700","resolution":{"observed_at":"2026-07-02T17:07:12.289660Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.22372/citation-record","integrity":"/paper/2410.22372/integrity","json":"/paper/2410.22372/citation-record.json","paper":"/paper/2410.22372"},"outbound":[],"paper":{"arxiv_id":"2410.22372","last_updated":"2024-10-29T00:28:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T07:40:59.834376Z","submitted_at":"2024-10-29T00:28:02Z","title":"A Hierarchical Language Model For Interpretable Graph Reasoning"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.22372."}