{"as_of":"2026-08-23T07:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0cb2edcc8f4d815e8b8ab51c2ac532b10d16f443fee9c8a2ef09bd252de7d21","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:01:38.480706Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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-16T04:31:05.613232Z","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-22T10:31:25.445556Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15755","snapshot_observed_at":"2026-08-16T04:31:05.613232Z","title":"Available: https://arxiv.org/abs/2501.15755","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.03799","last_updated":"2025-05-02T06:08:21Z","snapshot_observed_at":"2026-08-20T16:28:52.128584Z","submitted_at":"2025-05-02T06:08:21Z","title":"Scalability Matters: Overcoming Challenges in InstructGLM with Similarity-Degree-Based Sampling","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-16T04:31:05.613232Z"},"links":{"cited_paper":"/paper/2501.15755","citing_paper":"/paper/2505.03799"},"observation_digest":"sha256:b42cb431852941990453d286fdde1644595c69481344e3778b539f12b0414d24","observation_id":"40cf9b60-da90-4364-a051-eb56d4fbaf63","resolution":{"observed_at":"2026-08-16T04:31:05.613232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15755","snapshot_observed_at":"2026-08-07T11:26:42.822550Z","title":"Graphicl: Unlocking graph learning potential in llms through structured prompt design, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.02568","last_updated":"2026-06-10T06:51:15Z","snapshot_observed_at":"2026-08-14T03:11:37.782894Z","submitted_at":"2025-06-03T07:52:00Z","title":"MLaGA: Multimodal Large Language and Graph Assistant","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T11:26:42.822550Z"},"links":{"cited_paper":"/paper/2501.15755","citing_paper":"/paper/2506.02568"},"observation_digest":"sha256:3a7f6c1ef5e8966f6792712891a4c44e8b45036120aa225d80ca0d81cf121a06","observation_id":"ba55a8f8-e5e8-4829-a95b-e08ede781d78","resolution":{"observed_at":"2026-08-07T11:26:42.822550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"cited_work":{"arxiv_id":"2501.15755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.15755","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graphicl: Unlock- ing graph learning potential in llms through structured prompt design","venue":null,"work_id":"a144ee52-39e0-477f-9e53-5d6649042886","year":2025},"citing_paper":{"arxiv_id":"2511.02135","last_updated":"2026-04-16T08:31:14Z","snapshot_observed_at":"2026-08-16T14:00:08.903797Z","submitted_at":"2025-11-03T23:54:24Z","title":"Graph-Based Alternatives to LLMs for Human Simulation","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-18T00:47:40.432039Z"},"links":{"cited_paper":"/paper/2501.15755","citing_paper":"/paper/2511.02135"},"observation_digest":"sha256:0c16211d83b6361cdc74911a1afd5d67c67e306e27a7c1a2e9397486342433d5","observation_id":"9ff36a8a-72d3-4e28-bb8e-d0965bf3c5e7","resolution":{"observed_at":"2026-05-18T00:50:33.213844Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"cited_work":{"arxiv_id":"2501.15755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.15755","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graphicl: Unlock- ing graph learning potential in llms through structured prompt design","venue":null,"work_id":"a144ee52-39e0-477f-9e53-5d6649042886","year":2025},"citing_paper":{"arxiv_id":"2603.02938","last_updated":"2026-05-21T07:56:15Z","snapshot_observed_at":"2026-08-20T12:39:09.465114Z","submitted_at":"2026-03-03T12:47:44Z","title":"Beyond One-Size-Fits-All: Adaptive Subgraph Denoising for Zero-Shot Graph Learning with Large Language Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-22T10:30:01.910920Z"},"links":{"cited_paper":"/paper/2501.15755","citing_paper":"/paper/2603.02938"},"observation_digest":"sha256:7e8644018a5dd784e3759f9ce4a4f8d9c462f9aff09fee121a4f49ec77e71f27","observation_id":"d8f467bb-d25e-4336-83cb-0891520f6f27","resolution":{"observed_at":"2026-05-22T10:31:25.447991Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.15755/citation-record","integrity":"/paper/2501.15755/integrity","json":"/paper/2501.15755/citation-record.json","paper":"/paper/2501.15755"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.256011Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.256011Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:573499ca37d949b6b42389691779d6c18a5e2ae8aa58f56b79f07a0aae3d9c87","observation_id":"d0625980-5a92-49cf-ae62-f171a60002bf","resolution":{"observed_at":"2026-08-10T14:01:38.256011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.261032Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.261032Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:fa5e2ccba0baa65d1614567f7a793063ed07c78c2a357eca3291e75f240a493a","observation_id":"d56c1572-5d38-473f-ac14-01699f534ec4","resolution":{"observed_at":"2026-08-10T14:01:38.261032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.265684Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.265684Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:2ec3b74b6bae91452659107b905b7d39faa43aa22dee3413312e3c11b438c581","observation_id":"a78ea3e9-fbf5-4a2f-92f0-a2ca62805764","resolution":{"observed_at":"2026-08-10T14:01:38.265684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08170","last_updated":"2024-04-11T05:01:12Z","snapshot_observed_at":"2026-08-18T09:26:33.123720Z","submitted_at":"2024-02-13T02:03:26Z","title":"LLaGA: Large Language and Graph Assistant","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08170","snapshot_observed_at":"2026-08-10T14:01:38.269750Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.269750Z"},"links":{"cited_paper":"/paper/2402.08170","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:6b42279aec33962c7b2e2b0b820424520c4933dcc0bbf72255b8cdf29949336e","observation_id":"126f3c8a-b29e-40f8-af17-250fba39dec9","resolution":{"observed_at":"2026-08-10T14:01:38.269750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.211785Z","title":null,"venue":null,"work_id":"6607ca25-9671-4809-9f9a-f8c4785cb825","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.274015Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:311b9c46a83ed9bb7896cab3dab31fcf5f4fd1b3e321c0fd1c175172c7be2a8a","observation_id":"7ab766f6-fe88-42f8-a40a-c5144957b985","resolution":{"observed_at":"2026-08-10T14:01:39.215663Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.198624Z","title":null,"venue":null,"work_id":"21d3d1bd-9ffc-481a-9ce6-8d1844244527","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.278499Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:6008ab7ac26e1124c1e01a0ea694179949f9194fa878e992518c4c7c03ef1f4c","observation_id":"70f34a8c-0dac-42b7-bc68-c6694da57e26","resolution":{"observed_at":"2026-08-10T14:01:39.202722Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-19T18:51:22.817288Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.00064","snapshot_observed_at":"2026-08-10T14:01:38.282649Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.282649Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:df2445658ca75b40529a3b9acdb8bf1d29e62ad08b52e7a7f5fb99dee6e9929e","observation_id":"f05fe4e7-2365-435a-85ca-7b71143b400b","resolution":{"observed_at":"2026-08-10T14:01:38.282649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12288","last_updated":"2024-10-16T06:47:18Z","snapshot_observed_at":"2026-08-16T13:08:55.822358Z","submitted_at":"2024-10-16T06:47:18Z","title":"A Prompt-Based Knowledge Graph Foundation Model for Universal In-Context Reasoning","version":1},"cited_work":{"arxiv_id":"2410.12288","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.12288","snapshot_observed_at":"2026-08-10T14:01:38.840849Z","title":"A Prompt-Based Knowledge Graph Foundation Model for Universal In-Context Reasoning","venue":"cs.AI","work_id":"1a98203b-8be2-4daf-9299-101fe8548a11","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.286998Z"},"links":{"cited_paper":"/paper/2410.12288","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:848228f4da257f44d6651a6bda0df20229172497603b8d9b6a9b04b45ded4b96","observation_id":"c6a4cdcf-edec-43ec-8302-63d2fde424fb","resolution":{"observed_at":"2026-08-10T14:01:38.846711Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-10T14:01:38.291395Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.291395Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:c528e96afa4253e9a42b33e5d5be3ba2274fcf878589566953ecd234bbd0b803","observation_id":"9557b35d-bcf6-45c5-a4c8-ddb856ff6671","resolution":{"observed_at":"2026-08-10T14:01:38.291395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00234","last_updated":"2024-10-05T11:47:02Z","snapshot_observed_at":"2026-07-06T14:36:25.690733Z","submitted_at":"2022-12-31T15:57:09Z","title":"A Survey on In-context Learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00234","snapshot_observed_at":"2026-08-10T14:01:38.295724Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.295724Z"},"links":{"cited_paper":"/paper/2301.00234","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:6cb088585382124871ac9c856b2852e0c3a5f41baf3d7ffd229a0efff5540ed3","observation_id":"5b53538b-465e-49a6-91a9-e0d8ed1fce36","resolution":{"observed_at":"2026-08-10T14:01:38.295724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.299958Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.299958Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:c93d75d2e34d7e659b24876fd4bdfc7abbc818455c9b971050960ad6e3b93db5","observation_id":"daba6b6c-832e-40dd-9d61-f9b0deec685e","resolution":{"observed_at":"2026-08-10T14:01:38.299958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12052","last_updated":"2024-12-23T08:30:47Z","snapshot_observed_at":"2026-08-16T13:42:04.830450Z","submitted_at":"2024-06-17T19:45:21Z","title":"UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12052","snapshot_observed_at":"2026-08-10T14:01:38.303572Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.303572Z"},"links":{"cited_paper":"/paper/2406.12052","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:a9adb211bb6c972f7eaa8e631d156d81ec7d49bfdf2d8db72398fe00620e8a32","observation_id":"20038020-4422-45fa-ab50-6d9fa9cb091f","resolution":{"observed_at":"2026-08-10T14:01:38.303572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.178350Z","title":null,"venue":null,"work_id":"18c3e1bc-773c-4440-8cfc-26ade9a57ef4","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.307727Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:39842f7791857b0e270df8fe0983cafe19c423c5ca2cbd331ec2974aa855ab8b","observation_id":"b2586c7f-4a61-4f14-bd85-f06642e5cc92","resolution":{"observed_at":"2026-08-10T14:01:39.182480Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04562","last_updated":"2024-04-09T19:48:22Z","snapshot_observed_at":"2026-08-21T12:54:52.327826Z","submitted_at":"2023-10-06T20:00:07Z","title":"Towards Foundation Models for Knowledge Graph Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04562","snapshot_observed_at":"2026-08-10T14:01:38.311342Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.311342Z"},"links":{"cited_paper":"/paper/2310.04562","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:9e1c6b7bc3c5d79290f56a0be7a53ae2381906756fde1d490a7fb9cba0f67261","observation_id":"f600541f-e4c1-4333-847e-2f3600fbd745","resolution":{"observed_at":"2026-08-10T14:01:38.311342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.04043","last_updated":"2018-02-20T16:52:36Z","snapshot_observed_at":"2026-08-14T20:14:45.467274Z","submitted_at":"2017-11-10T23:32:47Z","title":"Few-Shot Learning with Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.04043","snapshot_observed_at":"2026-08-10T14:01:38.315643Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.315643Z"},"links":{"cited_paper":"/paper/1711.04043","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:a5c601f36eef4ee8af380ab3487e6fcec22f10ab24367e1a809a059b938785a0","observation_id":"fede8a8a-4689-4dbd-8c71-e1c86ccdbb8e","resolution":{"observed_at":"2026-08-10T14:01:38.315643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.319667Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.319667Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:5b00579f6d088eb195a99f7fa48636664109828da2afe7155c2b64609b6676ec","observation_id":"8ad08c22-18e3-4b03-9dce-c3790c3d04aa","resolution":{"observed_at":"2026-08-10T14:01:38.319667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.15066","last_updated":"2023-07-11T15:08:00Z","snapshot_observed_at":"2026-08-17T17:57:54.380112Z","submitted_at":"2023-05-24T11:53:19Z","title":"GPT4Graph: Can Large Language Models Understand Graph Structured Data ? An Empirical Evaluation and Benchmarking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15066","snapshot_observed_at":"2026-08-10T14:01:38.323235Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.323235Z"},"links":{"cited_paper":"/paper/2305.15066","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:6b650465b3a888597efe0e0f2d76110d0d2348036f688d3ddff90a268f32f49e","observation_id":"8eefea6b-39b5-4cf6-b22e-7fe74f4685b7","resolution":{"observed_at":"2026-08-10T14:01:38.323235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.327180Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.327180Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:c304c4a76135337db609e2e03ac5ede1f6f31f095604d168cbc05e22a65e2e75","observation_id":"29bd8e27-f77a-46c2-ada7-0eabc64754b2","resolution":{"observed_at":"2026-08-10T14:01:38.327180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.150118Z","title":null,"venue":null,"work_id":"990667ef-6722-4c4e-9a85-1faccbbbc3cd","year":1954},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.332220Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:5084a44e67800b9c2a2f21411c406a06085a385f6d9052bd245f5498ff7b49dd","observation_id":"41902a2f-60c2-4372-a151-d94592f98453","resolution":{"observed_at":"2026-08-10T14:01:39.154693Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.136157Z","title":null,"venue":null,"work_id":"bff2fbe4-7aab-49e3-954f-fe866dd75b84","year":2011},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.336096Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:6a792099a7da33cb9f625acbc81b0d2decb8a1f39cf2792bc174c93a2a616a6e","observation_id":"fe477f8d-1652-4b84-b8a0-4b9fe62691c0","resolution":{"observed_at":"2026-08-10T14:01:39.141169Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.19523","last_updated":"2024-03-07T02:45:36Z","snapshot_observed_at":"2026-08-21T09:24:22.797910Z","submitted_at":"2023-05-31T03:18:03Z","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.19523","snapshot_observed_at":"2026-08-10T14:01:38.340174Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.340174Z"},"links":{"cited_paper":"/paper/2305.19523","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:3f793c4cd127e5a7756e81e174c196980447129c5b06e4d4841de128ec53c032","observation_id":"f43bdc88-10ea-4482-a11f-44d1cfa83412","resolution":{"observed_at":"2026-08-10T14:01:38.340174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.120746Z","title":null,"venue":null,"work_id":"94d39826-acc0-421d-a840-1f145e64274d","year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.344789Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:d3f0f1dbecc631b1e932bc49db2c6e90c4821a32466a093d8ec3386e2aa42e57","observation_id":"90c40a1b-d5fe-4bb6-afda-e72a1b733492","resolution":{"observed_at":"2026-08-10T14:01:39.124872Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13630","last_updated":"2025-01-20T15:12:02Z","snapshot_observed_at":"2026-08-16T14:16:40.841450Z","submitted_at":"2024-02-21T09:06:31Z","title":"UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13630","snapshot_observed_at":"2026-08-10T14:01:38.348716Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.348716Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:4b832c347f5b7fc6b1a47b86fe0d14099f324be9479accfee347b069211d840a","observation_id":"6ad8b10b-2b0e-4cc8-8d79-fe64f1e1c03c","resolution":{"observed_at":"2026-08-10T14:01:38.348716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.107627Z","title":null,"venue":null,"work_id":"039f8930-bab6-4d1b-88f4-29aed3436e94","year":2020},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.353333Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:a75af77f31909b17ad218c13c54febc83d8e55e46a600dfd557c19a1e74313fa","observation_id":"9924ca5b-2a70-46eb-96fd-cb96712653f6","resolution":{"observed_at":"2026-08-10T14:01:39.112158Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07074","last_updated":"2025-05-08T16:40:59Z","snapshot_observed_at":"2026-08-20T10:34:24.025992Z","submitted_at":"2024-10-09T17:19:12Z","title":"Let's Ask GNN: Empowering Large Language Model for Graph In-Context Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07074","snapshot_observed_at":"2026-08-10T14:01:38.357242Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.357242Z"},"links":{"cited_paper":"/paper/2410.07074","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:0e4f2dac876ab50fa21b02c06c87069f2a1e4a5650914c054b3c21f51e117da3","observation_id":"1e37aed3-6b49-4897-bfa5-478cb2003e0b","resolution":{"observed_at":"2026-08-10T14:01:38.357242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16595","last_updated":"2024-06-15T09:26:21Z","snapshot_observed_at":"2026-08-21T11:04:01.325650Z","submitted_at":"2023-09-28T16:58:37Z","title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16595","snapshot_observed_at":"2026-08-10T14:01:38.362345Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.362345Z"},"links":{"cited_paper":"/paper/2309.16595","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:6feb5adbc8c85b8283e2710f7eaa9fc76eed0419047e4a502de341fc031f7cdd","observation_id":"4c42616f-627c-4fe0-b820-22afc4d71b72","resolution":{"observed_at":"2026-08-10T14:01:38.362345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-10T14:01:38.367512Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.367512Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:990ec6bc21f8790548bbaf9e61094f5701b74e77c2fe87a6091b32c2a72d55ac","observation_id":"87735b33-46dc-44c5-b651-625b7ad69607","resolution":{"observed_at":"2026-08-10T14:01:38.367512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-14T21:29:27.927932Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-10T14:01:38.371542Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.371542Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:9c1648375292306df3528d914a218c0c906fb9336fcb71cb15da731568893877","observation_id":"23354456-214b-4641-af75-728680528246","resolution":{"observed_at":"2026-08-10T14:01:38.371542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.06180","last_updated":"2023-09-12T12:50:04Z","snapshot_observed_at":"2026-08-02T09:51:08.145755Z","submitted_at":"2023-09-12T12:50:04Z","title":"Efficient Memory Management for Large Language Model Serving with PagedAttention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.06180","snapshot_observed_at":"2026-08-10T14:01:38.375366Z","title":"Gonzalez, Hao Zhang, and Ion Stoica","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.375366Z"},"links":{"cited_paper":"/paper/2309.06180","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:edde1c862fa2f2573747d47130841212d8c9d3bb609a4df81611f66d6bf519c7","observation_id":"6dc0e8a8-b383-4aa8-9f20-15810a28efaa","resolution":{"observed_at":"2026-08-10T14:01:38.375366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.096083Z","title":null,"venue":null,"work_id":"587dfb72-6dd2-4262-9d1d-13d328110e5f","year":2021},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.379378Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:2e3951e9c2bec897e89594c0b8a851572dcc02ba0487e498292e51967ccaba14","observation_id":"c90f943f-39d4-4aae-8706-f57c038bec92","resolution":{"observed_at":"2026-08-10T14:01:39.099828Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03720","last_updated":"2024-02-06T05:29:05Z","snapshot_observed_at":"2026-08-16T14:21:08.685255Z","submitted_at":"2024-02-06T05:29:05Z","title":"Similarity-based Neighbor Selection for Graph LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03720","snapshot_observed_at":"2026-08-10T14:01:38.382837Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.382837Z"},"links":{"cited_paper":"/paper/2402.03720","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:c0190571703beaa79512ab84d58358ced54f7fc752811f8a2abfed6ccf828c7c","observation_id":"1a07c312-cd7e-4fea-bf31-45bc21bc3b10","resolution":{"observed_at":"2026-08-10T14:01:38.382837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.083842Z","title":null,"venue":null,"work_id":"d3d5c09b-ad9c-491c-b77d-6b8543d1da17","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.386920Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:959ea945fab40fd7227d8a9de0acda6ec20e9b6192516081bccc3e19ca99bf4a","observation_id":"4a716554-1d62-470d-9560-5a847fb4f34a","resolution":{"observed_at":"2026-08-10T14:01:39.087847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12950","last_updated":"2024-10-18T12:19:41Z","snapshot_observed_at":"2026-08-16T13:41:51.414646Z","submitted_at":"2024-06-18T12:54:47Z","title":"MolecularGPT: Open Large Language Model (LLM) for Few-Shot Molecular Property Prediction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12950","snapshot_observed_at":"2026-08-10T14:01:38.391047Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.391047Z"},"links":{"cited_paper":"/paper/2406.12950","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:063d486fec62232a9ec5eb97c7fc857c255f96913db37980995dc3f1172352c2","observation_id":"e04eeff8-7628-44a2-8eb9-7805a14bdd1c","resolution":{"observed_at":"2026-08-10T14:01:38.391047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.072161Z","title":null,"venue":null,"work_id":"63a73e84-6df4-4d19-9370-5f80b20c471e","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.395016Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:59c3d06c8118e6d44830333129390030d0cae9dd13da92b774b20027a2f26f1a","observation_id":"091adce0-f1aa-467c-b8b4-b87c27a857b6","resolution":{"observed_at":"2026-08-10T14:01:39.076007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.398999Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.398999Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:4f1ca04409eaa2944b5e59fe7275753ff5f2123930dac9a4a219c8877914270d","observation_id":"52985730-35dc-49d5-b8b5-0a6ef955631a","resolution":{"observed_at":"2026-08-10T14:01:38.398999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.046119Z","title":null,"venue":null,"work_id":"29cf1a79-85a6-4eff-983e-0b4574e25cbc","year":1999},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.403180Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:ba312d344471a5887a543785b1010dc82d350ec9f0bb4ef3c3441385e30332c4","observation_id":"16af32ff-fb98-4f7d-9dff-5258e5b015ee","resolution":{"observed_at":"2026-08-10T14:01:39.052232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-10T14:01:38.406826Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.406826Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:f3d939f3615d5a89c709ce878803062fdf6d89aa1a37d000e0e166faf476db56","observation_id":"35c5a9fd-ea6d-44c1-b52f-0c7fd12511a4","resolution":{"observed_at":"2026-08-10T14:01:38.406826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.032661Z","title":null,"venue":null,"work_id":"821afb6f-7f5d-4b03-9999-46e2f795fa47","year":2022},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.411205Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:af175c3eb06903b528efdecf1d4303c9e16e89b5ecba1deb1516b3d14b4f6e0c","observation_id":"7b54999e-6619-4692-becf-aba23eb6fb65","resolution":{"observed_at":"2026-08-10T14:01:39.037145Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.414693Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.414693Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:db6116091d705e79f87e8a679e09b7af432148b60fab45207ded1af15a79eafc","observation_id":"bb516fe1-a371-4386-b7be-66ebae81a051","resolution":{"observed_at":"2026-08-10T14:01:38.414693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-10T14:01:38.418528Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.418528Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:bd27575300575112dfd9e0bc13bb84b1662767b3e5e6ef42bb73139f87210841","observation_id":"67b5f4a3-cfa3-4413-b8c2-cc7081085222","resolution":{"observed_at":"2026-08-10T14:01:38.418528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:39.005360Z","title":null,"venue":null,"work_id":"330652df-f7dd-4d35-9f19-8bc9e495af8b","year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.422596Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:c592ddf0204b61b743d16c4fe965f3f18709413d5e29eeba36e0cc3f3a88da23","observation_id":"3435521f-c5eb-4530-b13b-a083bc3e386d","resolution":{"observed_at":"2026-08-10T14:01:39.009901Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19631","last_updated":"2024-08-13T19:34:13Z","snapshot_observed_at":"2026-08-16T14:05:25.334361Z","submitted_at":"2024-03-28T17:47:19Z","title":"Retrieval-enhanced Knowledge Editing in Language Models for Multi-Hop Question Answering","version":2},"cited_work":{"arxiv_id":"2403.19631","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.19631","snapshot_observed_at":"2026-08-10T14:01:38.585671Z","title":"Retrieval-enhanced Knowledge Editing in Language Models for Multi-Hop Question Answering","venue":"cs.CL","work_id":"d95b3d19-4f17-45be-bbe7-6d580fd7344c","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.426218Z"},"links":{"cited_paper":"/paper/2403.19631","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:e1ef671a1037d01092fae7036c73b68b7869edd55942c74a3730942938e13e38","observation_id":"1d54e7a8-93d6-4184-a4ed-d1e40d80ac84","resolution":{"observed_at":"2026-08-10T14:01:38.591995Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.991166Z","title":null,"venue":null,"work_id":"40c9c7c5-e5fa-4461-a045-aed8ab55b203","year":2012},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.430797Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:8809921d98d978d7937702264d02c4194cbc73e9c7537e2acb297e948c6ed5e0","observation_id":"f8b3edc2-346f-4496-8b72-a8bee3090e39","resolution":{"observed_at":"2026-08-10T14:01:38.995471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09376","last_updated":"2021-07-01T10:08:16Z","snapshot_observed_at":"2026-08-16T18:30:31.512980Z","submitted_at":"2021-04-19T15:08:06Z","title":"Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09376","snapshot_observed_at":"2026-08-10T14:01:38.434616Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.434616Z"},"links":{"cited_paper":"/paper/2104.09376","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:bfd2902bbb8e92ffb2830d67f141117d782167191bcfcbbe2c3a84a59fff7774","observation_id":"50b6a962-676a-4bac-9f65-59322e157719","resolution":{"observed_at":"2026-08-10T14:01:38.434616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.978387Z","title":null,"venue":null,"work_id":"84447f48-a9af-459c-bece-0a8aa3f3e5e1","year":2019},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.438788Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:d591ea0b9c796b52c37af79c8068b88b946f9587665f89eb673ccf19d2262a9c","observation_id":"f94d4a18-3395-4f4d-8e89-7f7403299fb6","resolution":{"observed_at":"2026-08-10T14:01:38.982623Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.965923Z","title":null,"venue":null,"work_id":"2525d79f-0c4f-4f74-9aa4-6f5c7e1d7aa1","year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.442529Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:aed574dfdd0dbd306378f23212a892fd950e1927c3eed8ed35649def7d1750fd","observation_id":"2de842d7-c30f-40e5-ae44-c2f2e47b03e6","resolution":{"observed_at":"2026-08-10T14:01:38.970313Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.13023","last_updated":"2024-05-07T10:10:14Z","snapshot_observed_at":"2026-08-16T14:50:49.761494Z","submitted_at":"2023-10-19T06:17:46Z","title":"GraphGPT: Graph Instruction Tuning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.13023","snapshot_observed_at":"2026-08-10T14:01:38.446044Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.446044Z"},"links":{"cited_paper":"/paper/2310.13023","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:66ced2fd252dbc114fbf2700e91a069dfc1ed9013a013b5d0f6c5bdef605ce94","observation_id":"304568a9-9b20-47cd-ab8f-23a7423dad63","resolution":{"observed_at":"2026-08-10T14:01:38.446044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.952146Z","title":null,"venue":null,"work_id":"68a16e7c-9a9a-4fcc-a141-d59a6a0c775c","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.449976Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:a62b4a939d83b52de2c2469bd6068557ffe5b36a6197d3b786370f28d42a38d4","observation_id":"85b8f6a9-9bef-41dc-b3d8-d39d3edcbd48","resolution":{"observed_at":"2026-08-10T14:01:38.956218Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.453497Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.453497Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:fa1129a889143bf5532caace74b33d88720ca6032f245e59606249906c81972c","observation_id":"ba1103d0-d095-494c-b574-2c8977b17449","resolution":{"observed_at":"2026-08-10T14:01:38.453497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.925147Z","title":null,"venue":null,"work_id":"a82ab4ed-87dc-4084-a77b-0592de179ee3","year":2022},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.457270Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:bff06405bc19db026c0579b28176c575d5a7812d4dc73aa94b034ccd2200e6fe","observation_id":"cfebddd2-2348-4dd4-9012-e581c5f1f0d6","resolution":{"observed_at":"2026-08-10T14:01:38.930678Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.461493Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.461493Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:eb9dd541d79a96bb9becec33e3d5040e033794d68d61d43b1ee7dcd78342693f","observation_id":"c9df5b45-45dc-4ae5-bf62-c301a23b1af2","resolution":{"observed_at":"2026-08-10T14:01:38.461493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08310","last_updated":"2024-06-14T15:36:00Z","snapshot_observed_at":"2026-08-18T09:26:24.435360Z","submitted_at":"2024-06-12T15:10:44Z","title":"GraphFM: A Comprehensive Benchmark for Graph Foundation Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.08310","snapshot_observed_at":"2026-08-10T14:01:38.465186Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.465186Z"},"links":{"cited_paper":"/paper/2406.08310","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:8b20ca7417ed6bbcdd0d5556c8e81d0aeac2b29abcdce097bacea4dc73ab794a","observation_id":"61fb6d5c-73bd-4ee4-8304-83391569d77e","resolution":{"observed_at":"2026-08-10T14:01:38.465186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.07134","last_updated":"2024-02-06T03:08:44Z","snapshot_observed_at":"2026-08-22T03:01:39.252745Z","submitted_at":"2023-08-14T13:41:09Z","title":"Language is All a Graph Needs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.07134","snapshot_observed_at":"2026-08-10T14:01:38.469157Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.469157Z"},"links":{"cited_paper":"/paper/2308.07134","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:8270ae27ec3c52dc105b97eee958e69d136bd101fde55bd7053d7e39fe04d074","observation_id":"f5efcfbf-398a-43af-b02d-a41b768549c8","resolution":{"observed_at":"2026-08-10T14:01:38.469157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.900387Z","title":null,"venue":null,"work_id":"6a7dfc27-51c7-4b3d-9f58-324d13b527ac","year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.472989Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:626b301d093418f3e9be1b0d4d9067fb8b6d17637f0e36cdbf71cfa85e07524f","observation_id":"9079f20b-239d-4919-9926-a4636ac7307d","resolution":{"observed_at":"2026-08-10T14:01:38.905035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01089","last_updated":"2023-10-02T11:03:57Z","snapshot_observed_at":"2026-08-16T14:55:55.136483Z","submitted_at":"2023-10-02T11:03:57Z","title":"GraphText: Graph Reasoning in Text Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01089","snapshot_observed_at":"2026-08-10T14:01:38.476605Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.476605Z"},"links":{"cited_paper":"/paper/2310.01089","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:198c1c46d8b15bc336c3e0c8a97b4f76e6358270b82aa78cd53faa71f5002533","observation_id":"26af7ce8-df20-47ef-a9b9-0f0c92e95486","resolution":{"observed_at":"2026-08-10T14:01:38.476605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:01:38.883736Z","title":null,"venue":null,"work_id":"230113f8-1b80-4d06-9564-a5a89bb3a100","year":2020},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.480706Z"},"links":{"citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:d6211abdf2e902df9d9fd483fa8827c2b4fc5240e777e02b491a6d422f961952","observation_id":"ff7f7b0a-4929-443c-b651-0d266095b3ad","resolution":{"observed_at":"2026-08-10T14:01:38.887908Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":56},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 4 inbound Pith citation observations for arXiv:2501.15755."}