{"as_of":"2026-08-14T09:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7ceea897042cbaa0debb106286b0cf78f4ab8d4825b3db6214eb60c624360faf","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:24:00.833391Z","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-03T09:07:47.670923Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":"2310.04668","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-07-03T09:07:47.670923Z","title":"Chien, E., Chang, W.-C., Hsieh, C.-J., Yu, H.-F., Zhang, J., Milenkovic, O., and Dhillon, I","venue":null,"work_id":"fd17d3e9-dfaa-4f3a-b9ed-03dedf7617a5","year":2023},"citing_paper":{"arxiv_id":"2501.00309","last_updated":"2025-01-08T05:16:25Z","snapshot_observed_at":"2026-08-07T12:37:34.294206Z","submitted_at":"2024-12-31T06:59:35Z","title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-18T04:33:39.076517Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2501.00309"},"observation_digest":"sha256:b1655b5afe00a154b6e8eeb35e1a59679f3f622bf77eef351833c9d981617085","observation_id":"8e68989c-fc2c-48e9-9792-2898b1bfc983","resolution":{"observed_at":"2026-05-18T04:33:39.738678Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":"2310.04668","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-07-03T09:07:47.670923Z","title":"Chien, E., Chang, W.-C., Hsieh, C.-J., Yu, H.-F., Zhang, J., Milenkovic, O., and Dhillon, I","venue":null,"work_id":"fd17d3e9-dfaa-4f3a-b9ed-03dedf7617a5","year":2023},"citing_paper":{"arxiv_id":"2504.02343","last_updated":"2026-05-11T09:16:48Z","snapshot_observed_at":"2026-08-02T20:27:51.058597Z","submitted_at":"2025-04-03T07:24:18Z","title":"Toward General and Robust LLM-enhanced Text-attributed Graph Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-22T21:26:35.707533Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2504.02343"},"observation_digest":"sha256:d1ee00c7fe08bb4bc4f31c5ee47ef38bbe3af331531c4bfb218323824ddac6c4","observation_id":"a43887ed-0511-479f-84f1-bef9dd1f6144","resolution":{"observed_at":"2026-05-22T21:27:08.272534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-08-07T05:44:53.128259Z","title":"Label-free node classification on graphs with large language models (llms)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07168","last_updated":"2025-06-08T14:34:29Z","snapshot_observed_at":"2026-08-13T21:05:52.337321Z","submitted_at":"2025-06-08T14:34:29Z","title":"Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:53.128259Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2506.07168"},"observation_digest":"sha256:7f528a12185c70e50d643d81a006dda82d3ca453ce450cb33f2b70cfe94222b5","observation_id":"f2d1ab24-7e01-409b-b891-c099e4b72148","resolution":{"observed_at":"2026-08-07T05:44:53.128259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-08-07T13:24:00.833391Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-09T05:18:08.910882Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:00.833391Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:b442c8ea4b0f43ee5acde29273bb1f151c37b4a1c4b4decc3e126e1a56a886d3","observation_id":"56f6f4b9-1007-490c-a2ab-033ea207690f","resolution":{"observed_at":"2026-08-07T13:24:00.833391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-08-03T00:07:39.697630Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.11641","last_updated":"2026-05-31T02:32:04Z","snapshot_observed_at":"2026-08-09T02:42:12.079273Z","submitted_at":"2026-02-12T06:53:35Z","title":"Both Topology and Text Matter: Revisiting LLM-guided Out-of-Distribution Detection on Text-attributed Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T00:07:39.697630Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2602.11641"},"observation_digest":"sha256:a1cffe69edd6f453997365d1c14c579bb5d69f5d6f1cb50e0d72f61443f6dd1f","observation_id":"fe98e8ed-f54b-4d95-999e-285ee2d5f626","resolution":{"observed_at":"2026-08-03T00:07:39.697630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":"2310.04668","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-07-03T09:07:47.670923Z","title":"Chien, E., Chang, W.-C., Hsieh, C.-J., Yu, H.-F., Zhang, J., Milenkovic, O., and Dhillon, I","venue":null,"work_id":"fd17d3e9-dfaa-4f3a-b9ed-03dedf7617a5","year":2023},"citing_paper":{"arxiv_id":"2604.17411","last_updated":"2026-04-19T12:36:18Z","snapshot_observed_at":"2026-08-13T04:14:05.084945Z","submitted_at":"2026-04-19T12:36:18Z","title":"DuConTE: Dual-Granularity Text Encoder with Topology-Constrained Attention for Text-attributed Graphs","version":1},"reference_index":119,"source":"arxiv_source","source_observed_at":"2026-05-10T05:49:52.864722Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2604.17411"},"observation_digest":"sha256:0602276692037a8245441f41df3d32fb29e4b75df9fce43a058cea87041bad02","observation_id":"5864b47f-b792-47f6-9bab-5c9f249ec2f3","resolution":{"observed_at":"2026-05-10T05:51:09.912357Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":"2310.04668","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-07-03T09:07:47.670923Z","title":"Chien, E., Chang, W.-C., Hsieh, C.-J., Yu, H.-F., Zhang, J., Milenkovic, O., and Dhillon, I","venue":null,"work_id":"fd17d3e9-dfaa-4f3a-b9ed-03dedf7617a5","year":2023},"citing_paper":{"arxiv_id":"2605.27913","last_updated":"2026-05-27T03:41:04Z","snapshot_observed_at":"2026-08-12T23:02:33.415046Z","submitted_at":"2026-05-27T03:41:04Z","title":"Where LLM Annotators Fail: Label-Free Learning on Graphs with LLMs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-29T14:26:07.597446Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2605.27913"},"observation_digest":"sha256:ae4d670c790e655a8f9e2814d5343fde403f0b4dae41aa2d4ac7be3367c4e2d7","observation_id":"20880e4f-a462-4070-b3c3-eb062f48ff78","resolution":{"observed_at":"2026-06-29T14:33:30.671826Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":"2310.04668","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-07-03T09:07:47.670923Z","title":"Chien, E., Chang, W.-C., Hsieh, C.-J., Yu, H.-F., Zhang, J., Milenkovic, O., and Dhillon, I","venue":null,"work_id":"fd17d3e9-dfaa-4f3a-b9ed-03dedf7617a5","year":2023},"citing_paper":{"arxiv_id":"2606.11583","last_updated":"2026-06-10T02:15:56Z","snapshot_observed_at":"2026-07-06T23:50:39.386691Z","submitted_at":"2026-06-10T02:15:56Z","title":"Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T10:33:02.954683Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2606.11583"},"observation_digest":"sha256:3291d7670b7881daca777ccc047e5b5f43a8fae17acd82732e4bd34237914bbc","observation_id":"066e4824-a963-46de-8660-d70ffab21323","resolution":{"observed_at":"2026-07-03T09:07:47.672293Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":"2310.04668","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-07-03T09:07:47.670923Z","title":"Chien, E., Chang, W.-C., Hsieh, C.-J., Yu, H.-F., Zhang, J., Milenkovic, O., and Dhillon, I","venue":null,"work_id":"fd17d3e9-dfaa-4f3a-b9ed-03dedf7617a5","year":2023},"citing_paper":{"arxiv_id":"2606.29773","last_updated":"2026-06-29T04:30:45Z","snapshot_observed_at":"2026-07-31T06:33:27.649714Z","submitted_at":"2026-06-29T04:30:45Z","title":"GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T07:33:27.135616Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2606.29773"},"observation_digest":"sha256:b9f73a04ce5fa88d975490e294c46ee3c44c3a385ebd6c37d6427dbce1962024","observation_id":"ba572fb1-77a3-47e7-8ad1-95c57446d266","resolution":{"observed_at":"2026-06-30T07:34:21.261551Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":"2310.04668","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-07-03T09:07:47.670923Z","title":"Chien, E., Chang, W.-C., Hsieh, C.-J., Yu, H.-F., Zhang, J., Milenkovic, O., and Dhillon, I","venue":null,"work_id":"fd17d3e9-dfaa-4f3a-b9ed-03dedf7617a5","year":2023},"citing_paper":{"arxiv_id":"2606.32016","last_updated":"2026-06-30T17:47:39Z","snapshot_observed_at":"2026-08-14T08:13:56.378815Z","submitted_at":"2026-06-30T17:47:39Z","title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","version":1},"reference_index":174,"source":"arxiv_source","source_observed_at":"2026-07-01T06:10:26.634933Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2606.32016"},"observation_digest":"sha256:1bb4357e4be8b3bffce97d3df52df62ad40405fd3958fd026acfa5862edc8892","observation_id":"ae4de128-acd4-47f8-b1b5-e59cc097b77a","resolution":{"observed_at":"2026-07-01T09:45:40.633426Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.04668/citation-record","integrity":"/paper/2310.04668/integrity","json":"/paper/2310.04668/citation-record.json","paper":"/paper/2310.04668"},"outbound":[],"paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T05:55:03.343596Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2310.04668."}