{"as_of":"2026-08-19T02:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d7eb40a8a02c23f633a0a91ef1903b3d57bf4520f1f1fba8c72a408d8e381cad","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-18T06:34:40.430872+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-16T18:58:52.063980Z","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:f96dc6307038f42d4a112766f45905aff596041611624141afdf6eb126a30d22","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:97b3dc8b825ad0b0d063a2a6aa705f20066f7af0bafed0095ce7a097af0b39b8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:d56620d74774efcde5c423faa09325aa3359e08996728fe90ef093b6e1fce6ec","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:9865b13d60fd9e3ab12bf2181f84e7c1a35721d3a6639730e7f0c641734802d8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:a5bf3c7c25412c2e625e5b9cb3ba8bf842a2b32366487b72f0e2fc7f62ded393","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:41:16.024888Z","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-16T18:58:52.063980Z","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:fbea33e0fe53caacbea9b696c93f47303dd2b2ee659b44e6b5a4da195e5db31d","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-16T18:58:52.063980Z","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:dce60154ccb988ec7d7e22f1a652d14cc67f2983e874d1e03ed66bf4410f1648","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:ff173f9d82321e92e09074d4b269c8a06281679887fe290c2321820acfc3aeff","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:cdfdb7624ec44d739047fbebe89ad6d112ae8c5e8181f52e414b85380c7647ee","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:1531cbbf2c1c6ab2525e8b3fcfe9f6e72056517c05945b60d11039cd0d90aa60","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:7e6c0525de617794af5a3c2ccdfd7cb0027da135fadb3879fc0cf3317e05e306","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:cb22753be9f78368709736e81a2760716bdb5668ec4d31651a365f35342c15f3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:46392ffbefaf72b584529308cba1643e4b49ba86ec22ddbf0f77a160f37ce330","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:49fdfb7f118309092e271259ee343197cfbe457a267fa0bade3992918f082ce1","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:038671c16dc248d2e2e2b8fba89cc9531f9261338ff3b5a01d12137f2525ecdc","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:17df7a1790fcc440ea84ebf1afc13cf0614808c92053e3725d274cebc46b1aaa","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:0f25edb48c1acf40c156d66d18ce1c0138954ff09c8b0a9051fb4a84984ce33b","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:4fab16157577e0d05a7de518315658f309075f6a9891e8ebb6dd9abd31afff60","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:f9f3f1aa89866850a219e6d77f8b4960eb51674ae9a0ff32b06c432ca165e5ab","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:03892e915a2ebf49d578c0f3e163d6e1105fe35c9b6a4e4cf626d65098fac714","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:3eeba42f2f1b33237da0dbf99431bae450b1830dc56a70d96d2467b6038ae12e","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T14:23:49.046360Z","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-16T18:58:52.063980Z","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:e8ca7ba1b510668a87b2007c154f33820f7c6b2bb12b38b2b60b07f6847a9238","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-16T18:58:52.063980Z","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:2d5d2933c816b6d30fa8a04feae7e34226c0a8fccdd0761debfcb629935c57ea","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:16eb698600daff9cf83cb1bb2991bd9025f1568827fded46410525e389528d97","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:21ececbc9b3d7f8d12cd2df159e845b3a3972f93fc5722f76203c46659ed395e","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:9d05f9405cbf05ea68f07a885798beb80c0386dd5ce9c3986e5507c3532b5c76","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:ad10ad4bb56125dc6e6dec5d6ec4b1e39d1946818a771a1859bacb94358df086","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-16T18:58:52.063980Z","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:348ad3ebeee0ed429a16a56bae9086b921d66202a26198d0f3448b13629781ff","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:01c493e6ab34723a758a5627879e18dc25a79f3430a6492a7c3dfa8e9c47a806","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:bef8f37ff117fb66539b3b88b163c88277bfd1208a03efdee64247b5c1a6ddcb","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:e5cd5e493b29d933d20acf927c29df12d5f804368a9cea3746f06c0ab5142a4a","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:e8a7505999a647dc1d276deab99f5f37e9d060dcc2444fb50ca0bb6598033686","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:785a63ef23e0c25ea9f8319e8e4165181d87fe9d80c15df83c3a4320bb10cbea","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:b7819001078fe1d38995f283660dfd384dfeba36d60c8792ef2605ac0392c868","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:6f6d1d2e45ae25a67e69f136e899af94b778322550307cb28da36f9ddde20b9d","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:55730ea5b83d20606006764cc7c0ee43d0e2d64d3bb1d01cc9d75fdd8ba8365a","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:b16d9d48dcb850d5aa38666d395031b828dac41b72de326bcc94dff04225104c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:db09bbdb8b030d48925de639537ca0fd910a10803961ae7342f025aa85d60acf","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:1b1f679df0d11d8bc822ed8529e71c303ebbcc777a0d55a4cf153c0f0acf22eb","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-16T18:58:52.063980Z","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:9a94582f372623c6ff84490fdbf9d876c1e7011940d80ee0c485ac7b0c0d0318","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:b682850af16de46b362874209cc8c30adbff1be270f5e73810c9b7d978d8753f","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:e6eec4263d29551bd167be4e30d4a1d6032a1424dca12da4b608634b7cfd9bd9","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:b0fdb7d0c2ed191a3734de8367ceaca02ea97af47bd78958ccc86f379caa4d8b","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:56b0b1fe1b210452dfc22f2e19574dab724a9030d32ea4f3c7e9bb38c68edef3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:ee2a24803f8af58b55eab208c3e3f5f2ee02a0deb70b4b17d6596141e731bfe7","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:d4c08e221ea4fc026194eaee5330a8b35497fd1da01af481322dc2fd02ca1859","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:57b33c236ae72af31e1f02b60f02b35aa161c5c5a5929bb34e1be6687a321479","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T16:45:05.059342Z","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-16T18:58:52.063980Z","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:930d7adf225b27c21f0b1c2d97d6902507a65401c624281dc8099f0ee6b9a3ce","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-16T18:58:52.063980Z","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:d0d263e0bb604b3be60a86ffb28e4f43d57b6c47819e7319a58c0b58119cd6b3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:dabebade3012081be1d761513d6345d552a184261926d588d992ad9e8f5017c5","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:89349662b6dee791b8fa8a200c037d9dc4a4832e4afbab675dc40fdb2c0f8326","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-16T18:58:52.063980Z","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:9c917909d9f388a13b5f5b01c41720a8ba1381f4a7705e263620860cec53df31","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:c0e52228e30639925fb5ff7d148b5081ca2ddd2b4d0dcb7b0cafb04ed2c7d75b","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-16T18:58:52.063980Z","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:7e341ffe50198f3bf190c1e7b4cfc3b2ff6d572371e4a03351e7459f0379328c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:0630212e4eb582475e3214b8923b5e43a5f88dbc4d0dcbd026fe84847034e237","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-16T18:58:52.063980Z","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:cb9732df77e8cb455990c52f8b1f13c46edfc9a60e79ab8d148eff7ba97a8f06","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:70628dd3b6929976f7a4ee15c9f6b499d76f62c2964b73e483ca6307fa4356d2","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:9cb094954fcfb5ee0486fc2e434f676b2d35bdaf7197382ca9fd63eba35e1a38","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:03329ca7da9710b487a667bd76933354bc80fdd70da14c18b17e1c5e023f72d7","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:26494878e905e121eee24350f9d669764e396908f526d3e6f09b8d9096f8401a","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:530d1c5f621f2e3c08f0cbfb3cbba2b356670a444beea8caeb298eefff5025bd","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:dd496b4b7d0757dbf56eb1c8328a7118bb0ef18da3711a941f2ce71d7dc3d449","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:8ef91c41e306f665c8d2dcf23139fca7005c8311a5d979f1a03bebe8772d2cf2","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:7bb1fe802f2e9f31d021849e38afe24dabda1c7bf9d1d869ba86b32855cd5821","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T17:49:14.885073Z","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-16T18:58:52.063980Z","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:7ead194393be080411d3f7c59f7714d7dacf53ae91c6aef4151944df79f8e4c5","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-16T18:58:52.063980Z","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:b8c43018c5a72d8f43169bb280eaf50f41206211b4f2ce7b992f434e7625f0f6","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:9bc0e9e4099548b3bc3c01f2cfcff5f1d7ab6c31c258867c9bedcd59eb37a4ff","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-16T18:58:52.063980Z","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:07a365791ab65926d9127a0bea0bd297f5e25389a0b32c12b2b13972db083f2e","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:c595b6ef2f3d16b64342deca39efc233e2beaa85f56cbc0686e1459bedd5e459","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:30418ce9894eed32839f1aec43071b23bd27a298b23a14abbf4c0ac2948bd31c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:e983fe4e22599050c7bb1319da2504e59c86d22221487108801bd5a4363a8825","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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:69c96c429fd9dadae2fbe6156ee780800918679ff532f06bdd6f87b3523212f4","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T18:58:52.063980Z","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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 72 of 72 outbound references and 0 inbound Pith citation observations for arXiv:2505.12323."}