{"as_of":"2026-08-10T22:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b0058a55562b2fec538b9aeff5ce9b477526eaf84822710d985522d615d6f86c","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T10:56:56.409120Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"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/2601.08187/citation-record","integrity":"/paper/2601.08187/integrity","json":"/paper/2601.08187/citation-record.json","paper":"/paper/2601.08187"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:56:56.233357Z","title":"A survey of large language models for graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.233357Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:fa792b5455e8b80c438f8c8e4964f92ed9671549ac2d85efb5ef8f7e9bfaa8b7","observation_id":"13891f4f-a54b-4dbf-b58c-54775a85c484","resolution":{"observed_at":"2026-08-03T10:56:56.233357Z","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-03T10:56:56.237307Z","title":"Large language models on graphs: A comprehensive survey.IEEE Transactions on Knowledge and Data Engineering, 36(12):8622–8642, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.237307Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:a067801f1e101d2c9a98749b303bf7ba54003b06f720b0bb8ac6bd8f7cd5b52d","observation_id":"e5f22513-d497-4959-856d-47bc7e131630","resolution":{"observed_at":"2026-08-03T10:56:56.237307Z","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-03T10:56:56.240713Z","title":"Graphgpt: Graph instruction tuning for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.240713Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:5513b944f143880346435fc4e8bda232078b46e9af8afbf214fc044ac868e907","observation_id":"f77932a5-eb4d-4e5e-8efe-f1de522e76fb","resolution":{"observed_at":"2026-08-03T10:56:56.240713Z","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-03T10:56:56.243887Z","title":"Language is all a graph needs","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.243887Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:892da9a54959174369bf59381e37cda60798600420a99c1f67f04487e533a86e","observation_id":"89914582-11dc-41c2-a1fd-fa4863a02c5b","resolution":{"observed_at":"2026-08-03T10:56:56.243887Z","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-03T10:56:56.246931Z","title":"When do LLMs help with node classification? a comprehensive analysis","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.246931Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:a9f708b9de25698b81896e3d7a2265f7d19357ff6d9b3aebd95f439dcf28eeed","observation_id":"2e3d4ec6-cb16-4c6d-8b76-bd8516333844","resolution":{"observed_at":"2026-08-03T10:56:56.246931Z","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-03T10:56:56.249978Z","title":"Llaga: Large language and graph assistant","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.249978Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:1d95a84e9e7b8b4801c8216781774142d97c4042fe9a631d6a38763888085179","observation_id":"5fa783ad-3434-4562-86f9-f66e54a87bb1","resolution":{"observed_at":"2026-08-03T10:56:56.249978Z","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-03T10:56:56.253370Z","title":"Beyond the limits: a survey of techniques to extend the context length in large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.253370Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:35ab7f6fa3b34b881ae2b5956a40732ebfff39f65bb136053589f305b2355432","observation_id":"0aa49615-b323-4480-af17-cf132df7dbdc","resolution":{"observed_at":"2026-08-03T10:56:56.253370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13562","last_updated":"2025-02-19T09:14:19Z","snapshot_observed_at":"2026-08-07T18:06:06.876199Z","submitted_at":"2025-02-19T09:14:19Z","title":"Are Large Language Models In-Context Graph Learners?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13562","snapshot_observed_at":"2026-08-03T10:56:56.256191Z","title":"Are large language models in-context graph learners?arXiv preprint arXiv:2502.13562, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.256191Z"},"links":{"cited_paper":"/paper/2502.13562","citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:0363534772249515c9340bb039085840c759827b6053aab70e4f772e61f23dd1","observation_id":"f61103de-ea61-4720-8c4f-e7fdf5e075e9","resolution":{"observed_at":"2026-08-03T10:56:56.256191Z","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-03T10:56:56.259936Z","title":"Exploring the potential of large language models (llms)in learning on graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.259936Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:88cb0661cfe85ae4e5da1508e53c813ddda87298b931f2f9ebc0e043a3a62704","observation_id":"947708e3-83ae-4bf5-93db-2a62f5ae996a","resolution":{"observed_at":"2026-08-03T10:56:56.259936Z","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-03T10:56:56.263198Z","title":"Talk like a graph: Encoding graphs for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.263198Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:059affaf69fe3143b4f9d35312172f64a3b132899b835cbe23e5071e453c3dbc","observation_id":"e0b940e6-465e-4fc7-9903-60c7e773a874","resolution":{"observed_at":"2026-08-03T10:56:56.263198Z","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-03T10:56:56.266069Z","title":"Graph condensation for graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.266069Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:2a712dc16ad67749ecfb9c91e6fedde477378650e230fe013d7b324dacadd055","observation_id":"6b0194b0-40a3-43b8-9037-9545c380b417","resolution":{"observed_at":"2026-08-03T10:56:56.266069Z","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-03T10:56:56.269204Z","title":"Condensing graphs via one-step gradient matching","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.269204Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:39406f63d80151a4b1117fa15d608c79488a4d911820fe691f211760bad5cad7","observation_id":"d2138a66-40ae-4692-a69b-16f40a121ea4","resolution":{"observed_at":"2026-08-03T10:56:56.269204Z","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-03T10:56:56.272542Z","title":"Structural information and dynamical complexity of networks.IEEE Transactions on Information Theory, 62(6):3290–3339, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.272542Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:fb16e9bb7bb0cddc5442110e2c204edac014c74b112e2fb1cbdb491f8ca188b8","observation_id":"549ad108-a002-4806-9e92-eee73a0418a8","resolution":{"observed_at":"2026-08-03T10:56:56.272542Z","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-03T10:56:56.275933Z","title":"Graph out-of-distribution generalization based on structural-entropy-guided information bottleneck.ACM Transactions on Knowledge Discovery from Data, 20(1):1–34, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.275933Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:acb6b13b8c6a107cefb86167a66717efb37afda3d903972a1a4b9ccb7c13c4c5","observation_id":"606b158c-1001-4565-b849-a7aa93099e96","resolution":{"observed_at":"2026-08-03T10:56:56.275933Z","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-03T10:56:56.279214Z","title":"Structural entropy guided unsupervised graph out-of-distribution detection","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.279214Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:328a2434a0eefee373311ddbdec6a107991afc18e432bf75b64843a5833afe90","observation_id":"84c47cd8-2664-4327-86ba-5dbf87885a8e","resolution":{"observed_at":"2026-08-03T10:56:56.279214Z","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-03T10:56:56.282643Z","title":"Incremental measurement of structural entropy for dynamic graphs.Artificial Intelligence, 334:104175, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.282643Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:ee153df15acc1215b67db7151b98b1fe8420636e7e8571ff6b2e036d833043e1","observation_id":"3ce09919-53d6-41e8-aad3-dd2cb8585528","resolution":{"observed_at":"2026-08-03T10:56:56.282643Z","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-03T10:56:56.285641Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.285641Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:12421598c4a6096c78fb1de96d155f042f0c115ec7597281a86246466e2ae781","observation_id":"f846c520-d22c-43b4-a6fc-60f048461810","resolution":{"observed_at":"2026-08-03T10:56:56.285641Z","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-03T10:56:56.288566Z","title":"Se-gsl: A general and effective graph structure learning framework through structural entropy optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.288566Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:a58cd9b3ff7b11b2ad8a5091d04012c3e147f14d832242fe0406127b5e742619","observation_id":"e3b1541d-83fa-4759-b3a3-4922fe4041da","resolution":{"observed_at":"2026-08-03T10:56:56.288566Z","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-03T10:56:56.292666Z","title":"Sega: Structural entropy guided anchor view for graph contrastive learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.292666Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:e141b85615798d2402b1004704aee94884cbd6fdabcc9a83e2e58dd98fc5d37b","observation_id":"428f66d6-5f40-462f-be88-9207ae615ad1","resolution":{"observed_at":"2026-08-03T10:56:56.292666Z","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-03T10:56:56.295658Z","title":"A simple yet effective method for graph classification","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.295658Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:d228e75165cc6550e1e69eee82e6300593dcf21e96204d86576099b32b7a59e5","observation_id":"66daf0f8-5dc1-4ca5-807b-b973d237d61d","resolution":{"observed_at":"2026-08-03T10:56:56.295658Z","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-03T10:56:56.299147Z","title":"Structural entropy guided graph hierarchical pooling","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.299147Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:26ed7699f2e6a606dd592b855662bd8320d468489d33247d47c943a65f85fe90","observation_id":"a6bccc7b-3b06-4398-bc39-ed6585c780dd","resolution":{"observed_at":"2026-08-03T10:56:56.299147Z","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-03T10:56:56.301976Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.301976Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:efac4c26430cda395ddf009f54e054172ed53940439db01b7d88c6534ec9ca72","observation_id":"38af9f8d-aef1-42e2-b68c-aedf7fb05970","resolution":{"observed_at":"2026-08-03T10:56:56.301976Z","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-03T10:56:56.304791Z","title":"Resistance maximization principle for defending networks against virus attack.Physica A: Statistical Mechanics and its Applications, 466:211–223, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.304791Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:0c6e5c3f5942880b41c0070ef2894a516559d26b562c3fd65283c07cb6472352","observation_id":"3dd6ef5d-305c-496a-8915-9cca867a4bef","resolution":{"observed_at":"2026-08-03T10:56:56.304791Z","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-03T10:56:56.307977Z","title":"Achieving graph clustering privacy preservation based on structure entropy in social iot.IEEE Internet of Things Journal, 9(4):2761–2777, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.307977Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:1f5e816c0f3d0e26d5d7d1fdb91c2d9d7a197c72f60bb30b0f10164c1637b0ac","observation_id":"c06d8600-1455-4007-bd41-1d7047a57f6d","resolution":{"observed_at":"2026-08-03T10:56:56.307977Z","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-03T10:56:56.311326Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.311326Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:a321c3efa3e7f4f98c9dae90942704134308f651e965b95c27c4aa1ef9ecd5fa","observation_id":"103d6387-c37a-47a9-83cb-2628b312cfc9","resolution":{"observed_at":"2026-08-03T10:56:56.311326Z","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-03T10:56:56.314651Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.314651Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:8163edcb0c79659a04912e3f77f263716580a5c4e963b247aac612fea562b200","observation_id":"9b46ad5b-292c-45a3-8d7a-cb561cc82bcb","resolution":{"observed_at":"2026-08-03T10:56:56.314651Z","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-03T10:56:56.317599Z","title":"Sebot: Structural entropy guided multi-view contrastive learning for social bot detection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.317599Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:ab0d557c1753116ec774a4ef6463d2b00ffe28b965c7b0a63548b7a273505120","observation_id":"9aef28c9-27d4-42d8-97d1-4f943b5ed36a","resolution":{"observed_at":"2026-08-03T10:56:56.317599Z","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-03T10:56:56.321677Z","title":"Valence-based homophily on twitter: Network analysis of emotions and political talk in the 2012 presidential election.New media & society, 18(7):1382–1400, 2016","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.321677Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:a91a9ae771fb85f46021c4bc620ed0eb98fb4fff681e5432436db5076a9cc8b1","observation_id":"12e1e25f-fbf8-4cc1-af48-11e92c391760","resolution":{"observed_at":"2026-08-03T10:56:56.321677Z","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-03T10:56:56.325616Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.325616Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:d6c8383aa74ac299dd7c73091b79765c1d029eb10c05e09d9de9a112f13c35fe","observation_id":"cfc35f5f-ecdc-48fb-aa21-3f2e8940e0df","resolution":{"observed_at":"2026-08-03T10:56:56.325616Z","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-03T10:56:56.328517Z","title":"Open graph benchmark: datasets for machine learning on graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.328517Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:ed0831f55885f50adf4338866f874d45aa8b4cc4dbc1ed7604a1e41a78702c1e","observation_id":"9ffb1ada-7f15-47db-8945-83981623c663","resolution":{"observed_at":"2026-08-03T10:56:56.328517Z","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-03T10:56:56.332462Z","title":"Harnessing explanations: LLM-to-LM interpreter for enhanced text-attributed graph representation learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.332462Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:bf7e4dc370e7a8c22d478a4fc573b025cb38125c7b314739a5d77d067e27f16c","observation_id":"86b4f620-bb42-4de8-abe6-6ba7672f2d61","resolution":{"observed_at":"2026-08-03T10:56:56.332462Z","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-03T10:56:56.335604Z","title":"Can gnn be good adapter for llms? InProceedings of the ACM Web Conference 2024, WWW-24, page 893–904, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.335604Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:68375dc7411b10927ecb56157d138f1bd60309428ea9da540477dfe325a02df6","observation_id":"1ae33bd9-d2a1-43e0-93a8-8180d393cc0d","resolution":{"observed_at":"2026-08-03T10:56:56.335604Z","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-03T10:56:56.338409Z","title":"Cohen, and Ruslan Salakhutdinov","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.338409Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:522d5a26046229218bec1fed500bd533da7aab5c1929976f887c235c86e8966f","observation_id":"b8f59352-e1cd-4bc6-97b4-5190ba288de0","resolution":{"observed_at":"2026-08-03T10:56:56.338409Z","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-03T10:56:56.341362Z","title":"Taglas: An atlas of text-attributed graph datasets in the era of large graph and language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.341362Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:811a5acb68d86291e6027993c481931ea128b3aa1a74820b82f256dee3c5789f","observation_id":"4ac45a71-84e1-466b-948b-502b8485ad15","resolution":{"observed_at":"2026-08-03T10:56:56.341362Z","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-03T10:56:56.345056Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.345056Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:74f2fdefd2045a51d4cf74b60f66382521b3c2345b6096a43a8b291e18c2570b","observation_id":"7e11dcb8-5ff0-45f3-bb1f-c85619828618","resolution":{"observed_at":"2026-08-03T10:56:56.345056Z","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-03T10:56:56.348457Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.348457Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:172b24d1302d7a8bdc1766d87e31a81ff04dd58293c6f63aa1984205e6224739","observation_id":"c17c4ab2-93ae-40d5-8601-9a74c4a8c4c1","resolution":{"observed_at":"2026-08-03T10:56:56.348457Z","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-03T10:56:56.351317Z","title":"How powerful are graph neural networks? In International Conference on Learning Representations, ICLR-19, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.351317Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:a8bb9678e8e9ddcd99f4e2859ec26dc2c882c81d75a52eb6d77c2cc61c23e8b7","observation_id":"f074a0a6-92c4-4251-bc2f-c2cc4d0ec014","resolution":{"observed_at":"2026-08-03T10:56:56.351317Z","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-03T10:56:56.354125Z","title":"Inductive representation learning on large graphs.Proceedings of the 31st International Conference on Neural Information Processing Systems, NeurIPS-17, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.354125Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:d044e7720523bfb6ae3ffb6104cef9d519b48d7052c2a3eb603d20722a59d08a","observation_id":"9470dc1c-5b81-4cf3-a39f-04ad8968ecb4","resolution":{"observed_at":"2026-08-03T10:56:56.354125Z","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-03T10:56:56.356784Z","title":"Degree-based stratification of nodes in graph neural networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.356784Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:deb24880d049601637d5419120c80b608037d1666ddd652d88748620c11984f4","observation_id":"963ca38d-6500-41df-aacc-265d02690794","resolution":{"observed_at":"2026-08-03T10:56:56.356784Z","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-03T10:56:56.359486Z","title":"Graph-skeleton:˜ 1% nodes are sufficient to represent billion-scale graph","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.359486Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:209ff89ffa9574b0399010b54b7b13ed40bbe1590da9a005c6e9997bd3af330b","observation_id":"0acde30a-abd9-4bf2-9bea-18106d0307ff","resolution":{"observed_at":"2026-08-03T10:56:56.359486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-10T16:40:37.411115Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-03T10:56:56.362464Z","title":"The llama 3 herd of models.arXiv preprint arXiv:2407.21783, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.362464Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:cdfbc86050bcba481a7312802b72a118f10eadb962be7ed97127968f9faedead","observation_id":"b7d3fa8c-de05-4505-aff3-b01a9ca129d3","resolution":{"observed_at":"2026-08-03T10:56:56.362464Z","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-03T10:56:56.365593Z","title":"Judging llm-as-a-judge with mt-bench and chatbot arena","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.365593Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:a19b535f9f4251cd18a2ea795d0ef77bad0cb3af3a5195acda4cfcdd99b716f8","observation_id":"9051ff6c-924a-4c49-aa7e-26f001cad6dc","resolution":{"observed_at":"2026-08-03T10:56:56.365593Z","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-03T10:56:56.368583Z","title":"Multi-scale heterogeneous text-attributed graph datasets from diverse domains","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.368583Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:d5667d98095aa38dd59543ddab5bdd273c663a722d9da8ddb1cee6d67dad5d3e","observation_id":"5c4ee624-02b9-4815-a913-2ecaffdb5f40","resolution":{"observed_at":"2026-08-03T10:56:56.368583Z","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-03T10:56:56.372269Z","title":"A survey of structural entropy: Theory, methods, and applications","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.372269Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:7ce02786ceb3584326f6ad80b83db71cd555b8b6451e18f1eb22d29f936b8439","observation_id":"4e860ce4-419c-4099-b8bc-67bdfd791084","resolution":{"observed_at":"2026-08-03T10:56:56.372269Z","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-03T10:56:56.375324Z","title":"Item recommendation on monotonic behavior chains","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.375324Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:134d4b85ace99e9ec11a39368d3ea917d6ae00315a7344a83266efb8e592a3e6","observation_id":"317fa7a4-48a7-48e3-84b7-deb820653789","resolution":{"observed_at":"2026-08-03T10:56:56.375324Z","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-03T10:56:56.378300Z","title":"Oag-bench: a human-curated benchmark for academic graph mining","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.378300Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:730f9bb1a7d6576053b8a59f224e8e1a5ab3040bc7cc1f506bdcb711d87adce2","observation_id":"b9d80670-e868-42ea-a879-06a4d021e67b","resolution":{"observed_at":"2026-08-03T10:56:56.378300Z","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-03T10:56:56.381897Z","title":"Explainability in graph neural networks: A taxonomic survey.IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(5):5782–5799, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.381897Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:61ca0ba7c85a414b8225020f17e1226717ba6ce4eb5ce70db7f90285ec09a23b","observation_id":"1bbffd43-3c72-44a7-a9c4-efd682901aae","resolution":{"observed_at":"2026-08-03T10:56:56.381897Z","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-03T10:56:56.384651Z","title":"Moleculenet: a benchmark for molecular machine learning.Chemical science, 9(2):513–530, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.384651Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:4bbe91186e39384b6858caea89af84b46c5c5f2f4a3fccc64fd4bb5d565f81ae","observation_id":"daca6e33-c014-4305-9793-9fad972c7c5e","resolution":{"observed_at":"2026-08-03T10:56:56.384651Z","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-03T10:56:56.387424Z","title":"Graph coarsening via convolution matching for scalable graph neural network training","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.387424Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:cd11928a774788f0111b6ac59a5589a3b73b5692a48449b698ae6368f0cfccdb","observation_id":"06b90d97-c4f9-4ce3-a73b-4d1b24c523be","resolution":{"observed_at":"2026-08-03T10:56:56.387424Z","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-03T10:56:56.390682Z","title":"Featured graph coarsening with similarity guarantees","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.390682Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:5ebaafb1700b7a6b8b147f04fd7049350821128df621635676f1baa3b1ac5fec","observation_id":"6cc697fb-cb3a-4fd4-a626-aeac477b130d","resolution":{"observed_at":"2026-08-03T10:56:56.390682Z","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-03T10:56:56.394200Z","title":"Ugc: universal graph coarsening","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.394200Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:5a1b0016f1a65013a663cbc35f11e974b9f6425a6476e174604425ddee9f35f8","observation_id":"17675f82-3206-43cb-a16f-584b9b30bf25","resolution":{"observed_at":"2026-08-03T10:56:56.394200Z","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-03T10:56:56.397125Z","title":"Quantifying node importance over network structural stability","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.397125Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:af8d1b4fde3f06cce94121bce514bc27cba0ba7608f87cac3591d4654cc535df","observation_id":"97843ffd-c0c9-466e-bcb1-8999cce1f4aa","resolution":{"observed_at":"2026-08-03T10:56:56.397125Z","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-03T10:56:56.400612Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.400612Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:bf2a655fcaae895c27e9b2ec0b025b492c56db15139e575b42df5268f487164f","observation_id":"23024b9e-435c-41a7-9ffb-c08847c4f6a1","resolution":{"observed_at":"2026-08-03T10:56:56.400612Z","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-03T10:56:56.403527Z","title":"Answer: Box 5The Aggregation prompt template for Molecule Property Prediction Datasets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.403527Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:fec4715af6d7894c6e2652ffd20a39e77468875e09f747f5669cdea8729d85fb","observation_id":"a2069f97-91f0-40aa-869c-db4db8167f2f","resolution":{"observed_at":"2026-08-03T10:56:56.403527Z","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-03T10:56:56.406438Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.406438Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:84b0e2e92cf931531d0097a1c108957f9533d473c19cb2e26f9d5e98e03aa765","observation_id":"7e1305bc-d892-4eb9-ad7b-e5f091f41e5b","resolution":{"observed_at":"2026-08-03T10:56:56.406438Z","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-03T10:56:56.409120Z","title":"is similar to","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T10:56:56.409120Z"},"links":{"citing_paper":"/paper/2601.08187"},"observation_digest":"sha256:f2148da8ea64106dabcd06ee923b72a419bf0cede59967fde750e2a3693ee59d","observation_id":"9fbf609f-5cc9-40ff-82ab-7a40c5be6434","resolution":{"observed_at":"2026-08-03T10:56:56.409120Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.08187","last_updated":"2026-06-30T02:35:36Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T06:44:11.968061Z","submitted_at":"2026-01-13T03:35:18Z","title":"Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":55,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":56},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2601.08187."}