{"as_of":"2026-08-20T21:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:801e8c9c49daaa19cacb0afa109c2ed241779b6fc2a2aeaa3010735cca49064f","coverage":[{"denominator":72,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":72,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:42:42.961006Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2505.12323/citation-record","integrity":"/paper/2505.12323/integrity","json":"/paper/2505.12323/citation-record.json","paper":"/paper/2505.12323"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.894700Z","title":"Graph neural networks: A review of methods and applications,","venue":null,"work_id":"d83e6620-d993-411e-a277-35d71d658357","year":2020},"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":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.692321Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:18ac61121fa1565281163f3c31ea5a1170f5a389e8282578fbac751104f9abc9","observation_id":"158a97db-cadf-4220-9a4b-ff00c63939d6","resolution":{"observed_at":"2026-08-15T20:42:43.898370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.882517Z","title":"Protein interface prediction using graph convo- lutional networks,","venue":null,"work_id":"21224e01-7a19-4583-bce4-12e42f032a11","year":2017},"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":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.696784Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:2aa1ed4dfc5b0b13fff2b3f06e7f0f758024107eff624d8204c31036105c0666","observation_id":"168be2ec-83f2-403d-9e45-f53603063322","resolution":{"observed_at":"2026-08-15T20:42:43.886717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.870318Z","title":"Graph convolutional networks with markov random field reasoning for social spammer detection,","venue":null,"work_id":"347ca880-6479-42ee-88ee-41d92aa132d2","year":2020},"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":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.700776Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:4308cce9423a4c2ebc6db9eb8b43858c7f98a392942401df9c5c8b27d013cab5","observation_id":"30e70341-2215-4d7b-8982-eeda614d9bcf","resolution":{"observed_at":"2026-08-15T20:42:43.874365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.859972Z","title":"Hyperdefender: A robust framework for hyperbolic gnns,","venue":null,"work_id":"1d7d753f-c40d-4759-953d-1932fb375baa","year":null},"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":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.704745Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:ca50209d8d03cd4fce9b632203fc7264ce3d09b7c2852e227950fca6637476f1","observation_id":"99efcaa1-5321-47c4-a8e7-21c3b3688ec9","resolution":{"observed_at":"2026-08-15T20:42:43.863619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.848493Z","title":"Scene graph generation with external knowledge and image reconstruction,","venue":null,"work_id":"8ee62830-7b8b-4534-9eaf-3fe6be15d48e","year":1969},"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":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.708508Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:33a10339261126dc9e57d961851fceb91de49a587038f81c35f9965da64684b4","observation_id":"0ac5ef67-c30b-4300-9f71-0a4dafe656ac","resolution":{"observed_at":"2026-08-15T20:42:43.852220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.837554Z","title":"Comparing statistical methods for constructing large scale gene networks,","venue":null,"work_id":"4bd67c90-7d00-4c5b-a7b2-81b7fa6832f2","year":2012},"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":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.716499Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:6dfa8b0d53c893a0d177a0dee80d8dc3f1ecc22d8c6f8ab22a85c2313469b95c","observation_id":"01ad0b9b-7b4c-4ca3-b581-d265d30ba133","resolution":{"observed_at":"2026-08-15T20:42:43.841386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.826364Z","title":"Towards unsupervised deep graph structure learning,","venue":null,"work_id":"578a58b3-b1e0-4d7f-b1d7-e1dea5b3719d","year":2022},"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":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.720602Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:2c9dc0eeea7039c9867fdf163d1d1654e4158bed7d8fd36f0fe398157fba88b9","observation_id":"b0ce888c-8d15-4a19-b125-84bd215a0c72","resolution":{"observed_at":"2026-08-15T20:42:43.830202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.814803Z","title":"Graph neural networks: Graph structure learning,","venue":null,"work_id":"34246dd7-bc27-4b40-9843-3c8d7a4c6f08","year":2022},"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":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.724735Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:6d47c40e9900af848916227409e886de9f0438ccb3602aec57230df2759a2163","observation_id":"3a4a36aa-4fe0-46c5-be56-1e5ada1aff8e","resolution":{"observed_at":"2026-08-15T20:42:43.818603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.804260Z","title":"Nodeformer: A scalable graph structure learning transformer for node classification,","venue":null,"work_id":"64cb7005-c524-49c6-997b-94fbac416547","year":2022},"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":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.728283Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:3f8da729851288c5513905749a4855a64885779547f7e6012bcfd75ffa5326dc","observation_id":"32a7c2ec-66c3-4f69-b77e-58e3ce839c7e","resolution":{"observed_at":"2026-08-15T20:42:43.807914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.793432Z","title":"Graph structure learning for robust graph neural networks,","venue":null,"work_id":"8d3f80a9-0825-476a-98d8-b7e01130441b","year":2020},"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":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.732060Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:3ae6ee26138e5f6320b3b82200a5874e58a014c39f09e331a14a962b36424ac8","observation_id":"659f52c4-c745-4f2a-a338-aa149590be4d","resolution":{"observed_at":"2026-08-15T20:42:43.797340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.782739Z","title":"Variational inference for training graph neural networks in low-data regime through joint structure-label estimation,","venue":null,"work_id":"28b61c5a-6bf4-4d02-9ad5-78464d7309f6","year":2022},"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":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.735842Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:85959ec4aad4b27253e72559fa73fa12c4100b633aabcdd5deb968833f96eea0","observation_id":"d1af8978-ad6f-4dcd-82cd-49cd277faefd","resolution":{"observed_at":"2026-08-15T20:42:43.786600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.771117Z","title":"Slaps: Self-supervision improves structure learning for graph neural networks,","venue":null,"work_id":"17b8678c-6c4d-4eef-a583-9e3bf8ccd0e2","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":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.739212Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:2e2e87b8f06fc522daed44891a37739e09737be83bc27b97a810f7ea649305a4","observation_id":"2959d64d-6324-4b74-b4bd-bf2b6d1c6e11","resolution":{"observed_at":"2026-08-15T20:42:43.775270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.760228Z","title":"Efficient k-nearest neighbor graph construction for generic similarity measures,","venue":null,"work_id":"73c35c76-c9d3-40ad-a12a-bd601dc5ab29","year":2011},"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":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.742834Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:eedfe336fe3e856b0282c390d4dd8873c40c83922442508604db9792a0d41775","observation_id":"781cca26-f52a-4750-ba94-8b0e671691fc","resolution":{"observed_at":"2026-08-15T20:42:43.763558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.749473Z","title":"Scalable nearest neighbor algorithms for high dimensional data,","venue":null,"work_id":"666e8bd2-3f5c-41e8-9e30-7356f7b6fe5f","year":null},"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":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.746827Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:1b730eb0c0bb7d22bbe6898f0e4df728263ae72285b7adaa9ea8933a0ac8f7bb","observation_id":"0cfe822e-bc2c-4012-86f4-483fb6f73ae5","resolution":{"observed_at":"2026-08-15T20:42:43.753559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.738599Z","title":"Some methods for classification and analysis of multivariate observations,","venue":null,"work_id":"7d3fae5e-6407-4b83-8d69-4cea0f65ecbe","year":1967},"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":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.750513Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:5ba093d48d43c366afba5c4c3b6f05c257ba08c91386d332d38b84221a95cc96","observation_id":"47805749-c883-4ff6-ac41-abfae77078b2","resolution":{"observed_at":"2026-08-15T20:42:43.742380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.728337Z","title":"Label propagation through linear neighborhoods,","venue":null,"work_id":"866a9a5f-bedc-46cc-92d7-c09cc937e527","year":2006},"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":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.754505Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:d9554293387372723bcfefdf3be6c671ba10da7c1aa7858a6e55b8dd9ff12162","observation_id":"f77540c6-fd58-44a2-8fa8-204322531347","resolution":{"observed_at":"2026-08-15T20:42:43.731845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.718139Z","title":"Sparse inverse covariance matrix esti- mation using quadratic approximation,","venue":null,"work_id":"5dff95f2-609f-4afe-8d51-b8a3b4df3f1c","year":2011},"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":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.758482Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:74e030aab13082d67ef591dbcfd837401b22a00c3c501395c016f2ef34230803","observation_id":"faa6b8c9-2d09-4362-8a4a-65809ff61843","resolution":{"observed_at":"2026-08-15T20:42:43.721723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.707652Z","title":"Sparse inverse covariance estimation with the graphical lasso,","venue":null,"work_id":"e73854fc-65a2-4cc4-ac47-14104926704b","year":2008},"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":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.762323Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:0065bfa693e7a1fccacf7392985f6fdf4b4e0beba424f1d38ecc085ad3b392e9","observation_id":"3113694d-e89a-4520-91c1-8d802e2e85da","resolution":{"observed_at":"2026-08-15T20:42:43.711375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.696521Z","title":"Learning laplacian matrix in smooth graph signal representations,","venue":null,"work_id":"e3ddae12-ca7d-4274-8817-5a4c903b35a9","year":2016},"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":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.766283Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:6c15bba79f9575682aa12a8b5bcb2f4963a244a411d9005e007066be845fce7b","observation_id":"a9eabcdf-310e-44f4-9334-f3b3692c7ac5","resolution":{"observed_at":"2026-08-15T20:42:43.700409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.684521Z","title":"How to learn a graph from smooth signals,","venue":null,"work_id":"dd9ba12a-7f47-406d-82a3-62ecd1434392","year":2016},"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":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.770022Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:c98aa9bf1078563cddff3f5067326b4f3abc3bd49efeb3c4fde5e6a5a3537a2b","observation_id":"9fee8136-6380-45d2-b3af-38e84b174a94","resolution":{"observed_at":"2026-08-15T20:42:43.689116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-20T05:03:07.401482Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-08-15T20:42:42.773690Z","title":"A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation,","venue":null,"work_id":null,"year":2024},"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":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.773690Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:99a69d83f1f6d327b46c2abc48b360e49b2c6d768f4385635225bcf3949ab614","observation_id":"3e949ab3-7c31-4d78-81a9-49992e24d79a","resolution":{"observed_at":"2026-08-15T20:42:42.773690Z","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-15T20:42:43.562246Z","title":"Community detection in graphs,","venue":null,"work_id":"10515d3a-f197-4c97-a89b-26034f44df84","year":null},"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":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.778012Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:f6e516ed971d6dc34f5663bbcf0cfcba4120344f89bc49983a2e477815bdfc84","observation_id":"36ac8c63-5568-466f-893a-07e134f751a9","resolution":{"observed_at":"2026-08-15T20:42:43.566000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.550681Z","title":"Graph clustering with graph neural networks,","venue":null,"work_id":"4c73f001-e482-4444-a7ec-d31eaac54c30","year":2023},"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":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.781815Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:68ec919bffaa5e61ef81b5c54e90c989d4814a6041a0574f23a4ea762f3c7e6e","observation_id":"3d04ecdd-f7e6-4549-868e-63571a4d1d83","resolution":{"observed_at":"2026-08-15T20:42:43.554854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.538994Z","title":"Spectral learning,","venue":null,"work_id":"a86b39e7-d8eb-42a2-9f45-f9839a7c51cd","year":null},"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":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.785296Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:5981b18094cd0ad4c2661073f28d91eb49054dd76e5b9d550735911e9b49b0bb","observation_id":"fe1a3092-0894-4b23-84f8-8e36c41c28a2","resolution":{"observed_at":"2026-08-15T20:42:43.543363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.528041Z","title":"Constrained k-means clustering with background knowledge,","venue":null,"work_id":"4558be0a-96f2-4d93-983a-e35b335e9b7a","year":2001},"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":26,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.788901Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:6eaa1a78f72965fd88f14f00fad9122083cea0dfc50e09c4e7231db4d1069a16","observation_id":"c63f1e5b-ac6d-4c64-be0f-a5c6e5337298","resolution":{"observed_at":"2026-08-15T20:42:43.531731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1312.6203","last_updated":"2014-05-21T16:27:09Z","snapshot_observed_at":"2026-08-14T23:50:42.645895Z","submitted_at":"2013-12-21T04:25:53Z","title":"Spectral Networks and Locally Connected Networks on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6203","snapshot_observed_at":"2026-08-15T20:42:42.792384Z","title":"Spectral networks and deep locally connected networks on graphs. arxiv,","venue":null,"work_id":null,"year":2014},"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":27,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.792384Z"},"links":{"cited_paper":"/paper/1312.6203","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:f943bf839dd81570b2649d243847ade742d40bb9d4ed5c33466aeb074abaffb6","observation_id":"36c9686e-2d25-4a3b-b565-feb466c7177c","resolution":{"observed_at":"2026-08-15T20:42:42.792384Z","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-15T20:42:43.517412Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering,","venue":null,"work_id":"dd428887-30f0-4c80-8cd0-746d966f3604","year":null},"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":28,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.796612Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:33dca563ffd77b1e396b54e4b66e8873fbc14816cfbcb0c69b1b952dde101b52","observation_id":"75d35575-8cf6-445b-a943-b8a9bd8760db","resolution":{"observed_at":"2026-08-15T20:42:43.521147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.506788Z","title":"Graph reduction with spectral and cut guarantees.,","venue":null,"work_id":"7d6214ac-2f05-4931-8523-e3389a2fba34","year":2019},"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":29,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.800582Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:36db5355f66a679603eba3120abbe1e79d0eb3792c75bcafca48b89dace456ff","observation_id":"6880a595-ec8d-4cee-b964-975f9987865b","resolution":{"observed_at":"2026-08-15T20:42:43.510343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.495524Z","title":"Linear complexity framework for feature-aware graph coarsening via hashing,","venue":null,"work_id":"dce93480-01c4-41f8-8c09-a0c0e1e42e50","year":2023},"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":30,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.804577Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:bc9cc58eaf9e97917c192c0394ef4dd077743299773054c64e4203126269968f","observation_id":"c71e826a-4bf3-4c65-bfd1-b88e4a515b03","resolution":{"observed_at":"2026-08-15T20:42:43.499363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.484372Z","title":"A unified framework for optimization-based graph coarsening,","venue":null,"work_id":"867953fe-e10a-4f34-b112-a43e74db7d83","year":2023},"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":31,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.808488Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:519d747140705e46b57aa963658ff44277abcde98dd2ec963f4d6971124939c0","observation_id":"83851afa-e031-491d-b4c9-a909797aa8dc","resolution":{"observed_at":"2026-08-15T20:42:43.488107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.473457Z","title":"UGC: Universal graph coarsening,","venue":null,"work_id":"da52acf7-0f9b-4d32-b51b-5a1a66e69118","year":2024},"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":32,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.812113Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:00a087b2d3aa78afc770af94b7ad2d804d70554a11240ea754b643975f74674d","observation_id":"fdd753f6-7ea2-4fdd-b0e9-d6876d863ce9","resolution":{"observed_at":"2026-08-15T20:42:43.477306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.462526Z","title":"Semi-supervised learning using gaussian fields and harmonic functions,","venue":null,"work_id":"da10815e-df32-42b3-8c81-b36528961520","year":2003},"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":33,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.815726Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:59f72602208af38d8a0557b77ef75f04fe2e537b4ca38296b3b2454396a73a0d","observation_id":"25651503-1ce3-4829-95d9-1e47c6009646","resolution":{"observed_at":"2026-08-15T20:42:43.466128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.451601Z","title":"Koller and N","venue":null,"work_id":"b41453d4-3392-482f-a460-9ab5772a51bf","year":2009},"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":34,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.819295Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:14f02e513a89f002cf2aa0fc2fd06b00e54d4ea288d1a6fa674881d2d96158c5","observation_id":"b3a73d09-5ebf-4545-b53f-a8a8511e3435","resolution":{"observed_at":"2026-08-15T20:42:43.455311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.440774Z","title":"Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data,","venue":null,"work_id":"8b8d59f3-e42a-4d22-a32a-a79db8b78fec","year":2008},"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":35,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.823136Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:7b4064e9a6eb619c32963f560343336b5bb5cff54fec54819d71a08a84876526","observation_id":"0fd040b8-985d-40eb-8558-34b0c3d9fafe","resolution":{"observed_at":"2026-08-15T20:42:43.444781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.430222Z","title":"Covariance selection,","venue":null,"work_id":"b4c731d4-5758-412b-898b-46388784fc36","year":1972},"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":36,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.827340Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:7f161e76e5d1365960202aca035c95f5d260db448e5b1bdb6f212c3b27af5762","observation_id":"5dfb2b46-dd3e-42c4-ab8a-b89b860d2166","resolution":{"observed_at":"2026-08-15T20:42:43.434001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.419576Z","title":"Manifold regularization: A geometric framework for learning from labeled and unlabeled examples.,","venue":null,"work_id":"3c838157-d9b0-4ece-9f92-6a7125a1914f","year":2006},"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":37,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.830950Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:189bae5d3eb03413110ef4f94a284026a2d131726e7e40204b13aef48cacbe18","observation_id":"d4341e80-2be1-42f0-adb5-74ab37bd2127","resolution":{"observed_at":"2026-08-15T20:42:43.423233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.409303Z","title":"A graph theoretical regression model for brain connectivity learning of alzheimer’s disease,","venue":null,"work_id":"ca4492c2-5d61-4769-b218-6d573f3289bb","year":2013},"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":38,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.834659Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:a5bb09135b7c8bc7f514703387530a0456c151d4b333675a017c171294e888ac","observation_id":"10f91381-5f4c-4c0f-b378-398fc9bc4f70","resolution":{"observed_at":"2026-08-15T20:42:43.412905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1904.07734","last_updated":"2019-04-15T12:22:36Z","snapshot_observed_at":"2026-08-14T16:46:31.118689Z","submitted_at":"2019-04-15T12:22:36Z","title":"Three scenarios for continual learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07734","snapshot_observed_at":"2026-08-15T20:42:42.838415Z","title":"Three scenarios for continual learning,","venue":null,"work_id":null,"year":1904},"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":39,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.838415Z"},"links":{"cited_paper":"/paper/1904.07734","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:dfbb9d27affcc96c5b263eca3100acf5189d80b930fab6ffb50da50f51602a8e","observation_id":"8c384fda-758a-4df4-8602-a049a4479047","resolution":{"observed_at":"2026-08-15T20:42:42.838415Z","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-15T20:42:43.398337Z","title":"Cglb: Benchmark tasks for continual graph learning,","venue":null,"work_id":"bbd8f903-f89f-412f-ae24-7fd1f0fb51f2","year":2022},"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":40,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.842779Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:866da9b47f11593943019447541e1157c6b30a5fb5fe427f4ab14fc5c8371a3c","observation_id":"85a99760-87d7-40ec-9eb1-2cc4e8f7759a","resolution":{"observed_at":"2026-08-15T20:42:43.402099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.388092Z","title":"Continual lifelong learning with neural networks: A review,","venue":null,"work_id":"10576cbb-53f6-42da-8f4a-940e8dd5938b","year":2019},"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":41,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.846230Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:c587bab46ef26ad1a515784b9256df3149dcf42c0b1d584910d2ee272602467b","observation_id":"1c1b85b3-0e7b-470d-b47d-57253ea50f21","resolution":{"observed_at":"2026-08-15T20:42:43.391535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.377748Z","title":"Dygrain: An incremental learning framework for dynamic graphs.,","venue":null,"work_id":"cd323043-4a5e-4d64-a7b1-752a2fad5052","year":2022},"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":42,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.850107Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:6478a6b5236a8c57cdfc4d30d2f2d0f903c8108bc144e8c05a95733f8470d63d","observation_id":"6207c43e-3b61-4324-9ce8-c2f3d6d73e7c","resolution":{"observed_at":"2026-08-15T20:42:43.381348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.367335Z","title":"Continual graph convolutional network for text classification,","venue":null,"work_id":"5b938e4b-a390-42aa-a2ba-be2bc0df4f35","year":2023},"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":43,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.854496Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:85471d1955010e4b049308ffe9f015949879a38c580007ceedefda9b8501c0f8","observation_id":"9afbf9e9-5c9f-43c5-969e-33cf476cf488","resolution":{"observed_at":"2026-08-15T20:42:43.370928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.357284Z","title":"Roland: graph learning framework for dynamic graphs,","venue":null,"work_id":"d271d381-62a2-4950-ae15-a3bd3d10faaf","year":2022},"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":44,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.859445Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:4b6eea20c5ce9bf7f392c92d471d6af4f4be73197226b4068f9ee4cf5ed410d0","observation_id":"bf90003d-b532-4c27-b301-0d93c9796995","resolution":{"observed_at":"2026-08-15T20:42:43.360906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.347432Z","title":"Temporal recommendation on graphs via long-and short-term preference fusion,","venue":null,"work_id":"ed136bdb-aa3d-4a16-8768-84d3d6db873e","year":2010},"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":45,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.863545Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:b5d8fb14018659907a5d7776c8455ec20b77ed91c6bbf354e32b9a7a0ea189ab","observation_id":"932ca1c0-8f1d-425e-8f8a-9579a894ac37","resolution":{"observed_at":"2026-08-15T20:42:43.350948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.337080Z","title":"Microsoft academic graph: When experts are not enough,","venue":null,"work_id":"21e0b8e1-7fe3-4bef-87ff-c5855bd99a53","year":2020},"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":46,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.867241Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:74f12a0609a2e027b2063da110f320adbfcd46ac20c82af53b81e38ff5dd4db6","observation_id":"e4a2f483-e5d7-4c91-a3d0-08b397f24b8a","resolution":{"observed_at":"2026-08-15T20:42:43.340548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.327453Z","title":"Spectral clustering with graph neural networks for graph pooling,","venue":null,"work_id":"328abc23-d6ac-4ef9-b2ba-1b4b78a24836","year":2020},"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":47,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.870945Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:20162df63a420df9f402f6202bfd51927f62ef34df47a6e94055560e9d428e69","observation_id":"bf0afac2-21c0-4621-aa86-53233b264e3e","resolution":{"observed_at":"2026-08-15T20:42:43.331016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2207.08779","last_updated":"2022-11-27T12:50:22Z","snapshot_observed_at":"2026-08-19T02:45:38.689264Z","submitted_at":"2022-07-18T17:36:54Z","title":"Simplifying Clustering with Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.08779","snapshot_observed_at":"2026-08-15T20:42:42.874418Z","title":"Simplifying clustering with graph neural networks,","venue":null,"work_id":null,"year":2022},"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":48,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.874418Z"},"links":{"cited_paper":"/paper/2207.08779","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:5d60128180aea2aa15929a2866bbb62b3c2f92a0087b05cd38937cd68838e597","observation_id":"463456d4-6f73-4aec-a3d6-b479fdc1646a","resolution":{"observed_at":"2026-08-15T20:42:42.874418Z","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-15T20:42:43.317747Z","title":"Modularity and community structure in networks,","venue":null,"work_id":"a478ca83-758c-477f-967b-f2cbfcfe67ae","year":2006},"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":49,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.878399Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:195bbb4322ac3b7a744d19e5f45ae57ec90d46e3953dc50af554925d01a748f7","observation_id":"c280be13-969a-4525-8f02-2fe6cf60642e","resolution":{"observed_at":"2026-08-15T20:42:43.321077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.305741Z","title":"Consistency of community detection in networks under degree-corrected stochastic block models,","venue":null,"work_id":"57da3396-6ea6-49bc-afca-457c30a5047a","year":2012},"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":50,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.881621Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:1702ef2b9bee5ad70b856d39e3af3e21f2331860cf3a001f6fa0777196562eab","observation_id":"6498249d-6c7a-493b-be5b-c83b4b545d23","resolution":{"observed_at":"2026-08-15T20:42:43.309916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-15T20:42:42.884941Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2016},"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":51,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.884941Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:a697138e65c26de783c91867b8178c2db0fd1a412df9823637de558927c3c723","observation_id":"73807f6b-b7d1-4ba9-9480-57a2075740a4","resolution":{"observed_at":"2026-08-15T20:42:42.884941Z","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-15T20:42:43.295467Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":"fb5c353e-3ac9-459d-b514-e7072ee81efe","year":2017},"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":52,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.888784Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:34500569675327b4914dd9168c79b1891cc72fd411e22e1a43ee778148cbad34","observation_id":"fd878c7b-199e-4523-b246-d0e7e10396df","resolution":{"observed_at":"2026-08-15T20:42:43.299088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","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-15T20:42:42.892320Z","title":"How powerful are graph neural networks?,","venue":null,"work_id":null,"year":2018},"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":53,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.892320Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:f7c38e68df587c500b6ebd1ea8f11d4bc7de3a292df23fe029dcc41cce70fe2a","observation_id":"ff769a0f-5219-480f-a831-c847ae933fe9","resolution":{"observed_at":"2026-08-15T20:42:42.892320Z","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-15T20:42:43.284929Z","title":"Graph attention networks,","venue":null,"work_id":"ef7342f0-55b6-4e9f-995f-5117fcdf7207","year":2017},"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":54,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.896060Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:4355e708d5f8643e71d1a15f85870175f54b3bdedc8836791fb32fc8cbd69fe3","observation_id":"8d93322e-6438-49fd-95a1-744c2771ac27","resolution":{"observed_at":"2026-08-15T20:42:43.288686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-15T20:42:42.899699Z","title":"Graphsaint: Graph sampling based inductive learning method,","venue":null,"work_id":null,"year":1907},"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":55,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.899699Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:e9916ae4b6b3c9ddb213373455660c0129d396578886d920a40fb2139329119f","observation_id":"d41d32cb-86ee-4450-ae52-aed3bafa8f4d","resolution":{"observed_at":"2026-08-15T20:42:42.899699Z","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-15T20:42:43.274132Z","title":"The extreme classification repository: Multi-label datasets and code,","venue":null,"work_id":"5b08e172-a27d-47b5-9a93-214e52bddebc","year":2016},"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":56,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.903204Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:7861f14aea20f7bcd06064f9c216c469fa70892ab42d35ece3c20e1fb69cb1cc","observation_id":"d0ef45fb-04ed-4922-89af-09ca6772a187","resolution":{"observed_at":"2026-08-15T20:42:43.277983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.262353Z","title":"Conductance and the rapid mixing property for markov chains: the approximation of permanent resolved,","venue":null,"work_id":"5db988bd-7e5e-40df-ac3e-0dde9392a6df","year":1988},"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":57,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.906594Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:23832ffd43caa3a5bf92b99349defa2c2f81a7a20a430ae4cb57e1707c5a7e39","observation_id":"4f86bfa5-3bd3-41e6-9eb5-7d88c87bd42d","resolution":{"observed_at":"2026-08-15T20:42:43.266598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.250161Z","title":"Visualizing structure and transitions in high-dimensional biological data,","venue":null,"work_id":"fcaca857-fcb5-456b-a748-bf9303ae85a7","year":2019},"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":58,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.910518Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:d0c3588acbfb6d7f232b08105205b753afdd00607694a57cad01f27ba8e7c524","observation_id":"88e05171-d926-45fc-bbfe-4abe5635a20d","resolution":{"observed_at":"2026-08-15T20:42:43.253947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.239180Z","title":"Mnist handwritten digit database,","venue":null,"work_id":"28b1f2df-b9d9-49d2-8a88-157bfe7d783c","year":2010},"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":59,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.914229Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:a8db70f132e86877605d813a7a63d9311da549b5cd84e38c1104805bb42cd47f","observation_id":"646b7e09-0b98-49c4-85ee-578173cec839","resolution":{"observed_at":"2026-08-15T20:42:43.242787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.228437Z","title":"Glove: Global vectors for word representation,","venue":null,"work_id":"0839cedf-4851-4e3a-9878-57cdb7616f91","year":2014},"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":60,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.918107Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:a44328a3a2072edd7977f42ae0c4cdfec58bd1b42a97f19f55b8fdaebb188953","observation_id":"df70c83a-8f86-4799-aec1-a4c4af2d173e","resolution":{"observed_at":"2026-08-15T20:42:43.232230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.218200Z","title":"An information flow model for conflict and fission in small groups,","venue":null,"work_id":"1f1993bf-e12a-462f-93c0-2459acd1bfed","year":1977},"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":61,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.921665Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:a9fb5af333ae1791f35c897766d1b828da4fdf73184b79a6c1bfed603740f85a","observation_id":"f4076129-fe2d-428d-8ac6-2e467c7ae611","resolution":{"observed_at":"2026-08-15T20:42:43.221686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.207418Z","title":"Locality-sensitive hashing scheme based on p-stable distributions,","venue":null,"work_id":"b20f1175-a585-45e8-99ec-da7f8bfc4860","year":2004},"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":62,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.925210Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:46f638cc1988baa8d5fa0df645d1825e51ab42285abdce0a9e06c9adc5fd14a1","observation_id":"d8900ce3-63e9-4195-b958-7a3b82e7ccc0","resolution":{"observed_at":"2026-08-15T20:42:43.211288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.195439Z","title":"Link prediction in complex networks: A survey,","venue":null,"work_id":"e7fb6a42-993d-422a-8776-cdea17e5fc03","year":2011},"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":63,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.928648Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:f1a65c1a5b98f6abdf8b93d2622d8eda95341085a2d5fff7e639534905c786e1","observation_id":"eb7851dd-45ff-473b-910f-8e7b83e0e82c","resolution":{"observed_at":"2026-08-15T20:42:43.200322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.184159Z","title":"Graph classification using signal-subgraphs: Applications in statistical connectomics,","venue":null,"work_id":"240059c5-301c-4ee8-aa07-682c501aa25d","year":2012},"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":64,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.932189Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:8b4af93fbc17e534845c520bbf90480985427a64d231b7b9e83361766054a75b","observation_id":"ca64c4f8-7bcf-4c31-828d-9ae4e62aa3b7","resolution":{"observed_at":"2026-08-15T20:42:43.188077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2110.07580","last_updated":"2022-09-27T20:48:28Z","snapshot_observed_at":"2026-08-20T05:06:54.046753Z","submitted_at":"2021-10-14T17:42:14Z","title":"Graph Condensation for Graph Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.07580","snapshot_observed_at":"2026-08-15T20:42:42.935478Z","title":"Graph condensation for graph neural networks,","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":65,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.935478Z"},"links":{"cited_paper":"/paper/2110.07580","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:eb1f8293aca0c9ab6f2c4f165a314d8402bf31958aeeb29daab91c1c3902a999","observation_id":"34a3301d-bdf7-4f01-9685-5b1534a9e5fe","resolution":{"observed_at":"2026-08-15T20:42:42.935478Z","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-15T20:42:43.166024Z","title":"Revisiting semi-supervised learning with graph embeddings,","venue":null,"work_id":"d7945cec-8823-458d-9a0b-260614c6dba7","year":2016},"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":66,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.939362Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:2e683b73554bc1f40ed1627d4071629833adb6efc892230fce76642137b3efe9","observation_id":"355710e6-afce-4629-96e3-7d2e28e70504","resolution":{"observed_at":"2026-08-15T20:42:43.169980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-15T20:42:42.942784Z","title":"Pitfalls of graph neural network evaluation,","venue":null,"work_id":null,"year":2018},"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":67,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.942784Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:c1e4bcbb54c0e1f8716521e03d4028b1818dbf2942b8796dc52c46de8190d235","observation_id":"7f694922-519e-442d-9ed7-f2dc62fc6568","resolution":{"observed_at":"2026-08-15T20:42:42.942784Z","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-15T20:42:43.153863Z","title":"Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding,","venue":null,"work_id":"59bbcd0a-9da7-4a00-818b-9922dec3ec8a","year":2020},"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":68,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.946960Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:98c42170e08fe03b463b7ff2614b96d4e3905712aee6554ba5f014292344a2d7","observation_id":"71f9eb48-3af1-4559-bedb-6646bfcb22d8","resolution":{"observed_at":"2026-08-15T20:42:43.157637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.130924Z","title":"scbert as a large-scale pretrained deep language model for cell type annotation of single-cell rna-seq data,","venue":null,"work_id":"6f416c57-e979-4068-af8d-47d65d09e46a","year":2022},"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":69,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.953901Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:0f8c2741f4b1cfb0cdbd285eb0b77bf011112214b5234599d75177e493b84861","observation_id":"c102510d-85b1-43b4-af00-63385bbe2533","resolution":{"observed_at":"2026-08-15T20:42:43.134849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.119752Z","title":"Pygsp: Graph signal processing in python","venue":null,"work_id":"a78bb6eb-a631-47c6-98b2-91d499d21329","year":null},"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":70,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.957464Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:4c6b24de8f94378fa0d2acce3377eac7684d0a924bc02998edbc342624737499","observation_id":"a35d938e-46b7-4d57-b58d-aed898e41c28","resolution":{"observed_at":"2026-08-15T20:42:43.123521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.106643Z","title":"Collective dynamics of ‘small-world’networks,","venue":null,"work_id":"a0eaa9c4-1baf-47d6-b3b9-f451039d5ad3","year":1998},"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":71,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.961006Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:c25b04ab3fd7963279564d585d8b62975080bbd269d723b6e561a822e8aa8971","observation_id":"10be45a5-ba95-484a-a3f5-d78548348429","resolution":{"observed_at":"2026-08-15T20:42:43.112241Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:43.142629Z","title":null,"venue":null,"work_id":"28463d4c-b0a5-4fc5-990a-4461bedbe8ad","year":null},"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":2020,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.950230Z"},"links":{"citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:7022c0e45cca8d42326a7043ffe4dc9f1de399d65001a3d7d39f7fa2abaf3394","observation_id":"1c7c7ae7-6d9f-44f4-bc3a-5cfbd871ba95","resolution":{"observed_at":"2026-08-15T20:42:43.146248Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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"}}],"paper":{"arxiv_id":"2505.12323","last_updated":"2025-05-18T09:33:10Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":72,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":10,"verified_exact":0,"verified_fuzzy":60},"total_outbound_references":72},"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 72 of 72 outbound references and 0 inbound Pith citation observations for arXiv:2505.12323."}