{"as_of":"2026-08-20T14:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a244a075007adab241d70b990b58b7ad3f4c721d52d2fce2eabf248be1251aea","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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-20T06:33:59.587034+00:00","state":"measured"},{"denominator":20,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:51:32.802798Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T19:08:50.263178Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":"2103.03036","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-07-03T19:08:50.263178Z","title":"A survey on graph structure learning: Progress and opportunities","venue":null,"work_id":"a80db940-6bbb-41dd-8dff-467cf10bb73e","year":2021},"citing_paper":{"arxiv_id":"2410.07191","last_updated":"2025-03-06T23:13:01Z","snapshot_observed_at":"2026-08-16T18:48:49.948683Z","submitted_at":"2024-09-23T20:01:20Z","title":"Curb Your Attention: Causal Attention Gating for Robust Trajectory Prediction in Autonomous Driving","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T20:22:10.086061Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2410.07191"},"observation_digest":"sha256:45bb524a65b1efa04a07b88874e530dd99d01c5303a9188065fd9b8d872513b3","observation_id":"5aaf54f7-09c3-41a7-8316-d89b541842ad","resolution":{"observed_at":"2026-05-23T20:23:24.584965Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-12T21:44:07.686101Z","title":"Deep graph structure learning for robust representations: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.08374","last_updated":"2024-11-13T06:54:05Z","snapshot_observed_at":"2026-08-19T19:23:37.102483Z","submitted_at":"2024-11-13T06:54:05Z","title":"Federated Graph Learning with Graphless Clients","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T21:44:07.686101Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2411.08374"},"observation_digest":"sha256:5596be98884d7ab7007a283baa254785bc91323a0431ceaf73b8b31ac1f7339e","observation_id":"ebb675e1-01b4-430a-ae80-2d4383555104","resolution":{"observed_at":"2026-08-12T21:44:07.686101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-11T18:14:49.859640Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.08160","last_updated":"2024-12-19T10:01:27Z","snapshot_observed_at":"2026-08-19T19:23:36.256204Z","submitted_at":"2024-12-11T07:32:38Z","title":"DG-Mamba: Robust and Efficient Dynamic Graph Structure Learning with Selective State Space Models","version":4},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T18:14:49.859640Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2412.08160"},"observation_digest":"sha256:dfbb86e7e0cf40098d0d2d314188b4da25032df2d52cda9655f8ef2ed469c914","observation_id":"74cb2df7-b5ef-4d70-8849-1bca5f2a2684","resolution":{"observed_at":"2026-08-11T18:14:49.859640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-11T11:25:03.410618Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.17856","last_updated":"2025-03-24T13:48:21Z","snapshot_observed_at":"2026-08-18T19:33:35.528756Z","submitted_at":"2024-12-20T04:05:09Z","title":"Graph Structure Refinement with Energy-based Contrastive Learning","version":3},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-11T11:25:03.410618Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2412.17856"},"observation_digest":"sha256:5467a3df1e570b31173bccafa3309118f17d6b8cee99d18ea11c9a084d240703","observation_id":"0c71e776-75d6-4ba0-9676-c265b247a8d7","resolution":{"observed_at":"2026-08-11T11:25:03.410618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-10T21:46:02.664003Z","title":"A survey on graph structure learn- ing: Progress and opportunities,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.04073","last_updated":"2025-01-07T18:53:14Z","snapshot_observed_at":"2026-08-16T18:00:27.597976Z","submitted_at":"2025-01-07T18:53:14Z","title":"Deep Learning for Ophthalmology: The State-of-the-Art and Future Trends","version":1},"reference_index":200,"source":"pdf_text","source_observed_at":"2026-08-10T21:46:02.664003Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2501.04073"},"observation_digest":"sha256:61c73861b0d10c7c021bc522741de3aec03bf54b64f48debdae0e0747b676bc7","observation_id":"7f06eb76-89ec-4697-9069-dcd2854ee458","resolution":{"observed_at":"2026-08-10T21:46:02.664003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-10T15:49:55.616164Z","title":"Deep graph structure learning for robust representations: A survey,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-19T19:23:35.024719Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.616164Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:cc2c4dd2a9100f21d2811c92ab3a1c0287cd354e2c2318c653b1219ab74c5273","observation_id":"1e5892be-e96a-4b00-acf3-0840a67286b7","resolution":{"observed_at":"2026-08-10T15:49:55.616164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-09T13:42:39.725882Z","title":"Deep graph structure learning for robust representa- tions: A survey","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02017","last_updated":"2025-05-30T06:45:49Z","snapshot_observed_at":"2026-08-11T13:24:49.549135Z","submitted_at":"2025-02-04T05:09:23Z","title":"Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignment","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T13:42:39.725882Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2502.02017"},"observation_digest":"sha256:1f36989ca997ece8dcd185687ba93e54545197f0507ab606be0624d9ea7ba5b8","observation_id":"c9b7adb4-89ff-4b38-b944-5a1e88fe21f4","resolution":{"observed_at":"2026-08-09T13:42:39.725882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-16T04:51:32.802798Z","title":"arXiv preprint arXiv:2103.03036 14, 1–1 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.00302","last_updated":"2025-05-01T04:50:00Z","snapshot_observed_at":"2026-08-19T19:24:15.645671Z","submitted_at":"2025-05-01T04:50:00Z","title":"Temporal Attention Evolutional Graph Convolutional Network for Multivariate Time Series Forecasting","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T04:51:32.802798Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2505.00302"},"observation_digest":"sha256:77a166530573c61bc5057ca26b0a074824ee71232045b30661142c72d018beb7","observation_id":"ca4b5dc2-97a2-4500-9ed7-bb89ec50d484","resolution":{"observed_at":"2026-08-16T04:51:32.802798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-15T22:42:09.977096Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.06706","last_updated":"2025-05-20T07:29:08Z","snapshot_observed_at":"2026-08-19T19:23:40.235512Z","submitted_at":"2025-05-10T17:04:33Z","title":"Bi-level Mean Field: Dynamic Grouping for Large-Scale MARL","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T22:42:09.977096Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2505.06706"},"observation_digest":"sha256:dc8d692cf3955fd8e2c6840769bf4b4eeb4982df27418329b0e6b9f4a6c7ce6e","observation_id":"9c6683a0-1697-4317-8f55-676431345c66","resolution":{"observed_at":"2026-08-15T22:42:09.977096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-15T20:42:42.712336Z","title":"A survey on graph structure learning: Progress and opportunities,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.12323","last_updated":"2025-05-18T09:33:10Z","snapshot_observed_at":"2026-08-19T19:24:16.307293Z","submitted_at":"2025-05-18T09:33:10Z","title":"GraphFLEx: Structure Learning Framework for Large Expanding Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.712336Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:73bdeeee86346eab538460126f1d7bded0e987adace2f3af894afc0ebe31e737","observation_id":"d28a1919-eba6-4234-b0f6-53f4123789e9","resolution":{"observed_at":"2026-08-15T20:42:42.712336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-07T05:20:38.463308Z","title":"A survey on graph structure learning: Progress and opportunities","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-19T19:23:39.290508Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":157,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.463308Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:ff9591e2d6b9022ed4dc37947cdc40c07833e93635bc8230a3bfcaf8ea990abd","observation_id":"054ab4ec-86b4-4ded-8fe2-c161ad5b7056","resolution":{"observed_at":"2026-08-07T05:20:38.463308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-06T12:52:01.648049Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.21407","last_updated":"2025-08-30T06:01:56Z","snapshot_observed_at":"2026-08-15T03:27:34.517290Z","submitted_at":"2025-07-29T00:27:12Z","title":"Graph-Augmented Large Language Model Agents: Current Progress and Future Prospects","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-06T12:52:01.648049Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2507.21407"},"observation_digest":"sha256:cf214dc3aa7d99edc6b1f8e8448fc1b6c988c9c03e2a886974587fa301598259","observation_id":"f3e29ddb-7824-4d06-be7c-e31372fb8322","resolution":{"observed_at":"2026-08-06T12:52:01.648049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":"2103.03036","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-07-03T19:08:50.263178Z","title":"A survey on graph structure learning: Progress and opportunities","venue":null,"work_id":"a80db940-6bbb-41dd-8dff-467cf10bb73e","year":2021},"citing_paper":{"arxiv_id":"2510.08952","last_updated":"2026-05-05T05:35:19Z","snapshot_observed_at":"2026-08-13T22:15:07.964383Z","submitted_at":"2025-10-10T02:59:19Z","title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-18T08:45:51.992431Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2510.08952"},"observation_digest":"sha256:42a48f78c0431324c1602f80c5be0bea53570b5a70d47eda7673cdf747e2c8f8","observation_id":"10d87b4a-d667-46c8-9535-c829892f0597","resolution":{"observed_at":"2026-05-18T08:46:07.783019Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":"2103.03036","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-07-03T19:08:50.263178Z","title":"A survey on graph structure learning: Progress and opportunities","venue":null,"work_id":"a80db940-6bbb-41dd-8dff-467cf10bb73e","year":2021},"citing_paper":{"arxiv_id":"2605.18316","last_updated":"2026-05-18T12:34:44Z","snapshot_observed_at":"2026-08-19T19:23:36.655557Z","submitted_at":"2026-05-18T12:34:44Z","title":"Dynamic Elliptical Graph Factor Models via Riemannian Optimization with Geodesic Temporal Regularization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-20T12:17:42.594565Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2605.18316"},"observation_digest":"sha256:71ee6b8e9e4738dc4a4393c919609c6d81840eed6421f9b808a14d08b5e22199","observation_id":"968e3326-8dd8-482d-b910-9e5d4be747ae","resolution":{"observed_at":"2026-05-20T12:18:16.320437Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":"2103.03036","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-07-03T19:08:50.263178Z","title":"A survey on graph structure learning: Progress and opportunities","venue":null,"work_id":"a80db940-6bbb-41dd-8dff-467cf10bb73e","year":2021},"citing_paper":{"arxiv_id":"2605.21475","last_updated":"2026-05-20T17:56:09Z","snapshot_observed_at":"2026-08-14T00:05:10.418164Z","submitted_at":"2026-05-20T17:56:09Z","title":"Is Fixing Schema Graphs Necessary? Full-Resolution Graph Structure Learning for Relational Deep Learning","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-21T05:10:09.004559Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2605.21475"},"observation_digest":"sha256:bd140c3d6de5ee11f8209324332b712fc791c5613228d3cdf4002677058f0c59","observation_id":"77202f24-f6ff-4f13-94e8-d5c60676cff4","resolution":{"observed_at":"2026-05-21T05:13:58.619021Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":"2103.03036","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-07-03T19:08:50.263178Z","title":"A survey on graph structure learning: Progress and opportunities","venue":null,"work_id":"a80db940-6bbb-41dd-8dff-467cf10bb73e","year":2021},"citing_paper":{"arxiv_id":"2606.17782","last_updated":"2026-06-16T10:58:51Z","snapshot_observed_at":"2026-08-19T17:06:11.375149Z","submitted_at":"2026-06-16T10:58:51Z","title":"Blind Recovery of Latent Domains via Unsupervised Symmetry Discovery","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T02:04:24.179820Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2606.17782"},"observation_digest":"sha256:5da8ccb3d8d13045fca90bba8c2901af76e91fd2baa4336b6bd33c89271bb647","observation_id":"ef871b70-d7d0-42e3-89f1-36c6c886f95f","resolution":{"observed_at":"2026-07-03T19:08:50.265016Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-01T13:29:52.052843Z","title":"arXiv preprint arXiv:2103.03036 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-19T21:19:31.759423Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.052843Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:9f02bff7756dd364c993bac110cea75497d9af6011cc924de9ccf659ec2bc1a3","observation_id":"8f85cb3f-91f8-4605-be8e-a48e2217f8b9","resolution":{"observed_at":"2026-08-01T13:29:52.052843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-10T18:29:02.835408Z","title":"cheese stuffed shells","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.06917","last_updated":"2026-08-07T07:51:08Z","snapshot_observed_at":"2026-08-19T19:23:35.636866Z","submitted_at":"2026-08-07T07:51:08Z","title":"ReGraph: Learning to Generate Recipe Graphs from Food Images","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T18:29:02.835408Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2608.06917"},"observation_digest":"sha256:bd66e994ed68f6e491831a5ce0ccdcf448d4cd372e440bc5329290bcd93f2d0c","observation_id":"17086945-8cc3-43e4-acfa-b71a7d3ee6f9","resolution":{"observed_at":"2026-08-10T18:29:02.835408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-10T13:54:58.555654Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.07158","last_updated":"2026-08-07T12:26:15Z","snapshot_observed_at":"2026-08-19T19:23:38.156897Z","submitted_at":"2026-08-07T12:26:15Z","title":"Edge Sparsification via Temporal Forman-Ricci Curvature for Dynamic Graph Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T13:54:58.555654Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2608.07158"},"observation_digest":"sha256:222fb6e1f092ddee89cb05f1baffa9262ff7cc0b503f4e60b7a942dfe8971c4a","observation_id":"2461f643-1cb1-450a-a681-3ed2b56afb29","resolution":{"observed_at":"2026-08-10T13:54:58.555654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-15T14:18:38.794658Z","title":"A survey on graph structure learning: Progress and opportunities.arXiv preprint arXiv:2103.03036, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.11431","last_updated":"2026-08-11T20:53:42Z","snapshot_observed_at":"2026-08-19T19:23:26.245567Z","submitted_at":"2026-08-11T20:53:42Z","title":"AutoGrable: What Is a Good Graph for a Table?","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T14:18:38.794658Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2608.11431"},"observation_digest":"sha256:5bd4d2fa88b499f73e8e67ad0d01e9aa1b648747b45a98d8e888cc3074e3b4c5","observation_id":"d441d635-6e2b-4411-9f34-c66d4ec8a348","resolution":{"observed_at":"2026-08-15T14:18:38.794658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2103.03036/citation-record","integrity":"/paper/2103.03036/integrity","json":"/paper/2103.03036/citation-record.json","paper":"/paper/2103.03036"},"outbound":[],"paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T19:23:01.280996Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 20 inbound Pith citation observations for arXiv:2103.03036."}