{"as_of":"2026-08-10T07:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5908c752fc3a93610429e1aee78ba6312544f8a064421768c42e5569ecc42567","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T18:45:01.748067Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2512.08964/citation-record","integrity":"/paper/2512.08964/integrity","json":"/paper/2512.08964/citation-record.json","paper":"/paper/2512.08964"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adversarial attack and defense on graph data: A survey","venue":null,"work_id":"317e30e6-8205-4b88-a368-f07fbf48d570","year":2022},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:e90bbc12e32c38bec12734790256a4a843df0feebd2b2e1de33c8819c1f082e7","observation_id":"4335c0bc-6ff5-4d26-a8c0-a887d0efa8d5","resolution":{"observed_at":"2026-05-21T18:45:28.969498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Adversarial attack on graph structured data","venue":null,"work_id":"98cea4c7-700c-43ed-8960-880d5e2176db","year":2018},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:0b17da08ca8f81fc049f96c8486a9050788e8b056b811e389783ed4e2366c142","observation_id":"ca0a2c96-23d2-42fb-847a-98c654d16993","resolution":{"observed_at":"2026-05-21T18:45:28.972018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.08412","last_updated":"2024-01-28T20:16:00Z","snapshot_observed_at":"2026-08-10T01:41:31.475257Z","submitted_at":"2019-02-22T09:20:05Z","title":"Adversarial Attacks on Graph Neural Networks via Meta Learning","version":2},"cited_work":{"arxiv_id":"1902.08412","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1902.08412","snapshot_observed_at":"2026-07-01T21:56:15.229684Z","title":"Adversarial attacks on graph neural networks via meta learning","venue":null,"work_id":"413c3e13-6db9-4538-85f2-c501c808f4cb","year":1902},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"cited_paper":"/paper/1902.08412","citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:acb476a5d6fc512982c9af7b59a1eae273254ae4ad6860b6ebe3a58d99d2a559","observation_id":"2f620346-952f-4528-98ce-eb8dd22dba1b","resolution":{"observed_at":"2026-05-21T18:45:28.783684Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"All you need is low (rank) defending against adversarial attacks on graphs","venue":null,"work_id":"3014adf1-81f1-4072-9f1b-06eaac123878","year":2020},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:1fafc9c5c99408534921f2868d54def9edbd87b7b292aa757493fededa5f2e8e","observation_id":"cfecf188-7ee3-4b90-98c1-2241b448b68d","resolution":{"observed_at":"2026-05-21T18:45:28.941071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Graph structure learning for robust graph neural networks","venue":null,"work_id":"8d9b36ff-3d93-4dba-98de-4441dd22861a","year":2020},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:2077f2ebc0e140c2783e2810b813902f6f01290ed1e26bc95b741231ac75e926","observation_id":"de58a7f5-41a5-4b4b-a983-7554671ce6e4","resolution":{"observed_at":"2026-05-21T18:45:28.945961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-08T19:35:33.168715Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"c1f7205b-cb20-42f8-a052-fdfc16e87f07","year":2017},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:500d652e2f5a3be05ef244fa4bf9e9e568abefcb4a733d673bab14833e6d08a0","observation_id":"9e973d61-744d-4c47-a099-87de8798cb53","resolution":{"observed_at":"2026-05-21T18:45:28.962676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Zoobp:Belief propagation for heterogeneous networks","venue":null,"work_id":"f4724ce7-0e6a-444c-9e4e-6be46e21185d","year":2017},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:3443f69c483935b40a0de7b3fcba8c0b5914e79ff0adaadff505e140bcb59b36","observation_id":"b546c650-bfb1-4753-a9e2-2124bc668d4b","resolution":{"observed_at":"2026-05-21T18:45:28.938836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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":"1609.02907","doi":"10.1039/d0cp00305k","metadata_source":"pith","pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","venue":"cs.LG","work_id":"21fff118-807d-49cd-8229-f7087ba57b5d","year":2016},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:e50cea21eac1ba22594d2ba39ab5328e9199f2f8e7cc5931338e40253f7b9278","observation_id":"797a7875-01a3-45d4-80de-d3fc2124ecb1","resolution":{"observed_at":"2026-05-21T18:45:28.796275Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"55bdbea2-76b1-458e-8605-9919c7230146","year":2007},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:3ae6322b2415492a2455d220452381923ec025ce8462d16decca140d59dfa3cd","observation_id":"3e5ca1c6-1864-4f14-84ca-be2666e107de","resolution":{"observed_at":"2026-05-21T18:45:28.959455Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T13:42:38.066883Z","title":"The graph neural network model","venue":null,"work_id":"d18bd461-73bf-42ba-ae60-1807f64b6005","year":2008},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:c539cfdce625d24bde59e3b993c878d1c82aa40b433818af892d3b2a5bd7ba8f","observation_id":"db1280e7-fcdf-4571-8537-4c820b9de480","resolution":{"observed_at":"2026-05-21T18:45:28.936501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Adversarial attacks on neural networks for graph data","venue":null,"work_id":"0935d644-2bbf-43c7-83f4-b9fc194713c0","year":2018},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:f2eed5494a6ab5eedc0e07f853b3bb1f82593f16781f220f2b9a2fd3326c922c","observation_id":"f23aef8d-f588-4df5-ad8a-143cf24ba79e","resolution":{"observed_at":"2026-05-21T18:45:28.943793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Making machine learning robust against adversarial inputs","venue":null,"work_id":"af2380f8-4e3d-4b0a-a952-2dc7c0b6dbb7","year":2018},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:9a862f271477e3b8363b1d3988578f3ad274208f3f394f4381f1f7052e2b5fc4","observation_id":"8c2c184b-14f6-4704-ac3e-e62d922a41bd","resolution":{"observed_at":"2026-05-21T18:45:28.952754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Analysis of classifiers’ robustness to adversarial perturbations","venue":null,"work_id":"ead1f3b6-aca5-4166-82ec-5026e6a06742","year":2018},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:2b6f0693ccd2c75fbbb8cdef25be9dd968d9dd0df0ac73516629637dfa029617","observation_id":"ee66ad48-5bcd-4560-a7f1-e7db97e8e4fd","resolution":{"observed_at":"2026-05-21T18:45:28.964790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.04214","last_updated":"2019-10-14T22:09:35Z","snapshot_observed_at":"2026-07-06T07:59:19.943467Z","submitted_at":"2019-06-10T18:20:09Z","title":"Topology Attack and Defense for Graph Neural Networks: An Optimization Perspective","version":3},"cited_work":{"arxiv_id":"1906.04214","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.04214","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Topology attack and defense for graph neural networks: An optimization perspective","venue":null,"work_id":"f2652a19-c122-4cd7-bca3-54161572807a","year":1906},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"cited_paper":"/paper/1906.04214","citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:c200ac183220701594b2027d956fc60b184a13e5ec4e599e11955039d0a76ede","observation_id":"13408b42-116d-4ef6-9c24-3c83a34a4be6","resolution":{"observed_at":"2026-05-21T18:45:28.806441Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"867cca90-a181-4425-bfe2-8151a8dd8fef","year":1997},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:35feda1079a2bc6640740a731f06b256348020b34393dcf711fa2a9650a8cade","observation_id":"a950b2fc-32ab-4381-870a-d29da2e94e30","resolution":{"observed_at":"2026-05-21T18:45:28.954782Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a1bbfdd3-fc47-4c7c-98d4-b1db58f285c3","year":2013},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:fd3be450ad27286c79b7be32e60a98eea3d2a29371ac90b0af7ff5db4c8ff2a5","observation_id":"95240f20-c3cd-4283-a3bc-64a3fe3f3904","resolution":{"observed_at":"2026-05-21T18:45:28.948142Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Spade: A spectral methodforblack-boxadversarialrobustnessevaluation","venue":null,"work_id":"2c45e256-becd-4790-9940-abe9143f3a76","year":2021},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:0809710db719998785f41e9b36ab905acc0320a5fed864d50ba35d368f0bde8a","observation_id":"9a141229-64fd-47a4-b771-1b5ad005aa7e","resolution":{"observed_at":"2026-05-21T18:45:28.957325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","venue":null,"work_id":"2feebebc-6a36-4386-a577-94be814efe2a","year":2018},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:54e1e8d655b3b016cc9ae2aeb8560b6d9c4886afb4ab96a89d254c94d2dcc9ad","observation_id":"428c4992-69c9-45bc-8006-7be834a6e556","resolution":{"observed_at":"2026-05-21T18:45:28.950369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-05T21:23:00.469572Z","title":"Support vector clustering","venue":null,"work_id":"c73a425c-9d8b-46b5-8f19-be6ce807bc81","year":2001},"citing_paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T18:45:01.748067Z"},"links":{"citing_paper":"/paper/2512.08964"},"observation_digest":"sha256:92aba7bcf333a45426a65893be9d4289cf2da16d97079027e1790cd47ea05c23","observation_id":"23975d83-a40e-4997-b123-56b5796e6e84","resolution":{"observed_at":"2026-05-21T18:45:28.967188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2512.08964","last_updated":"2026-05-15T15:13:23Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T04:39:06.010398Z","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":3,"verified_fuzzy":13},"total_outbound_references":19},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2512.08964."}