{"as_of":"2026-08-10T07:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e0984c91ba0f0b835f4a96fafc267948512dfd5881178532482028db6614f8a","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T21:14:05.229375Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"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/2501.19137/citation-record","integrity":"/paper/2501.19137/integrity","json":"/paper/2501.19137/citation-record.json","paper":"/paper/2501.19137"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:14:05.105875Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.105875Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:fc8602c8659c0398ae981fb6d6dfc4b1783da11c1d32343168cc0b6024589782","observation_id":"7b179ae6-750e-4a98-ac68-d8cd18351dcf","resolution":{"observed_at":"2026-08-09T21:14:05.105875Z","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-09T21:14:05.112404Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.112404Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:f4ef7aa378368b9fed81490bf627cf612b4d2705236f0cd293e63f8c842ea107","observation_id":"ee13ba59-12dc-4d14-953d-6b9295544ae3","resolution":{"observed_at":"2026-08-09T21:14:05.112404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05205","last_updated":"2021-03-09T11:53:06Z","snapshot_observed_at":"2026-08-06T10:13:00.684351Z","submitted_at":"2020-06-09T12:04:50Z","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05205","snapshot_observed_at":"2026-08-09T21:14:05.118554Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.118554Z"},"links":{"cited_paper":"/paper/2006.05205","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:13b5e843a8d79730052a84b2c43f9cd6d68f392e42ee405a87d39ac0cd5a63d8","observation_id":"b5670ce4-f960-48f2-a765-c830454c21de","resolution":{"observed_at":"2026-08-09T21:14:05.118554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.04332","last_updated":"2024-02-25T22:48:34Z","snapshot_observed_at":"2026-07-06T16:16:10.947187Z","submitted_at":"2023-09-08T13:59:18Z","title":"Graph Neural Networks Use Graphs When They Shouldn't","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.04332","snapshot_observed_at":"2026-08-09T21:14:05.124876Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.124876Z"},"links":{"cited_paper":"/paper/2309.04332","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:bc2b0da46fbb854155291afc8d2672483cab954f921eda0db4a457ce1b0dea0c","observation_id":"fb06b2c3-9ea2-440f-8b81-fd3b6277ba16","resolution":{"observed_at":"2026-08-09T21:14:05.124876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:14:06.100568Z","title":null,"venue":null,"work_id":"fcba00e8-a8e2-4234-bbeb-f078e79a5029","year":2021},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.130735Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:0b33469deffb989d042fab4b3aa6d720b41a56372f6eaab66d3e140a5bf8ec63","observation_id":"1889493b-b551-43b4-8e2a-0db4fa5deb34","resolution":{"observed_at":"2026-08-09T21:14:06.105779Z","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":{"arxiv_id":"2212.07843","last_updated":"2022-12-15T14:04:27Z","snapshot_observed_at":"2026-07-06T14:30:59.253425Z","submitted_at":"2022-12-15T14:04:27Z","title":"Realistic Synthetic Social Networks with Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.07843","snapshot_observed_at":"2026-08-09T21:14:05.136640Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.136640Z"},"links":{"cited_paper":"/paper/2212.07843","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:a738d135a47eddadab608127d3a4b4c6f821059be353b4a62b09c4c9f3d50de8","observation_id":"9f855d10-238f-48c2-9286-568fa70afb81","resolution":{"observed_at":"2026-08-09T21:14:05.136640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.01212","last_updated":"2017-06-12T20:52:56Z","snapshot_observed_at":"2026-08-07T07:38:05.448298Z","submitted_at":"2017-04-04T23:00:44Z","title":"Neural Message Passing for Quantum Chemistry","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.01212","snapshot_observed_at":"2026-08-09T21:14:05.142449Z","title":"S.; Riley, P","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.142449Z"},"links":{"cited_paper":"/paper/1704.01212","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:111b89bbdef86d52025fede6ed62e2c862c084e60f4bb7881fb40d3691e1998e","observation_id":"1ff24fd1-73b2-4656-ad01-37f76bdab10e","resolution":{"observed_at":"2026-08-09T21:14:05.142449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.02415","last_updated":"2017-12-05T06:22:03Z","snapshot_observed_at":"2026-07-06T05:13:49.420787Z","submitted_at":"2016-10-07T20:26:34Z","title":"Automatic chemical design using a data-driven continuous representation of molecules","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.02415","snapshot_observed_at":"2026-08-09T21:14:05.149125Z","title":"N.; Duvenaud, D.; Hernández-Lobato, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.149125Z"},"links":{"cited_paper":"/paper/1610.02415","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:1a040417f1e76ee7b245d853f9ae5d4907fffdff77745cf986bfdff859c1bdd4","observation_id":"8b0e7108-8ef0-4129-9e53-1d81a69389aa","resolution":{"observed_at":"2026-08-09T21:14:05.149125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07835","last_updated":"2022-03-17T16:41:15Z","snapshot_observed_at":"2026-08-08T12:40:30.766964Z","submitted_at":"2021-02-15T20:27:56Z","title":"Topological Graph Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07835","snapshot_observed_at":"2026-08-09T21:14:05.157974Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.157974Z"},"links":{"cited_paper":"/paper/2102.07835","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:fe21a0326bcbf1bce85f0dde13be6555b2cbb4d7de879b0b4d925e1807036743","observation_id":"8d2d46ca-e48d-47b0-873d-6d0fa447418e","resolution":{"observed_at":"2026-08-09T21:14:05.157974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:14:06.083342Z","title":null,"venue":null,"work_id":"677f3dd9-8d58-47e2-84d2-74051eedd933","year":2020},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.164362Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:46b8cad393ff606e3aba406a92b6bf389a1402121a4631a9ff1864c46494e856","observation_id":"e70b2675-9506-4d3b-88a6-a620d96aa9a9","resolution":{"observed_at":"2026-08-09T21:14:06.088462Z","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":{"arxiv_id":"2011.09643","last_updated":"2021-03-08T10:48:14Z","snapshot_observed_at":"2026-08-07T03:05:15.469673Z","submitted_at":"2020-11-19T04:18:01Z","title":"Node Similarity Preserving Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.09643","snapshot_observed_at":"2026-08-09T21:14:05.170571Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.170571Z"},"links":{"cited_paper":"/paper/2011.09643","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:bdd0a2a31ceb40dd332bdfd2bca1e89518fd8b11d92a9fc383c70fd1ed47111d","observation_id":"1b66683e-b5c8-43e8-a19c-9ec94daf4403","resolution":{"observed_at":"2026-08-09T21:14:05.170571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:14:05.795440Z","title":"J.; Bollegala, D.; and Kell, D","venue":null,"work_id":"b8b00dc0-e84b-4101-bd6d-f8a1a8a00dab","year":2020},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.178071Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:dcc7d6590dfba871504d380df2c0a7201fcf008f91a5a94f48e16acba5058b61","observation_id":"ce46819f-0361-4f0a-9f1b-e3674cb8bc49","resolution":{"observed_at":"2026-08-09T21:14:06.064821Z","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":"1901.09674","last_updated":"2019-04-12T16:35:09Z","snapshot_observed_at":"2026-07-06T07:29:25.620611Z","submitted_at":"2019-01-17T20:55:53Z","title":"Deep Generative Graph Distribution Learning for Synthetic Power Grids","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09674","snapshot_observed_at":"2026-08-09T21:14:05.185515Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.185515Z"},"links":{"cited_paper":"/paper/1901.09674","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:6bd3f7b77dd14ad2cc53f86c4ca50cd0bb4d4ac56d3e4d00a9788be00aee5a07","observation_id":"f67cfa18-8013-42b2-a49d-0372008ad564","resolution":{"observed_at":"2026-08-09T21:14:05.185515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:14:05.777386Z","title":"M.; Huang, K.; and Zitnik, M","venue":null,"work_id":"e6e8556d-082a-4945-b702-9ae262bd1561","year":2022},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.192911Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:f770b92e57c3dcc93b4ff5720439ac076c7ca4943c9aa13a51f23fd7271df672","observation_id":"9a08ccd8-35c7-461f-89f1-b72977ce4924","resolution":{"observed_at":"2026-08-09T21:14:05.783252Z","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":"1905.13372","last_updated":"2019-05-31T01:33:13Z","snapshot_observed_at":"2026-08-07T09:01:09.883892Z","submitted_at":"2019-05-31T01:33:13Z","title":"MolecularRNN: Generating realistic molecular graphs with optimized properties","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.13372","snapshot_observed_at":"2026-08-09T21:14:05.200107Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.200107Z"},"links":{"cited_paper":"/paper/1905.13372","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:540133aa10812f0f85a324d0b06f2da9b753a7e4010f903ecea53c1de0c7299c","observation_id":"3616ac8c-2698-4165-b400-caf728764d30","resolution":{"observed_at":"2026-08-09T21:14:05.200107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:14:05.760462Z","title":null,"venue":null,"work_id":"8df5ab9a-1b2c-476d-9578-712019ff41f3","year":2023},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.206489Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:e3931770c18b6380c98b50f41bf424a8d31f08dc702f264041e69e6e04344c03","observation_id":"1177306c-ef32-4e20-828a-0154bcbfeb82","resolution":{"observed_at":"2026-08-09T21:14:05.766076Z","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":{"arxiv_id":"2401.15584","last_updated":"2024-01-28T06:43:13Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T06:43:13Z","title":"DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations","version":1},"cited_work":{"arxiv_id":"2401.15584","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.15584","snapshot_observed_at":"2026-08-09T21:14:05.565632Z","title":"DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations","venue":"cs.LG","work_id":"dec9d57c-acf3-49f5-8659-cccf0cb0a1e3","year":2024},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.212705Z"},"links":{"cited_paper":"/paper/2401.15584","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:858fd0381391560398e04bf418ae105c6d6fee814c8cc4cee684088416b765dd","observation_id":"21f3d4d1-9c9f-41bd-811d-944f75387467","resolution":{"observed_at":"2026-08-09T21:14:05.574357Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:14:05.218633Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.218633Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:54026e014b0c83c8c0ef644bd2f7a8178da5e924551994a08fae28552628f3d8","observation_id":"fca58466-3c38-4048-8f7d-b453f90b8aac","resolution":{"observed_at":"2026-08-09T21:14:05.218633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:14:05.741965Z","title":null,"venue":null,"work_id":"b3887a5a-30f8-418c-817a-bb576128dac9","year":2020},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.223792Z"},"links":{"citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:f55cb38b9c1f3dc4228a3cef3f007e7b10bc01cf82b757e89fd84f43bbc969fb","observation_id":"e79fc5c6-a76c-4184-8362-9cc5c2290f68","resolution":{"observed_at":"2026-08-09T21:14:05.748392Z","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":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-09T21:14:05.229375Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.229375Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:a813aff3e7589a8ee34a02d8b26df37ba9386dd916dd95e351887eb21a4123c2","observation_id":"e8140fd5-0d1b-41c8-bffe-27d51d59d2f1","resolution":{"observed_at":"2026-08-09T21:14:05.229375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":1,"verified_fuzzy":2},"total_outbound_references":20},"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 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2501.19137."}