{"as_of":"2026-08-09T15:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d5aa113b99242a4038078fa45cf0803e61e4fc3e71553cdcdf95e4756c4d702","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-09T06:31:02.800959+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-05T21:02:47.250463Z","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-04T16:19:57.913913Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.22597","last_updated":"2024-10-29T23:28:37Z","snapshot_observed_at":"2026-07-06T19:41:55.010834Z","submitted_at":"2024-10-29T23:28:37Z","title":"Are Large-Language Models Graph Algorithmic Reasoners?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22597","snapshot_observed_at":"2026-08-05T21:02:47.250463Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09549","last_updated":"2025-08-14T07:26:38Z","snapshot_observed_at":"2026-08-09T13:01:04.796572Z","submitted_at":"2025-08-13T07:13:45Z","title":"CS-Agent: LLM-based Community Search via Dual-agent Collaboration","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T21:02:47.250463Z"},"links":{"cited_paper":"/paper/2410.22597","citing_paper":"/paper/2508.09549"},"observation_digest":"sha256:c825ea6b2fe56422a5805ab5935ee30d40e05eb047199cdc071971699ada6d62","observation_id":"6368459c-2276-42dc-8bbe-24c2785d9189","resolution":{"observed_at":"2026-08-05T21:02:47.250463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22597","last_updated":"2024-10-29T23:28:37Z","snapshot_observed_at":"2026-07-06T19:41:55.010834Z","submitted_at":"2024-10-29T23:28:37Z","title":"Are Large-Language Models Graph Algorithmic Reasoners?","version":1},"cited_work":{"arxiv_id":"2410.22597","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22597","snapshot_observed_at":"2026-07-04T16:19:57.913913Z","title":"Podstawski","venue":null,"work_id":"ccb01a86-b5eb-4b0b-939f-e101cc1991ad","year":2024},"citing_paper":{"arxiv_id":"2606.24980","last_updated":"2026-06-23T13:02:06Z","snapshot_observed_at":"2026-08-06T19:00:06.168454Z","submitted_at":"2026-06-23T13:02:06Z","title":"Closed-Loop Graph Algorithm Execution with Small Language Models: Step Accuracy and Rollout Reliability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T00:45:31.424547Z"},"links":{"cited_paper":"/paper/2410.22597","citing_paper":"/paper/2606.24980"},"observation_digest":"sha256:813d6c0d87569eef38d7d80852d78315da5c1dd247dee5a32fcfa93e4fe980ed","observation_id":"ec74079a-90a7-4c15-8e28-5844140ba1b2","resolution":{"observed_at":"2026-07-04T16:19:57.915546Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.22597/citation-record","integrity":"/paper/2410.22597/integrity","json":"/paper/2410.22597/citation-record.json","paper":"/paper/2410.22597"},"outbound":[],"paper":{"arxiv_id":"2410.22597","last_updated":"2024-10-29T23:28:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:41:55.010834Z","submitted_at":"2024-10-29T23:28:37Z","title":"Are Large-Language Models Graph Algorithmic Reasoners?"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.22597."}