{"as_of":"2026-08-07T08:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b09be99b425635fc0c4b17033bbc3979ccd9332b7771e1156344f9155541451b","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T10:41:37.290485Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.11562/citation-record","integrity":"/paper/2606.11562/integrity","json":"/paper/2606.11562/citation-record.json","paper":"/paper/2606.11562"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T10:41:37.290485Z","title":"Claude Opus 4.7 System Card.https://www.anthropic.com/ claude-opus-4-7-system-card, April 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:323469423b3bbd8482423d882315a8d50b5ed80496313ee7a35156c319717b2e","observation_id":"c9e255b7-814f-40fe-8176-fb2871589d99","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Kqa pro: A dataset with explicit compositional programs for complex question answering over knowledge base","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:539c3ec8aa033f81fd81a188df7fde54accbf93c7d8e8189a3e5f0bbc57863ab","observation_id":"d6ce2975-46b1-404b-bbae-255acfbd5b87","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Graphwiz: An instruction-following lan- guage model for graph computational problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:4a069e25ef9267a268b8a027742b9e70ba512adb7517e33b9185af14e32db04d","observation_id":"e8dac181-3363-4282-92f4-1d2edf4c2043","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"LLaGA: Large language and graph assistant","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:7ea8f4435ff9c4b8902b85ad6412cc94b46e1b1e9318e676d6c3cbc4b377deb3","observation_id":"b55ed846-f32c-4c79-9250-cf26f0cf5278","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Exploring the potential of large language models (llms) in learning on graphs.ACM SIGKDD Explorations Newsletter, 25(2):42–61, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:1ba4a5478151fc87f1a5ceab3f35c268b4a8fa911fa436abccf82afcc5981765","observation_id":"5e8b1664-2223-4fa0-b4df-616c2bf3f1c2","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:ffc4f5717a0d6b4d2eca150126d7dc69b0809c74ff3f7ac993d346c67790e1ca","observation_id":"0d8281fb-4af9-4522-acc0-4553328366a2","resolution":{"observed_at":"2026-07-03T08:57:47.497699Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-27T10:41:37.290485Z","title":"Beyond iid: three levels of generalization for question answering on knowledge bases","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:8b7d9a13dad03fd5a5d48550c189b8dc495f7b60f2d63c106202f16c4cc17f19","observation_id":"c7e99a90-0745-43b6-8f9f-d598dd8b1755","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-05T16:16:01.066507Z","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":"2305.15066","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.15066","snapshot_observed_at":"2026-07-03T11:08:03.251020Z","title":"Gpt4graph: Can large language models understand graph structured data ? an empirical evaluation and benchmarking","venue":null,"work_id":"691dcb18-802c-40f7-ad33-2d97b9dd428e","year":2023},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2305.15066","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:e5538bb8075e00c991cdf311f50d53fb9027200fd3abc22da7074e89b56a77e2","observation_id":"d4eb20d5-5ba5-4be6-8a34-05379075b824","resolution":{"observed_at":"2026-07-03T08:57:47.508254Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-27T10:41:37.290485Z","title":"G-retriever: Retrieval-augmented generation for textual graph un- derstanding and question answering.Advances in Neural Information Processing Systems, 37: 132876–132907, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:437a28711eed9bf5a98cdf395bfeddb5423980e08aa1f64c96e51ed21c872cc3","observation_id":"fb0930ac-fc0b-4840-832c-5a06f27a92e6","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Systematic integration of biomedical knowledge prioritizes drugs for repurposing.elife, 6:e26726, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:d1b40a9f86839a870b450b736c1545dfeb2a12e0f5b17c8ff3a967a4887e893c","observation_id":"8d8a89f0-1a7c-47ae-b3f1-8cd2726ff002","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:5c5b82e6ccfae0d3ee24a97bf74b8a27abb31551f924853f48e1fd27c403c098","observation_id":"3db14fed-e94e-422f-9827-c2e2b04825e2","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Graph chain-of-thought: Augmenting large language models by reasoning on graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:90936bff7a5cd70543148295c4e77c5ab3d0dc015c02959eedd8e338a6ef6ee9","observation_id":"6df2c43b-52ae-4885-97ba-0062996fb86e","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.09709","last_updated":"2025-04-24T19:16:02Z","snapshot_observed_at":"2026-07-06T18:45:43.829010Z","submitted_at":"2024-07-12T22:23:51Z","title":"GOFA: A Generative One-For-All Model for Joint Graph Language Modeling","version":2},"cited_work":{"arxiv_id":"2407.09709","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.09709","snapshot_observed_at":"2026-07-03T08:57:47.509021Z","title":"Gofa: A generative one-for-all model for joint graph language modeling","venue":null,"work_id":"735e6399-48ff-4f45-a78a-44e106c79457","year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2407.09709","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:211873db4c3121b181534faf1aee562e83291705443312a3a86923e50c771f6c","observation_id":"1dbdb616-6e3b-4225-87b8-24377e42818e","resolution":{"observed_at":"2026-07-03T08:57:47.510589Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-27T10:41:37.290485Z","title":"Graphs over time: densification laws, shrinking diameters and possible explanations","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:1abb9448b86cc595ccdb43907d663014ff507fa89920b61626ed38b4beb6dbcc","observation_id":"f2998c05-c67d-4546-a906-dd9db8276459","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Glbench: A comprehensive benchmark for graph with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:37df289cb71e65d108d895dedb0f81b5b20fbb9ad0a99c08dadccdabb24ca394","observation_id":"4655d458-98a3-4bd8-83c2-027f43fe8843","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Awq: Activation-aware weight quanti- zation for on-device llm compression and acceleration.Proceedings of machine learning and systems, 6:87–100, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:e1095b6587f38fad3769ef67eac1fd9426c42336697bd48fc96440a904c03c2e","observation_id":"8044c7d7-f307-4af3-b2a6-a2a6817e6810","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00149","last_updated":"2024-07-12T23:01:32Z","snapshot_observed_at":"2026-07-06T16:25:46.699214Z","submitted_at":"2023-09-29T21:15:26Z","title":"One for All: Towards Training One Graph Model for All Classification Tasks","version":3},"cited_work":{"arxiv_id":"2310.00149","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00149","snapshot_observed_at":"2026-07-03T20:08:56.258128Z","title":"One for all: Towards training one graph model for all classifi- cation tasks","venue":null,"work_id":"34b1ef59-3652-420a-aa23-7b03bc35b175","year":2023},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2310.00149","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:0b4aac3fa77de7c21b28515b4e93a00b6abd26981087502f879c7b8a6d3b26da","observation_id":"8fd29ed7-3384-4ece-bbff-5e7a224758a9","resolution":{"observed_at":"2026-07-03T08:57:47.494566Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2403.04483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T08:57:47.499135Z","title":"Graphinstruct: Empowering large language models with graph understanding and reasoning capability","venue":null,"work_id":"16c498e9-17fe-4051-b30f-49dc59c5eb34","year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:e62b56eda17053c187a7c34402815be92da0cf87f64b4e3c424066cbd576a041","observation_id":"559b2bd7-13d7-4769-bcfd-682d1047c0e8","resolution":{"observed_at":"2026-07-03T08:57:47.500732Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:4b6f68342b9c144aa53f3d797cc002fd018ba7376b449cb339bf6b7be5cf7767","observation_id":"9e25fed0-a343-46d9-85ad-31304c60c26e","resolution":{"observed_at":"2026-07-03T08:57:47.513194Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-27T10:41:37.290485Z","title":"Financial fraud detection using graph neural networks: A systematic review.Expert Systems with Applications, 240:122156, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:c8b4e68d16d5a1f30e800b3ea1ad34e7411dbcdad1ed9483b93a22c9b836c049","observation_id":"faa35d5a-f0be-4465-914c-a2250196fd01","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Communities, modules and large-scale structure in networks.Nature physics, 8(1):25–31, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:471736975199368e77de7494d2275fad5ae1a642a7c342a6261cfbf037d29fc3","observation_id":"e369583a-ed16-4685-96e2-030af7519b6c","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.03267","last_updated":"2026-05-01T23:55:43Z","snapshot_observed_at":"2026-08-02T10:52:10.211700Z","submitted_at":"2025-12-19T07:05:38Z","title":"OpenAI GPT-5 System Card","version":2},"cited_work":{"arxiv_id":"2601.03267","doi":"10.48550/arxiv.2601.03267","metadata_source":"pith","pith_arxiv_id":"2601.03267","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"OpenAI GPT-5 System Card","venue":"cs.CL","work_id":"ca87689a-0d29-4476-b504-b65dbbb08af4","year":2025},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2601.03267","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:0f8d81f4eaef95fc7a637248cf9a038f6617dc20aea823314bd606a89fe0952a","observation_id":"252b0b4a-1e68-4ab5-97db-eaf8c7e26554","resolution":{"observed_at":"2026-07-03T08:57:47.496946Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-03T00:38:11.458508+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T00:38:11.458508+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05862","last_updated":"2024-02-08T17:51:44Z","snapshot_observed_at":"2026-08-04T14:08:07.809870Z","submitted_at":"2024-02-08T17:51:44Z","title":"Let Your Graph Do the Talking: Encoding Structured Data for LLMs","version":1},"cited_work":{"arxiv_id":"2402.05862","doi":"10.48550/arxiv.2402.05862","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05862","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Let your graph do the talking: Encoding structured data for llms","venue":"arXiv (Cornell University)","work_id":"caab6f3f-40e1-4a3f-bf04-2d69881a13b1","year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2402.05862","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:b1743d93fc42ba2d2d566a08efebcb501fc34d5ead4aa089b9c388c178dd8444","observation_id":"08b64dd0-fda8-4b0c-8142-1d8152614c75","resolution":{"observed_at":"2026-07-03T08:57:47.504673Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-04T01:08:25.341474+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-04T01:08:25.341474+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-27T10:41:37.290485Z","title":"Collective classification in network data.AI magazine, 29(3):93–93, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:6c8588f1062eebad78400d1e60cf1236a385a00a77befbeaef43c90ed4e08c9d","observation_id":"75e53f98-3452-4c71-b055-fc3e6b06ad23","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Stack Exchange Data Dump","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:1f2f058f51baf1c9fbc396766a9c1153ca68e9d1c00af5ff885887d694fd65bb","observation_id":"dd67727e-4dd6-4039-bcbb-4a1daa4f2722","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"The web as a knowledge-base for answering complex ques- tions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:afb5d13e0c2c7084b9a006f990e2493e74c876a87a8c3e835e007e850712bc91","observation_id":"7a92bede-9450-45e2-9190-594f01fb0fe4","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Graphgpt: Graph instruction tuning for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:450e597a4001872692b8a38df492afb16b17f2ce178ffe578d8602ee611ef8b0","observation_id":"6710964e-a4b2-4b8f-8fb7-421068461315","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00379","last_updated":"2025-02-15T09:39:28Z","snapshot_observed_at":"2026-07-06T18:38:54.776114Z","submitted_at":"2024-06-29T09:19:23Z","title":"GraphArena: Evaluating and Exploring Large Language Models on Graph Computation","version":2},"cited_work":{"arxiv_id":"2407.00379","doi":"10.48550/arxiv.2407.00379","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00379","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Grapharena: Evaluating and exploring large language models on graph computation","venue":"arXiv (Cornell University)","work_id":"807f580a-7d28-4247-9c92-118b4ae51ff2","year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2407.00379","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:feb1131623a09f18da418150d128c0eede8f4a0c769803206ce014a082d78090","observation_id":"ba046efd-e8b0-4b5a-a04f-756e4838d77b","resolution":{"observed_at":"2026-07-03T08:57:47.483658Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-27T10:41:37.290485Z","title":"Llms as zero-shot graph learners: Alignment of gnn representations with llm token embeddings.Advances in neural information processing systems, 37:5950–5973, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:8737181e0acc7f23236a391aea0368ad6ebe658904c7e18a7b994a6e98693ff3","observation_id":"c3af3365-8806-48c6-8dba-867be9b6079c","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Can language models solve graph problems in natural language?Advances in Neural Information Processing Systems, 36:30840–30861, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:321e735113f608c48b544552a178a6c55d01bd0797e385edf92459e9b81549a9","observation_id":"b24e8f81-124c-4923-88bd-35af523f7e62","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Stark: Benchmarking llm retrieval on textual and relational knowledge bases.Advances in Neural Information Process- ing Systems, 37:127129–127153, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:71a89463d85702c0b4842dd4fdfdb7f6c413e2df005655ff7451a022dd61358e","observation_id":"8340b1e9-2666-4519-a99a-6f1b1f375091","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Graph neural networks in recom- mender systems: a survey.ACM computing surveys, 55(5):1–37, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:6c1becaf5924fed10327e0b10f33037a3c69a2bdc0074c823ceee7f2def2a88c","observation_id":"f208117c-e5f9-4164-afc4-75d7349930f3","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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":"2506.05690","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T10:27:02.477652Z","title":"When to use graphs in rag: A comprehensive analysis for graph retrieval-augmented generation","venue":null,"work_id":"7b5d7d43-c8a5-4652-a329-19003e2fc5e6","year":2025},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:495d48300e48e89ce9797e1ca218f1dae069858ea25eec97de68e127166a26ee","observation_id":"e385becb-b3a8-4c08-ae7a-d76a11bdbee8","resolution":{"observed_at":"2026-07-03T08:57:47.499854Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02404","last_updated":"2025-06-20T02:42:32Z","snapshot_observed_at":"2026-07-06T21:35:32.115224Z","submitted_at":"2025-06-03T03:44:26Z","title":"GraphRAG-Bench: Challenging Domain-Specific Reasoning for Evaluating Graph Retrieval-Augmented Generation","version":3},"cited_work":{"arxiv_id":"2506.02404","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.02404","snapshot_observed_at":"2026-07-03T08:57:47.484346Z","title":"Graphrag-bench: Challenging domain-specific reasoning for evaluating graph retrieval-augmented generation","venue":null,"work_id":"a202132b-db72-445f-8933-c99496a6c8e7","year":2025},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2506.02404","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:effe72797041955b6b82b592fbe1817aed1641ac88bbf526a4bacb1473bd2cb7","observation_id":"365d7ee3-58dc-48e4-a582-9e5f09619bf3","resolution":{"observed_at":"2026-07-03T08:57:47.485990Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-27T10:41:37.290485Z","title":"Crag-comprehensive rag benchmark.Ad- vances in Neural Information Processing Systems, 37:10470–10490, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:f6fffcf5aac0561145042f1b1c91812d00231d5ff046ba548085436b518aca4a","observation_id":"9bb5fe75-cdd4-4949-a5f4-1d596ddc15ba","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Language is all a graph needs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:0ee25b741c292b1a7225be49cd681ab622ad3f9d72e09e50f52f2fe22722100e","observation_id":"0d6cec9b-1f1c-40b1-b303-645cb5b43813","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"The value of semantic parse labeling for knowledge base question answering","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:921af607943a0cd196079724435cfd8825eaa3eb845553579227ee5e4b0be711","observation_id":"2388130e-f3ed-410a-a4b5-c8d15ecef603","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Gracore: Benchmarking graph comprehension and complex reasoning in large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:7070aa0789d80f9db3388ef40b2c3c7784210f291efb194d8683827b2f2944d7","observation_id":"3aac835e-a9ad-4cac-8a94-3855b0bc4941","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","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-06-27T10:41:37.290485Z","title":"Variational rea- soning for question answering with knowledge graph","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:73085592e864d26166a3bb14f64d81da342922e4efde34853e8bd4cf9c7cb3c1","observation_id":"b058b9f2-7e87-4c41-8189-349850519cd7","resolution":{"observed_at":"2026-06-27T10:41:37.290485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.09010","last_updated":"2021-12-01T20:29:42Z","snapshot_observed_at":"2026-08-06T13:05:51.883274Z","submitted_at":"2018-03-23T23:22:18Z","title":"Datasheets for Datasets","version":8},"cited_work":{"arxiv_id":"1803.09010","doi":"10.48550/arxiv.1803.09010","metadata_source":"pith","pith_arxiv_id":"1803.09010","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Datasheets for Datasets","venue":"cs.DB","work_id":"77c32272-5673-41ae-803a-b72c02717c59","year":2018},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/1803.09010","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:a1dec19e3f5d181496470636803778559d3d702e948e4ab2738fdf7b2f979ee2","observation_id":"268c34a8-6b22-4e4a-a66e-a9ca753dca73","resolution":{"observed_at":"2026-07-03T08:57:47.507101Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-05-24T00:53:33.684958+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T00:53:33.684958+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":28,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":40},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2606.11562."}