{"as_of":"2026-08-09T05:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ec06af9f0c310dad89138436d25807fee0463994575d148b0d9a142fe289145","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:42:55.833385Z","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-05-22T07:04:41.452756Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.01805","last_updated":"2026-06-17T11:42:47Z","snapshot_observed_at":"2026-08-07T17:32:44.612536Z","submitted_at":"2025-03-03T18:33:58Z","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01805","snapshot_observed_at":"2026-08-07T15:42:55.833385Z","title":"Depth-width tradeoffs in algorithmic reasoning of graph tasks with transformers","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14840","last_updated":"2025-05-20T19:12:43Z","snapshot_observed_at":"2026-08-08T17:27:21.465455Z","submitted_at":"2025-05-20T19:12:43Z","title":"Subquadratic Algorithms and Hardness for Attention with Any Temperature","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T15:42:55.833385Z"},"links":{"cited_paper":"/paper/2503.01805","citing_paper":"/paper/2505.14840"},"observation_digest":"sha256:b6cd139fc89d366b6b23f0c170aa6ff435a39f9deaadaf5cdedeb83c410864c0","observation_id":"9eab0b74-f8f8-4aa0-8d99-4d97292a4159","resolution":{"observed_at":"2026-08-07T15:42:55.833385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01805","last_updated":"2026-06-17T11:42:47Z","snapshot_observed_at":"2026-08-07T17:32:44.612536Z","submitted_at":"2025-03-03T18:33:58Z","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers","version":3},"cited_work":{"arxiv_id":"2503.01805","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.01805","snapshot_observed_at":"2026-06-19T17:10:42.669147Z","title":"arXiv preprint arXiv:2503.01805 , year=","venue":null,"work_id":"98eeb7cb-3571-456f-b26d-6736c0679355","year":2025},"citing_paper":{"arxiv_id":"2510.26745","last_updated":"2026-05-18T17:56:38Z","snapshot_observed_at":"2026-08-02T20:19:54.425869Z","submitted_at":"2025-10-30T17:40:22Z","title":"Deep sequence models tend to memorize geometrically; it is unclear why","version":3},"reference_index":196,"source":"pdf_text","source_observed_at":"2026-05-21T20:38:18.005002Z"},"links":{"cited_paper":"/paper/2503.01805","citing_paper":"/paper/2510.26745"},"observation_digest":"sha256:e970f77e17dc540f2d8da38132cea98473b8fb93e81a35fce2079db430c42fc2","observation_id":"afc4f8bc-6c7a-4e92-9acb-3c1aab59a1b7","resolution":{"observed_at":"2026-06-19T17:10:42.669147Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01805","last_updated":"2026-06-17T11:42:47Z","snapshot_observed_at":"2026-08-07T17:32:44.612536Z","submitted_at":"2025-03-03T18:33:58Z","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01805","snapshot_observed_at":"2026-08-03T05:44:25.595701Z","title":"Wang, X., Yang, H., and Zhang, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.01553","last_updated":"2026-07-26T09:03:31Z","snapshot_observed_at":"2026-08-08T23:32:29.441541Z","submitted_at":"2026-02-02T02:45:52Z","title":"Plain Transformers are Surprisingly Powerful Link Predictors","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T05:44:25.595701Z"},"links":{"cited_paper":"/paper/2503.01805","citing_paper":"/paper/2602.01553"},"observation_digest":"sha256:e15e0a9e8506b0f88e678f37a9a894f35d13b472024a088b013a7cd56110ab1a","observation_id":"cab3f13b-7161-477f-a62d-5b0dadce31d0","resolution":{"observed_at":"2026-08-03T05:44:25.595701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01805","last_updated":"2026-06-17T11:42:47Z","snapshot_observed_at":"2026-08-07T17:32:44.612536Z","submitted_at":"2025-03-03T18:33:58Z","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers","version":3},"cited_work":{"arxiv_id":"2503.01805","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.01805","snapshot_observed_at":"2026-06-19T17:10:42.669147Z","title":"arXiv preprint arXiv:2503.01805 , year=","venue":null,"work_id":"98eeb7cb-3571-456f-b26d-6736c0679355","year":2025},"citing_paper":{"arxiv_id":"2602.13155","last_updated":"2026-05-13T09:47:05Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-13T18:08:23Z","title":"Learning to Approximate Uniform Facility Location via Graph Neural Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T22:14:13.928500Z"},"links":{"cited_paper":"/paper/2503.01805","citing_paper":"/paper/2602.13155"},"observation_digest":"sha256:2d7f59a802e1caeb1a64dfb1dd211c4c7bc5d53b98d8c8419bea4ac03c5720ff","observation_id":"26740adb-71f0-4a0c-ace4-b178fc2be44b","resolution":{"observed_at":"2026-06-19T17:10:42.669147Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01805","last_updated":"2026-06-17T11:42:47Z","snapshot_observed_at":"2026-08-07T17:32:44.612536Z","submitted_at":"2025-03-03T18:33:58Z","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers","version":3},"cited_work":{"arxiv_id":"2503.01805","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.01805","snapshot_observed_at":"2026-06-19T17:10:42.669147Z","title":"arXiv preprint arXiv:2503.01805 , year=","venue":null,"work_id":"98eeb7cb-3571-456f-b26d-6736c0679355","year":2025},"citing_paper":{"arxiv_id":"2605.22471","last_updated":"2026-05-21T13:32:20Z","snapshot_observed_at":"2026-08-02T11:52:59.155097Z","submitted_at":"2026-05-21T13:32:20Z","title":"Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-22T07:03:52.438466Z"},"links":{"cited_paper":"/paper/2503.01805","citing_paper":"/paper/2605.22471"},"observation_digest":"sha256:49af4d3a18e05edf6607a71c7b583c8eec9a781b96e59ff4fba47b063ad7e2e3","observation_id":"f8aa2159-d5a1-4608-921c-6d8f1819c9da","resolution":{"observed_at":"2026-06-19T17:10:42.669147Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.01805/citation-record","integrity":"/paper/2503.01805/integrity","json":"/paper/2503.01805/citation-record.json","paper":"/paper/2503.01805"},"outbound":[],"paper":{"arxiv_id":"2503.01805","last_updated":"2026-06-17T11:42:47Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:32:44.612536Z","submitted_at":"2025-03-03T18:33:58Z","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2503.01805."}