{"as_of":"2026-08-15T19:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:deac5ed7914c10e34b963f39a8fb280f832349038908804ab0253b3339cd81da","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:43:43.491014Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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.21559/citation-record","integrity":"/paper/2506.21559/integrity","json":"/paper/2506.21559/citation-record.json","paper":"/paper/2506.21559"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:43:35.616876Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:35.616876Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:1506c5791ec92ac94c8c7221c7d7da143b903769095331489473bb530500a4f1","observation_id":"f0f618f5-d591-4208-9cc2-a82faff5f517","resolution":{"observed_at":"2026-08-07T04:43:35.616876Z","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-07T04:43:50.869733Z","title":null,"venue":null,"work_id":"be367287-1204-43c3-bd97-9634e9655f62","year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:37.724560Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:9ca5bd616592ffeeb6cda33bd742b8ebaea4b58caa4543c3b97b9176e0411152","observation_id":"9152a35e-8edc-4b17-8d4d-68c346621a31","resolution":{"observed_at":"2026-08-07T04:43:50.989148Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:37.902864Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:37.902864Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:4c30b59e5baa35d788040574916e2f26e3eb97fb849f0f9d34353a43472722f3","observation_id":"a78730b9-7427-459c-aaf1-2a9f20a65af6","resolution":{"observed_at":"2026-08-07T04:43:37.902864Z","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-07T04:43:38.064548Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:38.064548Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:f3afc867a6207c87d6f22ae41ff76932b78eb1835bd27383b51c876b72a87a84","observation_id":"a43c1330-4cb9-476a-9e67-6715203e4a93","resolution":{"observed_at":"2026-08-07T04:43:38.064548Z","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-07T04:43:50.447582Z","title":null,"venue":null,"work_id":"171ea314-f407-42b8-8eae-6882ad694524","year":2022},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:38.403545Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:0381e3d9d03f7dab5fed807fa8184ab5f8b173b503a339e5e2421d2ba937cf4e","observation_id":"819b56bb-15c4-487d-9f1b-4db3643a7e19","resolution":{"observed_at":"2026-08-07T04:43:50.683180Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:50.042661Z","title":null,"venue":null,"work_id":"24d46d30-5093-42af-b564-9c4deb859f94","year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:38.558453Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:b9b31dd309addff7b061e7de50d7edc2d2d082aeae6ded239efcb468fb4e9cd5","observation_id":"2463c04a-0cde-4c12-aef7-ad2576182066","resolution":{"observed_at":"2026-08-07T04:43:50.231796Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:38.767306Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:38.767306Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:6b97bd94ca0080f89cc3f0cc1e0a5e380ca9cc2d8e3f46fe22882aeac087c73b","observation_id":"ca5e64e0-d096-4119-8ca7-7b4da7dd7ae5","resolution":{"observed_at":"2026-08-07T04:43:38.767306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.19523","last_updated":"2024-03-07T02:45:36Z","snapshot_observed_at":"2026-08-14T09:16:02.849983Z","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-07T04:43:38.906340Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:38.906340Z"},"links":{"cited_paper":"/paper/2305.19523","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:a0e49411fafe095a3418b9da787fc0b2accae0639f1d81576413ae378098a1de","observation_id":"544151a5-9ae9-4d79-a199-c4645b966488","resolution":{"observed_at":"2026-08-07T04:43:38.906340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07630","last_updated":"2024-05-27T04:04:40Z","snapshot_observed_at":"2026-08-15T13:52:48.582261Z","submitted_at":"2024-02-12T13:13:04Z","title":"G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07630","snapshot_observed_at":"2026-08-07T04:43:39.104309Z","title":"Chawla, Thomas Laurent, Yann LeCun, Xavier Bresson, and Bryan Hooi","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:39.104309Z"},"links":{"cited_paper":"/paper/2402.07630","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:c167cb65e005c3156e1cd5969ce4ad40931aec967249d45c29cd12933323b524","observation_id":"f70311c3-6b49-4c68-aea2-0665555a946b","resolution":{"observed_at":"2026-08-07T04:43:39.104309Z","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-07T04:43:39.176656Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:39.176656Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:e7a62a0369f7009bf918d3f1cc1d5a9411ad16f37ef8d21c2613fa72db6cdc2d","observation_id":"b51625e5-4498-4cfd-b553-3766cafaf2b7","resolution":{"observed_at":"2026-08-07T04:43:39.176656Z","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-07T04:43:39.348593Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:39.348593Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:7decc65cb73ce149ddd7391f29174f7b7d20e14bfbd53505eed8ce6d2248d3c7","observation_id":"589006e0-d28f-4631-a98e-110f4fb8bd05","resolution":{"observed_at":"2026-08-07T04:43:39.348593Z","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-07T04:43:49.681547Z","title":null,"venue":null,"work_id":"49145afd-6050-4437-bb89-4e3afb626e64","year":2020},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:39.481492Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:0e971fc0e933c12a482fb767ce0928184f599618a52307e9dc1e45ae5cd43f2a","observation_id":"30106147-7bd8-4e6d-b4b0-28764dfe6644","resolution":{"observed_at":"2026-08-07T04:43:49.816503Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:49.313475Z","title":null,"venue":null,"work_id":"416c7f66-de41-430d-a941-4278d835a5a6","year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:39.618436Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:56b4ea85f9204732392a84926b4a77a4efbc2f390232569bc3172d51a4767b2a","observation_id":"d534fb02-614c-435a-8ebc-5c2e5d06907c","resolution":{"observed_at":"2026-08-07T04:43:49.509615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:39.786180Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:39.786180Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:f517b50c65b3dc0f018323e8449f77328272fd6f4f068806ecd4e465ef04ee16","observation_id":"0f3a4aa7-0ae5-45a9-af59-5b91ee157655","resolution":{"observed_at":"2026-08-07T04:43:39.786180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-13T11:38:10.906031Z","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-07T04:43:39.930843Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:39.930843Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:fd372008d2f996e51060ae40485f9eaed818ba85104f32224ceced9e7841bc91","observation_id":"78ec5c23-e010-4755-be95-c39fac462e8f","resolution":{"observed_at":"2026-08-07T04:43:39.930843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12399","last_updated":"2024-04-24T08:48:13Z","snapshot_observed_at":"2026-08-15T12:15:39.132643Z","submitted_at":"2023-11-21T07:22:48Z","title":"A Survey of Graph Meets Large Language Model: Progress and Future Directions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12399","snapshot_observed_at":"2026-08-07T04:43:40.113215Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.113215Z"},"links":{"cited_paper":"/paper/2311.12399","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:59532ab0c49936ba62ed93d7fd0a72bc40a0de4040ad72163a3e680bf00ac31c","observation_id":"faff4bd9-5e9c-42d1-9df2-0cd42564fd4c","resolution":{"observed_at":"2026-08-07T04:43:40.113215Z","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-07T04:43:48.934879Z","title":null,"venue":null,"work_id":"5b0fa62c-fca3-43cf-b051-c1ec1cff99ff","year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.257940Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:45e52d4a9362505528e837c44b3438f367a5bb7fb04867d854612d5857803d17","observation_id":"de650601-5033-4727-b521-aef36ff1a117","resolution":{"observed_at":"2026-08-07T04:43:49.133476Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:48.618843Z","title":null,"venue":null,"work_id":"b3cf1b52-99fe-4322-8de8-26e79e67811c","year":null},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.435420Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:5376aa28892837a7d04f2307950384a47f834b137614a51e1f67e17944a98fa0","observation_id":"67d0bea6-d7d0-437e-9806-d9ebb3800988","resolution":{"observed_at":"2026-08-07T04:43:48.782742Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00149","last_updated":"2024-07-12T23:01:32Z","snapshot_observed_at":"2026-08-14T03:13:16.635373Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00149","snapshot_observed_at":"2026-08-07T04:43:40.606673Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.606673Z"},"links":{"cited_paper":"/paper/2310.00149","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:2cda1fca7a487cceb05eaf75ecfce7f0a9eb287e9e6bc0e9184667a5acea3f75","observation_id":"7e4da553-463a-44eb-99d1-de1195529d05","resolution":{"observed_at":"2026-08-07T04:43:40.606673Z","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-07T04:43:47.817789Z","title":null,"venue":null,"work_id":"7dbd9034-0287-4a6f-a978-e52ce3cea65e","year":2022},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.694761Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:e092bcd3bfbdf89d8c78b4dcb318747f757f6e4850f9e927dfaa15106512c42d","observation_id":"9d7cfbbd-9b39-4b7b-8dcd-150b696c4b7d","resolution":{"observed_at":"2026-08-07T04:43:48.002907Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-08-14T09:51:00.864354Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-07T04:43:40.810245Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.810245Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:66cf53a272dc7183419f90daa5692fa11fde29ee7b6accac4badf55f01405e14","observation_id":"91e175a5-a57e-4241-897a-b80391cba1ba","resolution":{"observed_at":"2026-08-07T04:43:40.810245Z","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-07T04:43:40.887362Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.887362Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:eaef2aebb3a52a5d2cf305b2664e18aa9a36899db32f37abc78b59db1c58d633","observation_id":"5c98b2a6-7e14-4bc2-8368-08b217f1f4f3","resolution":{"observed_at":"2026-08-07T04:43:40.887362Z","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-07T04:43:47.542019Z","title":null,"venue":null,"work_id":"3d1a3d3e-27e0-4aff-a658-39b89d5247b1","year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.947072Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:63b272809ed9208eeb11c4c07ce140581d48235c2d81ed8b7375ad8b759c81ec","observation_id":"b247e469-41ce-4e53-819e-2bf2c1f512cc","resolution":{"observed_at":"2026-08-07T04:43:47.657207Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:41.092075Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.092075Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:6855b536b984f604cc8acd685fd4472856a74c715b3712909c2e2807454cef91","observation_id":"56724f23-d910-407c-9a2a-9d2166237183","resolution":{"observed_at":"2026-08-07T04:43:41.092075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-07T04:43:41.312613Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.312613Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:ef070072767d2de8b042cbba77948a00c0176fd86c85a41c0a68252b04e710fc","observation_id":"3bbc302b-76f8-4dbe-8751-42979973a4ef","resolution":{"observed_at":"2026-08-07T04:43:41.312613Z","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-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-07T04:43:41.401899Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.401899Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:7fe76c00918c9c2fc627aa05b313e976367ce1468e5218ba29c8fd444017e0b5","observation_id":"ff9c8ce1-6115-4183-bac4-c47c2c8962b3","resolution":{"observed_at":"2026-08-07T04:43:41.401899Z","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-07T04:43:41.537580Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.537580Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:49089f84c279c4219e8b9ee8936e3ed38b792106ac118a901fd3ac534e0e8f79","observation_id":"ccbfa7a2-92ef-4dc0-918f-bda121615bf7","resolution":{"observed_at":"2026-08-07T04:43:41.537580Z","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-07T04:43:47.213453Z","title":null,"venue":null,"work_id":"a3a020e0-ba94-4679-97b4-c2acc006401f","year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.642886Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:f87894ff192d57530aeb3b9abe1f1bc2721bf43b4db299483d28801fadd2ea6f","observation_id":"7a107acc-92a8-40f2-ba0d-837fbbc49e2d","resolution":{"observed_at":"2026-08-07T04:43:47.353815Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:46.917439Z","title":null,"venue":null,"work_id":"d502ad91-76a2-44b5-ac54-a7d560d3e0af","year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.770158Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:99d2259fe7bc735c5e036c607fb89e05f88a35fa8019dfd46e5939dfd7a48c05","observation_id":"913d6928-acb8-4a50-bd84-97b806220cc4","resolution":{"observed_at":"2026-08-07T04:43:47.060287Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.13023","last_updated":"2024-05-07T10:10:14Z","snapshot_observed_at":"2026-08-14T14:42:42.278268Z","submitted_at":"2023-10-19T06:17:46Z","title":"GraphGPT: Graph Instruction Tuning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.13023","snapshot_observed_at":"2026-08-07T04:43:41.874359Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.874359Z"},"links":{"cited_paper":"/paper/2310.13023","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:f26268cfa62e8708e49b6fc33ec613aaec3fea94836c335f4011c228e62368ce","observation_id":"a1eebefb-7fee-412b-b952-e6b8d0207a5b","resolution":{"observed_at":"2026-08-07T04:43:41.874359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16024","last_updated":"2024-05-19T02:28:56Z","snapshot_observed_at":"2026-08-13T04:10:42.264749Z","submitted_at":"2024-02-25T08:07:22Z","title":"HiGPT: Heterogeneous Graph Language Model","version":2},"cited_work":{"arxiv_id":"2402.16024","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.16024","snapshot_observed_at":"2026-08-07T04:43:43.847251Z","title":"HiGPT: Heterogeneous Graph Language Model","venue":"cs.CL","work_id":"9740eea8-6e45-4cd7-bfd2-3f6369dfd4b9","year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.983583Z"},"links":{"cited_paper":"/paper/2402.16024","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:d7b75c7cbf8d8f70a9103371f6514cdca20ea10e9f966bf5cf49c0c47d214808","observation_id":"201d5494-f21b-4a32-afe6-3fad14fd7b8e","resolution":{"observed_at":"2026-08-07T04:43:44.058280Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-07T04:43:42.096764Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.096764Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:13d374e96838f7d779b7b45b381d3c71405ba893995cbbb44f9e7feb6b13cba0","observation_id":"332799c1-785b-4d6e-abd2-f775d1e2ce2a","resolution":{"observed_at":"2026-08-07T04:43:42.096764Z","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-07T04:43:42.214396Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.214396Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:04e96a1a4902982f5ad2047c1dce7acdf87984149617901067c653d4f4966f27","observation_id":"2d412376-ebc9-42e6-9c9d-7ea722857006","resolution":{"observed_at":"2026-08-07T04:43:42.214396Z","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-07T04:43:46.488934Z","title":null,"venue":null,"work_id":"48be4558-3c4c-4a6e-8d5a-e0669de81a7a","year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.303595Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:fd6e961c8630e114bb721f984f0a05bba0cb7f5fce676d9baeff6546e97d9d46","observation_id":"02550e6b-e136-47f2-8cfb-aba431e4e36e","resolution":{"observed_at":"2026-08-07T04:43:46.721343Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:42.406002Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.406002Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:6ee348af09143eed17eda013dc22ac29fe3f0d29c0019fe0a8d0967ceb2b7a11","observation_id":"fa8243a0-9c7d-4f1e-bff2-6e3854282404","resolution":{"observed_at":"2026-08-07T04:43:42.406002Z","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-07T04:43:46.160607Z","title":null,"venue":null,"work_id":"728176d9-4c95-459f-b999-25acd3de0391","year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.538174Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:2d4648f8ddbe61d74e7e8915c191fbe90ed6ef989eedca60b2205e3cf3c33028","observation_id":"196b9314-1094-45c7-9ebf-22480ab77203","resolution":{"observed_at":"2026-08-07T04:43:46.319977Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:45.802789Z","title":null,"venue":null,"work_id":"f0428eb9-6cb6-495d-bebc-0262bafd4d02","year":2022},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.648643Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:c9c1eb8feb5b923f0dd6a0c529607a9ebd8ef8dba8facce79b6f340e81f1fe6f","observation_id":"0f500986-0fcc-42c2-9a54-3ff8530ad1c8","resolution":{"observed_at":"2026-08-07T04:43:45.936292Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:42.725123Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.725123Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:e03c438b061dd718d39f1606bb2c186ff58e5025490ee3fca8d4274a57d68bfe","observation_id":"c778454d-60b5-4fcd-925f-be8a5797bacb","resolution":{"observed_at":"2026-08-07T04:43:42.725123Z","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-07T04:43:45.082025Z","title":null,"venue":null,"work_id":"5a6de82f-f2cc-4fdb-b517-6b862570818c","year":2021},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.846767Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:fbaddcef6382f5ac64eaba6eedeaf3a50fee8465f5dbb8e3ae04c52c5a10efaf","observation_id":"f32fa696-9f9a-4a65-8f8c-0a18c5d6042a","resolution":{"observed_at":"2026-08-07T04:43:45.224320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:42.929453Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.929453Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:314b8a35ee8ec826faf9e79477b24c01d80831fe4f461201858fbf2c0e1c3771","observation_id":"2dd1d7c1-814c-4d19-af98-f38aabfc65e4","resolution":{"observed_at":"2026-08-07T04:43:42.929453Z","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-07T04:43:43.022689Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:43.022689Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:511f9049d4b44f4b4671f380eb5deaab2c6564a2c56651af8e9b8f17ec12b550","observation_id":"fb64d7e9-31d8-43d3-abc3-a89068444ee5","resolution":{"observed_at":"2026-08-07T04:43:43.022689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07197","last_updated":"2024-02-28T02:42:35Z","snapshot_observed_at":"2026-08-13T04:21:46.740448Z","submitted_at":"2024-02-11T13:24:13Z","title":"GraphTranslator: Aligning Graph Model to Large Language Model for Open-ended Tasks","version":4},"cited_work":{"arxiv_id":"2402.07197","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.07197","snapshot_observed_at":"2026-08-07T04:43:43.618210Z","title":"GraphTranslator: Aligning Graph Model to Large Language Model for Open-ended Tasks","venue":"cs.AI","work_id":"ff2ed87e-b092-46d5-b55c-96c058fe98fb","year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:43.271115Z"},"links":{"cited_paper":"/paper/2402.07197","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:ce15dce6a114e11497dbfabd21e3a736877be5ff484d9c953559637f7f1e5409","observation_id":"92612762-e772-482b-8b33-dfb5d272b7f7","resolution":{"observed_at":"2026-08-07T04:43:43.727962Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:44.681946Z","title":null,"venue":null,"work_id":"38b0a3c1-150f-4a9f-9038-96abd65ed4a1","year":2024},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:43.392613Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:b1f2c099c64b2e27a58944855f18b31fb974efe30d0deda4825dcea96b5272ea","observation_id":"de7a61c2-48aa-4764-bf2f-43037c1805dd","resolution":{"observed_at":"2026-08-07T04:43:44.848314Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:44.371917Z","title":"all-MiniLM-L6-v2","venue":null,"work_id":"39a1d05e-4aca-4104-ab0a-d9801cb83c79","year":2021},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:43.491014Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:4e6b599c00d96b9b6edb5e7787fce4fc87570be6934feec6040e4ee04b7c24cf","observation_id":"860d1320-e68d-46e6-b08f-6a8c36163667","resolution":{"observed_at":"2026-08-07T04:43:44.465920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:41.217932Z","title":"Information Retrieval3 (2000), 127–163","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:41.217932Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:64defd225ee135cb3b906e44bd410ca594d36754f9ae20cc17770619a209c54e","observation_id":"5d7fb1b9-55d7-4252-addf-c8680e561520","resolution":{"observed_at":"2026-08-07T04:43:41.217932Z","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-07T04:43:43.122864Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:43.122864Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:38b4c0be174ba19a6f7af9e2b0aa8ce8109cbb3de96d4cb3a1f153458cc13f6c","observation_id":"502657f8-00de-4f66-a2f9-41f13ae9bcd2","resolution":{"observed_at":"2026-08-07T04:43:43.122864Z","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-07T04:43:48.193037Z","title":null,"venue":null,"work_id":"bffcb695-83bd-4f3b-af41-a0e5f140c428","year":2022},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.528405Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:f3fc6b5b652e4d6b2dac71971d1211bcbc80b7694de59656cd81c9dfdf67fd04","observation_id":"fed7087a-a720-4e04-8f85-2dd82f6487aa","resolution":{"observed_at":"2026-08-07T04:43:48.403038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T04:43:45.432039Z","title":"InProceedings of the ACM Web Conference 2023","venue":null,"work_id":"d4c19353-e4b7-413a-abdb-1e934756e86f","year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:42.783802Z"},"links":{"citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:2705706e7fab346eece50bbcbe76907004416c13e65ff5b63161a7e51048e0fd","observation_id":"826bcd51-276a-4212-8d73-07d2a05c8df0","resolution":{"observed_at":"2026-08-07T04:43:45.591179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T12:31:07.799574Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":2,"verified_fuzzy":2},"total_outbound_references":48},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2506.21559."}