{"as_of":"2026-08-08T06:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29204b9a8e2b78aed53643534f3da9fe7bd3ac6f084e8b6ff7d19ca26e557be0","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:24:06.224077Z","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-08T06:32:00.761636+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/2506.10014/citation-record","integrity":"/paper/2506.10014/integrity","json":"/paper/2506.10014/citation-record.json","paper":"/paper/2506.10014"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:11.473042Z","title":null,"venue":null,"work_id":"105506c0-f75f-4fbb-9c60-d8877839106e","year":2022},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:00.491700Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:19b8b9ba5746e2e2bb12efc718d30c6bfe117e587526506c63cb2667a4c233b9","observation_id":"f2f890b9-c546-492c-81da-f46cae850f0f","resolution":{"observed_at":"2026-08-07T13:24:11.649774Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:11.207295Z","title":null,"venue":null,"work_id":"cb869369-941c-4b19-b004-468ac58ea6e6","year":2016},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:00.544811Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:c7e405b41b66e519a9845a32c61463e68bc071b6e9c42dc4dcf9be82fa580b01","observation_id":"5d71646c-5b86-4970-86f1-4f75268335f9","resolution":{"observed_at":"2026-08-07T13:24:11.307509Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:11.004738Z","title":null,"venue":null,"work_id":"0aecba39-823b-4e64-a543-cdb663ac6425","year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:00.657240Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:75a2837f4dacb81a1181f976b277a06e95d0104c2ef36afd088ae5af4136886f","observation_id":"d94d6fa4-d782-4fe1-afac-cc905b7818a2","resolution":{"observed_at":"2026-08-07T13:24:11.100488Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16208","last_updated":"2024-12-19T02:47:14Z","snapshot_observed_at":"2026-07-06T16:53:22.999597Z","submitted_at":"2023-11-27T16:47:51Z","title":"InstructMol: Multi-Modal Integration for Building a Versatile and Reliable Molecular Assistant in Drug Discovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16208","snapshot_observed_at":"2026-08-07T13:24:00.754276Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:00.754276Z"},"links":{"cited_paper":"/paper/2311.16208","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:cd92780547b9f2d6f917dce05c4d371829b6aed10ccd75b195c248a7b0fe3e23","observation_id":"76bd8625-66fd-47c8-bca2-ba8f7419a5cf","resolution":{"observed_at":"2026-08-07T13:24:00.754276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04668","last_updated":"2024-02-24T06:44:45Z","snapshot_observed_at":"2026-07-06T16:29:03.404736Z","submitted_at":"2023-10-07T03:14:11Z","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04668","snapshot_observed_at":"2026-08-07T13:24:00.833391Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:00.833391Z"},"links":{"cited_paper":"/paper/2310.04668","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:c3b124f2982282295b0d95db6542dee3fde97bc966cd688966b33b818c613966","observation_id":"56f6f4b9-1007-490c-a2ab-033ea207690f","resolution":{"observed_at":"2026-08-07T13:24:00.833391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:10.801356Z","title":null,"venue":null,"work_id":"8c4a3e74-6cd9-461f-8069-b2fc212fd1ab","year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:00.938734Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:458eaf00b0e2770ce9a9700e91d7eba2bb79d5259a4c785f6e27cc8ae2dc1a8e","observation_id":"9b0c1b3b-009e-4d5b-9fd4-7564399b3af5","resolution":{"observed_at":"2026-08-07T13:24:10.891769Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","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-07T13:24:01.015582Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.015582Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:dae40451c873eb1ad8aafad50ca00f110a542a77191f6474eb92f032b41b2d84","observation_id":"4e62569a-4706-4251-88d5-7999d51cbd67","resolution":{"observed_at":"2026-08-07T13:24:01.015582Z","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-07T13:24:10.588182Z","title":null,"venue":null,"work_id":"75dd72a8-25ce-4538-a82a-638326806bab","year":1991},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.137358Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:6596f266fea81f1de6a80dfbfd173e21e1783371a14e7921578a4db3638948a7","observation_id":"719c67d0-5a02-42b8-aabf-8c82d27b61f5","resolution":{"observed_at":"2026-08-07T13:24:10.659517Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:01.256504Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.256504Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:55957882297a71378c68dc859a12927d2f90ae494acc33e05ae83f49bb71e183","observation_id":"73bc11b5-ba0c-416c-9443-aac1ce0ba715","resolution":{"observed_at":"2026-08-07T13:24:01.256504Z","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-07T13:24:01.366516Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.366516Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:b08d4834ea52acd4776a4a50d7d481ad63f35a013797674f75abdb898e6f897a","observation_id":"bfadef8c-93f8-4e11-8897-c1c7277d9d85","resolution":{"observed_at":"2026-08-07T13:24:01.366516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08018","last_updated":"2024-03-04T12:49:31Z","snapshot_observed_at":"2026-07-06T15:42:14.659345Z","submitted_at":"2023-06-13T14:35:34Z","title":"Mol-Instructions: A Large-Scale Biomolecular Instruction Dataset for Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.08018","snapshot_observed_at":"2026-08-07T13:24:01.428839Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.428839Z"},"links":{"cited_paper":"/paper/2306.08018","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:dc0276337078f5c42170ce3538b5c982dd02f759300472f9000ab859bd473311","observation_id":"dc963005-fa14-4105-b18e-40f95081e426","resolution":{"observed_at":"2026-08-07T13:24:01.428839Z","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-07T13:24:01.514497Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.514497Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:5e95b1dfafe294d3a0ac103323eb9674e620e50551cfaf6415546e97f7f3c305","observation_id":"774d6cc1-7054-40cb-9f36-3a05e9543f42","resolution":{"observed_at":"2026-08-07T13:24:01.514497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18365","last_updated":"2023-12-28T04:29:36Z","snapshot_observed_at":"2026-08-04T13:01:11.244779Z","submitted_at":"2023-05-27T14:17:33Z","title":"What can Large Language Models do in chemistry? A comprehensive benchmark on eight tasks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18365","snapshot_observed_at":"2026-08-07T13:24:01.598400Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.598400Z"},"links":{"cited_paper":"/paper/2305.18365","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:2321a9b6c1b601ff271e4e03014da28e12f23633d53a8bcd082071def632f94a","observation_id":"09365e61-30d5-4848-8b67-e85dec92e0f2","resolution":{"observed_at":"2026-08-07T13:24:01.598400Z","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-07T13:24:01.672324Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.672324Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:0b7a9bd22179b0f97857df28840dfa5965baeebe0dc848c34f64873df6019933","observation_id":"8660808e-21c3-4dcd-a66d-8e3e3782ad40","resolution":{"observed_at":"2026-08-07T13:24:01.672324Z","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-07T13:24:10.387274Z","title":null,"venue":null,"work_id":"486aa854-d417-4f59-b5f6-c70685023fad","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.769284Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:b8603d188a16140af52dedebbe271a98e1756bb9dc6ffca2ef8941c0622b8583","observation_id":"1c321613-e9f5-4722-8f44-5da915a71bda","resolution":{"observed_at":"2026-08-07T13:24:10.457262Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:10.221842Z","title":null,"venue":null,"work_id":"fb20f9e8-6133-4434-8483-55e9259eb483","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.984276Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:a98b9e77f0b601d6c9e83ee28c8fb63fc84bb088497995727e990fe502bfd965","observation_id":"ec0b80e0-c200-4d1c-a9d1-ce7e213cf2e3","resolution":{"observed_at":"2026-08-07T13:24:10.308472Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:02.184928Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.184928Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:7625f98b32a20e5c23ef00fbeea5eeb7c5d52a0949d3418dbfff6ac95722dbd0","observation_id":"ea5776a2-b06f-4b55-92d6-1dd584621693","resolution":{"observed_at":"2026-08-07T13:24:02.184928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-06T19:12:42.155813Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-08-07T13:24:02.297442Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.297442Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:7d64bdb0daea8d2c2bb27b49da1031fe6ff7b8f8151dfbe0b121909d15351933","observation_id":"c9b9c978-8514-4096-ba95-63c0e5da51c6","resolution":{"observed_at":"2026-08-07T13:24:02.297442Z","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-07T13:24:02.377844Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.377844Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:c046795172f5593027ff00c02a58fce83b171e9973a23742f3bfbaff94d3bbca","observation_id":"5dc55492-21ea-4123-9b00-5a7bb4f97dc9","resolution":{"observed_at":"2026-08-07T13:24:02.377844Z","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-07T13:24:09.770844Z","title":null,"venue":null,"work_id":"95f9f01c-35a0-4868-b73f-91aff7643a1f","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.456039Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:40076301c2d0dff0db1e545a0971635e230c4fde24719bbcfd04a09d55ce6724","observation_id":"385effe5-b02d-4039-860b-42347a202194","resolution":{"observed_at":"2026-08-07T13:24:09.870333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","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-07T13:24:02.614020Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.614020Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:49adfc9aff143ce3f2eff4eae576d92dd9a6cae3779eac5ede5c59a7f35c3041","observation_id":"047e2500-f3a7-4ac6-a667-c1a42d1c9a2d","resolution":{"observed_at":"2026-08-07T13:24:02.614020Z","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-06T06:17:37.090691Z","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-07T13:24:02.710257Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.710257Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:e6b3f493b0b7eb46abc82aaaa5f67dce57e2ac7ce15c847ea47bc4ff810a0303","observation_id":"ef9565d1-edd7-47ca-836e-22e2b7ed846b","resolution":{"observed_at":"2026-08-07T13:24:02.710257Z","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-07T13:24:09.575275Z","title":null,"venue":null,"work_id":"340eb061-9889-46df-b563-a3f5005733c2","year":2021},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.812732Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:ac9df32924917ea113a07e06a6b7a077c7fe71c434b8647b753106114e03800e","observation_id":"7a7223f4-e762-41e6-863d-d6651be6ac7f","resolution":{"observed_at":"2026-08-07T13:24:09.662682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:09.410215Z","title":null,"venue":null,"work_id":"3ae9c69a-9f60-4609-90eb-6ced91e38c4c","year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.911682Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:1cdc6034e5f2cf4789960bfefd86ed00ef5cb2c8c421805ce283704ded465152","observation_id":"55e34d30-7bfc-4e4e-b670-6fccd1493e52","resolution":{"observed_at":"2026-08-07T13:24:09.487905Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:03.000415Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.000415Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:bb366c0a83f0374e90d4f7217bba349e7e7f131aa42c87e197acb24229fbceb3","observation_id":"329d3012-f54f-45fa-87c8-49acbb31f6bd","resolution":{"observed_at":"2026-08-07T13:24:03.000415Z","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-07T13:24:09.296472Z","title":null,"venue":null,"work_id":"3dad8ba8-9a63-4152-9e9f-662e5f4d4883","year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.119503Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:79d3ab5333fe1d50b0f74effd6bcb992aa3de47528844042bbc95a25f8312860","observation_id":"f80d7f51-d86b-4659-9324-3c58f686acdd","resolution":{"observed_at":"2026-08-07T13:24:09.335577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12798","last_updated":"2024-01-18T09:03:24Z","snapshot_observed_at":"2026-07-06T16:35:40.224690Z","submitted_at":"2023-10-19T14:52:58Z","title":"MolCA: Molecular Graph-Language Modeling with Cross-Modal Projector and Uni-Modal Adapter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12798","snapshot_observed_at":"2026-08-07T13:24:03.192547Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.192547Z"},"links":{"cited_paper":"/paper/2310.12798","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:72f032fd1fa55f09f89579acf4c37f3133c8c979af0b3fdccdedc9fe58a54432","observation_id":"6104c280-def8-43a3-ab81-815b3ac61f27","resolution":{"observed_at":"2026-08-07T13:24:03.192547Z","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-07T13:24:09.174439Z","title":null,"venue":null,"work_id":"7aba86e2-796c-4c6b-b585-d0978e93a264","year":2019},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.320962Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:93c77b35a740d543c4a1f0a396fae4d8a696718188eab1bcc587a369f619c1ef","observation_id":"791c764e-ede8-49e3-8126-40d87fdc88bb","resolution":{"observed_at":"2026-08-07T13:24:09.223892Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:03.430157Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.430157Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:c4bde5f89daa27652c31289da57054eb75e44280311ac361cfae6833f1ffebd4","observation_id":"920db185-60d2-49fe-aa31-2f90d5f55007","resolution":{"observed_at":"2026-08-07T13:24:03.430157Z","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-07T13:24:09.050623Z","title":null,"venue":null,"work_id":"1e779294-e563-4aaf-91ef-f6d8bb45ba68","year":2000},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.548552Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:7e0bf91c245b26a99b9eb4f33942bae74c44885fe09d699c33168e5e015c6d1e","observation_id":"42552978-328a-4436-8e34-a0877ce37369","resolution":{"observed_at":"2026-08-07T13:24:09.096735Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:08.911519Z","title":null,"venue":null,"work_id":"750c17b0-00d3-40d8-8af2-be28fa912623","year":2024},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.651710Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:49387a05ee3e3c8f661f8710656c12bf2506a9e3a802db76252240422770d8e0","observation_id":"eb3ad263-2953-442c-b4ca-a4e2f9235740","resolution":{"observed_at":"2026-08-07T13:24:08.974675Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04407","last_updated":"2019-01-08T00:26:13Z","snapshot_observed_at":"2026-07-06T06:23:05.095698Z","submitted_at":"2018-02-13T00:29:11Z","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04407","snapshot_observed_at":"2026-08-07T13:24:03.731594Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.731594Z"},"links":{"cited_paper":"/paper/1802.04407","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:2c8a30d2261c1e980d60ac1bc8b723b1610f28ae01672106cb98546d5d88a993","observation_id":"0f049d65-413d-4fad-9a2f-0eb7c0d03e88","resolution":{"observed_at":"2026-08-07T13:24:03.731594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.07443","last_updated":"2023-07-14T16:06:42Z","snapshot_observed_at":"2026-07-06T15:54:05.111212Z","submitted_at":"2023-07-14T16:06:42Z","title":"Can Large Language Models Empower Molecular Property Prediction?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.07443","snapshot_observed_at":"2026-08-07T13:24:03.788529Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.788529Z"},"links":{"cited_paper":"/paper/2307.07443","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:4bd5f3ec1afa531001583e57fecdf82d7cb4d91648d466cc81270981455775d1","observation_id":"c82186c2-b469-46bf-86ef-f34c6ea8674c","resolution":{"observed_at":"2026-08-07T13:24:03.788529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","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-07T13:24:03.863578Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.863578Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:0b992a9bdf4e38abbbbbbbae21557dccd4d11696ec6f844c9769ebb88ee7e349","observation_id":"b0c23a4b-a232-463f-afb6-aa1e5cc71438","resolution":{"observed_at":"2026-08-07T13:24:03.863578Z","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-07T13:24:08.775659Z","title":null,"venue":null,"work_id":"cebbcc08-a2b4-4ecc-bd2f-779aa033481d","year":2008},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.917972Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:d2e89476e4a9191827ec940621c98fb88749a49888387df8fac9fc7cde951e40","observation_id":"61b93108-52f0-4770-b920-b861c184d422","resolution":{"observed_at":"2026-08-07T13:24:08.841460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.13590","last_updated":"2023-10-20T15:33:23Z","snapshot_observed_at":"2026-08-06T12:02:57.981758Z","submitted_at":"2023-10-20T15:33:23Z","title":"ReLM: Leveraging Language Models for Enhanced Chemical Reaction Prediction","version":1},"cited_work":{"arxiv_id":"2310.13590","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.13590","snapshot_observed_at":"2026-08-07T13:24:06.531325Z","title":"ReLM: Leveraging Language Models for Enhanced Chemical Reaction Prediction","venue":"cs.LG","work_id":"869eadf6-8ada-438b-8ec8-e6ca9a030485","year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:03.977575Z"},"links":{"cited_paper":"/paper/2310.13590","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:4d17fb94dafbb8a3ca000b323339ec2dd33b244e856b5b4df570985ed7a60122","observation_id":"d32753f7-4905-4b13-a322-cd2ddf5826b6","resolution":{"observed_at":"2026-08-07T13:24:06.597669Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:08.626248Z","title":null,"venue":null,"work_id":"bd6af493-806c-4b0b-a284-638b07aac64e","year":2017},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:04.182273Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:491964b5948e7d14c4a2c0edc785ef16439f166e0240ca490f4aa89cb926e2d5","observation_id":"a2a48b11-522b-40fe-b112-6a9a4944d62c","resolution":{"observed_at":"2026-08-07T13:24:08.685369Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:04.497221Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:04.497221Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:ebd554843eb1adec70f07041df4071cba6993438433f767009fdbc2d0842640f","observation_id":"c8f6741c-7342-46f9-9791-f5afdadcf0b1","resolution":{"observed_at":"2026-08-07T13:24:04.497221Z","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-07T13:24:08.507748Z","title":null,"venue":null,"work_id":"57b3cbd4-8f06-4c69-b2ad-183420189d66","year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:04.621250Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:25fcb697d906e3e0e6f285c260d18b146e08aa28b1133f96789754922d8a7df1","observation_id":"af67a982-0c94-4c01-bca8-9d731c993d4a","resolution":{"observed_at":"2026-08-07T13:24:08.544104Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:04.720137Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:04.720137Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:046e951a0850f88b3053478778bc905ea451dc72802ab9ac0660237b18fac64a","observation_id":"7a2ae068-ea4b-49f9-baf1-b187929ee7de","resolution":{"observed_at":"2026-08-07T13:24:04.720137Z","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-07T13:24:08.345159Z","title":null,"venue":null,"work_id":"8ec52fe3-3f6b-4a48-9c5e-4c3c2150e966","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:04.803472Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:af5b4cc712ffcf1501a89053e3ec87947d5f48b12022c74b1e284db4eb7d4957","observation_id":"220926cb-bff7-486e-98b0-fe449c2a5054","resolution":{"observed_at":"2026-08-07T13:24:08.403551Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09085","last_updated":"2022-11-16T18:06:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-11-16T18:06:33Z","title":"Galactica: A Large Language Model for Science","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09085","snapshot_observed_at":"2026-08-07T13:24:04.990563Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:04.990563Z"},"links":{"cited_paper":"/paper/2211.09085","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:7bf487690f4fef86b7d94877716ccf0f95f9b1f8ee51361cec2e217df42d1207","observation_id":"b778b3e3-9759-411c-9332-c4f540da544d","resolution":{"observed_at":"2026-08-07T13:24:04.990563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T13:24:05.076607Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.076607Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:22867348299aa92572e8a11c36532a2d592446055270184178710498eab4bcaa","observation_id":"aaff81b1-b931-4196-9200-f043d2491260","resolution":{"observed_at":"2026-08-07T13:24:05.076607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-07T13:24:05.195869Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.195869Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:22ffb7feff6a46796cf2cfd43c2528a6c65d6e8bf4019ec9fcbefbb047f96621","observation_id":"dd0d26db-2f15-4eb9-9aaa-1f4e88614375","resolution":{"observed_at":"2026-08-07T13:24:05.195869Z","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-07T13:24:08.046526Z","title":null,"venue":null,"work_id":"1c9723f5-5765-4f9d-92d1-a8f8ace36450","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.301809Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:7a7b03e62b135615ab1b7c9b7724173b8e24010be8e2767a6951e8bdbfb437b9","observation_id":"c85f35f0-701c-4ff4-ac2f-27eeb2dc8d7a","resolution":{"observed_at":"2026-08-07T13:24:08.122542Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:07.747118Z","title":null,"venue":null,"work_id":"28d65a7f-5be6-4740-b15c-00ec90309674","year":2024},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.481532Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:dd2c3d78f3bf0bd3272accee293352b4207138f36c2705515bad6fd5b633dd07","observation_id":"970b1222-2bb9-4e34-af28-25e30e3d259c","resolution":{"observed_at":"2026-08-07T13:24:07.813127Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:07.556977Z","title":null,"venue":null,"work_id":"dd013b83-406d-49ca-bc5a-11eea3d535b6","year":2022},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.540443Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:addbd190af87957e244f2cdc3f205a3607328c3c67d4166c8319f31874f4433e","observation_id":"27091a8a-cd00-4cf8-b2a9-a78b83e9360f","resolution":{"observed_at":"2026-08-07T13:24:07.629019Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.07134","last_updated":"2024-02-06T03:08:44Z","snapshot_observed_at":"2026-07-06T16:05:58.986548Z","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-07T13:24:05.626632Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.626632Z"},"links":{"cited_paper":"/paper/2308.07134","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:12c02f46e0f6aa0353dcfc3bc23969243d9b693c61ffe1c8112e359f0c6d6cc9","observation_id":"c1b7ae42-d5f1-4534-ab8a-f831242428d7","resolution":{"observed_at":"2026-08-07T13:24:05.626632Z","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-07T13:24:05.736554Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.736554Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:36d5b3e4c61baf38a4eda545c95f78c6048b6dbabb3632cd2d04b509b5c8018d","observation_id":"dbb2b04b-7e10-4297-bd00-9244aca474d2","resolution":{"observed_at":"2026-08-07T13:24:05.736554Z","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-07T13:24:07.891088Z","title":"InProceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining","venue":null,"work_id":"2b520e8d-4cfb-47c8-9cbb-87482356b7b1","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.387760Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:24b01f1f55b19ee6b9e16984586590b7d71ca42a27c927e0968dea5f142ac673","observation_id":"7a6ea7b4-5bd4-4664-b620-6ff08c421161","resolution":{"observed_at":"2026-08-07T13:24:07.969661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:07.322794Z","title":null,"venue":null,"work_id":"eeb6c3f3-aaa7-4684-a2a4-bc8192661822","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.906041Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:b8b8812bca903cc175d520f2c701f60c163a2147f1b0c89ac9b3292f2907ba1c","observation_id":"4317a614-f9b5-4002-a343-9ec9939423d4","resolution":{"observed_at":"2026-08-07T13:24:07.423461Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:24:07.127248Z","title":"Limitations","venue":null,"work_id":"de7b7a62-45cc-4fc7-9585-6918d13ff44a","year":2021},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:06.067868Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:c73b43c8fb251585241415d7def11e0887c08b175335d14f2c43828ef47b7f89","observation_id":"6f66f109-fe7a-40a2-89ba-13b0bb943336","resolution":{"observed_at":"2026-08-07T13:24:07.216157Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.08727","last_updated":"2022-03-23T16:28:06Z","snapshot_observed_at":"2026-08-07T19:44:54.510176Z","submitted_at":"2021-10-17T05:16:58Z","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.08727","snapshot_observed_at":"2026-08-07T13:24:05.819419Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.819419Z"},"links":{"cited_paper":"/paper/2110.08727","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:8e9046f5db763215a82225d1fc5c42aafcaaf7e6e664d9eece47b4a9e1df4f6a","observation_id":"ae69812d-78a5-486e-bdd2-2e94cd313863","resolution":{"observed_at":"2026-08-07T13:24:05.819419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14709","last_updated":"2023-03-01T14:09:04Z","snapshot_observed_at":"2026-07-06T14:10:40.245457Z","submitted_at":"2022-10-26T13:40:57Z","title":"Learning on Large-scale Text-attributed Graphs via Variational Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.14709","snapshot_observed_at":"2026-08-07T13:24:05.968349Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:05.968349Z"},"links":{"cited_paper":"/paper/2210.14709","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:26ca24badf200313d4ba701c8e534785edf992856374dfa7f4b87f236458bf34","observation_id":"9717c3c9-dc9c-42b3-972e-e1132e5b5748","resolution":{"observed_at":"2026-08-07T13:24:05.968349Z","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-07T13:24:06.167019Z","title":"Guidelines: • The answer NA means that the paper does not involve crowdsourcing nor research with human subjects","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:06.167019Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:c7b45ab08a812d3599dcbfed4832a3e7a3dcefb3ef01f681439b25a4f3b4dea7","observation_id":"e9452e15-ec80-4285-9319-154d0c35b0c6","resolution":{"observed_at":"2026-08-07T13:24:06.167019Z","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-07T13:24:06.908379Z","title":"Yes, these two nodes should be connected","venue":null,"work_id":"f4a17809-2f95-44f5-a2e5-461583de70c2","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:06.224077Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:66ac7f60f7b0f57a0de405c52ec95726eee25a7b630094e1bffabbcba1eaeec1","observation_id":"8c2e79b2-8101-42eb-8506-c0c93e691faf","resolution":{"observed_at":"2026-08-07T13:24:06.999321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10141","last_updated":"2020-06-17T20:30:04Z","snapshot_observed_at":"2026-07-06T09:30:11.360338Z","submitted_at":"2020-06-17T20:30:04Z","title":"Self-supervised Learning on Graphs: Deep Insights and New Direction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10141","snapshot_observed_at":"2026-08-07T13:24:02.550525Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.550525Z"},"links":{"cited_paper":"/paper/2006.10141","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:cf38d7b057447aaf1b786bdf794b87cdf975e1ce8dd8b23e094c7dcb026caa08","observation_id":"598bb8f4-bb8a-4ea7-9dbe-b2b5e3bf6510","resolution":{"observed_at":"2026-08-07T13:24:02.550525Z","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-07T13:24:10.013519Z","title":"InProceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining","venue":null,"work_id":"6c5f71be-54ed-488c-b73c-4b3c70336866","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:02.105763Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:605350141bdda6d4b48a65a1eb9e46dbdc51e24b1f68abc61b20aa0de3814531","observation_id":"46249a57-2e31-4d92-86eb-9c4b75e879bb","resolution":{"observed_at":"2026-08-07T13:24:10.108378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.19523","last_updated":"2024-03-07T02:45:36Z","snapshot_observed_at":"2026-07-06T15:35:45.200564Z","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-07T13:24:01.894902Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.894902Z"},"links":{"cited_paper":"/paper/2305.19523","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:3acdd1ae1fac9f75f7215904e082eaad6f3ec4933144396d5c4a01b5a8c28aab","observation_id":"8afcf1d6-3839-4847-98af-b4d4b8e4e48f","resolution":{"observed_at":"2026-08-07T13:24:01.894902Z","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-07T13:24:08.203604Z","title":"InProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval","venue":null,"work_id":"5f7d6dc0-881b-4f5a-a213-a8ac7612b591","year":null},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:04.904330Z"},"links":{"citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:adf6107a9f92a1734051b9047af00dd2924a5eadef25db9caa56b5bd0e559cc5","observation_id":"96cd114c-351a-420b-9aeb-e115c50fa43e","resolution":{"observed_at":"2026-08-07T13:24:08.275056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T13:16:16.161027Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":1,"verified_fuzzy":4},"total_outbound_references":60},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2506.10014."}