{"as_of":"2026-08-10T19:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5c04fda9ceec8fb13aed2271637b8a9dea057bd5bb9a7fccdb261f1e0a51cf4","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T13:08:45.492335Z","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-03T20:08:56.299248Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.03393","last_updated":"2024-01-16T16:12:14Z","snapshot_observed_at":"2026-08-06T02:12:40.014268Z","submitted_at":"2023-07-07T05:31:31Z","title":"Exploring the Potential of Large Language Models (LLMs) in Learning on Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.03393","snapshot_observed_at":"2026-08-06T13:08:45.492335Z","title":"Exploring the potential of large language models (llms) in learning on graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20967","last_updated":"2025-07-28T16:22:50Z","snapshot_observed_at":"2026-08-07T05:41:14.324729Z","submitted_at":"2025-07-28T16:22:50Z","title":"PROVCREATOR: Synthesizing Complex Heterogenous Graphs with Node and Edge Attributes","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T13:08:45.492335Z"},"links":{"cited_paper":"/paper/2307.03393","citing_paper":"/paper/2507.20967"},"observation_digest":"sha256:6e7c40d668250c8f038d769d76ce4c56e4a133c930b15ee1596fa5094be0e961","observation_id":"d9b42afc-b77f-4451-993a-c92078bb0979","resolution":{"observed_at":"2026-08-06T13:08:45.492335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03393","last_updated":"2024-01-16T16:12:14Z","snapshot_observed_at":"2026-08-06T02:12:40.014268Z","submitted_at":"2023-07-07T05:31:31Z","title":"Exploring the Potential of Large Language Models (LLMs) in Learning on Graphs","version":4},"cited_work":{"arxiv_id":"2307.03393","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.03393","snapshot_observed_at":"2026-07-03T20:08:56.299248Z","title":null,"venue":null,"work_id":"1549f3d4-f7c4-476c-a086-4389c4f84a30","year":2023},"citing_paper":{"arxiv_id":"2605.27913","last_updated":"2026-05-27T03:41:04Z","snapshot_observed_at":"2026-08-09T19:55:17.804982Z","submitted_at":"2026-05-27T03:41:04Z","title":"Where LLM Annotators Fail: Label-Free Learning on Graphs with LLMs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-29T14:26:07.597446Z"},"links":{"cited_paper":"/paper/2307.03393","citing_paper":"/paper/2605.27913"},"observation_digest":"sha256:be57aabeb0472bba3d95f2ee42bf7dbbd58fd72e72ff67a0186b6681a2dc517d","observation_id":"7d7e0fb5-9f70-4510-992b-cce1761cea61","resolution":{"observed_at":"2026-06-29T14:33:30.678721Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03393","last_updated":"2024-01-16T16:12:14Z","snapshot_observed_at":"2026-08-06T02:12:40.014268Z","submitted_at":"2023-07-07T05:31:31Z","title":"Exploring the Potential of Large Language Models (LLMs) in Learning on Graphs","version":4},"cited_work":{"arxiv_id":"2307.03393","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.03393","snapshot_observed_at":"2026-07-03T20:08:56.299248Z","title":null,"venue":null,"work_id":"1549f3d4-f7c4-476c-a086-4389c4f84a30","year":2023},"citing_paper":{"arxiv_id":"2606.11663","last_updated":"2026-06-10T05:12:29Z","snapshot_observed_at":"2026-07-31T06:58:48.131667Z","submitted_at":"2026-06-10T05:12:29Z","title":"Probabilistic Salary Prediction with Graph Attention Networks and a Mixture Density Network","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T07:54:27.545286Z"},"links":{"cited_paper":"/paper/2307.03393","citing_paper":"/paper/2606.11663"},"observation_digest":"sha256:4494eb03a349a364e53749bb6528d429eeca1658a68a840756708e43a102e261","observation_id":"868b32a7-5353-4fe0-8201-437dd104635c","resolution":{"observed_at":"2026-07-03T13:28:19.491725Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03393","last_updated":"2024-01-16T16:12:14Z","snapshot_observed_at":"2026-08-06T02:12:40.014268Z","submitted_at":"2023-07-07T05:31:31Z","title":"Exploring the Potential of Large Language Models (LLMs) in Learning on Graphs","version":4},"cited_work":{"arxiv_id":"2307.03393","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.03393","snapshot_observed_at":"2026-07-03T20:08:56.299248Z","title":null,"venue":null,"work_id":"1549f3d4-f7c4-476c-a086-4389c4f84a30","year":2023},"citing_paper":{"arxiv_id":"2606.17667","last_updated":"2026-06-16T08:29:34Z","snapshot_observed_at":"2026-08-03T03:23:46.290922Z","submitted_at":"2026-06-16T08:29:34Z","title":"Handling Feature Heterogeneity with Learnable Graph Patches","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T01:36:45.977332Z"},"links":{"cited_paper":"/paper/2307.03393","citing_paper":"/paper/2606.17667"},"observation_digest":"sha256:4e06411c267e1be02fa913e8509ce029d1df41a80979f47188ba81f679ac0088","observation_id":"73f20bee-a6b5-4b84-b5f6-0b1796b7a8f6","resolution":{"observed_at":"2026-07-03T20:08:56.301589Z","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/2307.03393/citation-record","integrity":"/paper/2307.03393/integrity","json":"/paper/2307.03393/citation-record.json","paper":"/paper/2307.03393"},"outbound":[],"paper":{"arxiv_id":"2307.03393","last_updated":"2024-01-16T16:12:14Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T02:12:40.014268Z","submitted_at":"2023-07-07T05:31:31Z","title":"Exploring the Potential of Large Language Models (LLMs) in Learning on Graphs"},"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 4 inbound Pith citation observations for arXiv:2307.03393."}