{"as_of":"2026-08-18T11:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cbe37d09ef1503db1fc6f0d8b6f75d5df7926ee42a48b184e1c5601b50ff80fa","coverage":[{"denominator":85,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":85,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T00:03:13.278727Z","state":"measured"},{"denominator":85,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":85,"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/2605.31016/citation-record","integrity":"/paper/2605.31016/integrity","json":"/paper/2605.31016/citation-record.json","paper":"/paper/2605.31016"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.10286","last_updated":"2022-09-21T11:55:18Z","snapshot_observed_at":"2026-08-16T16:30:57.848194Z","submitted_at":"2022-09-21T11:55:18Z","title":"Influence Maximization in Real-World Closed Social Networks","version":1},"cited_work":{"arxiv_id":"2209.10286","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.10286","snapshot_observed_at":"2026-06-29T00:12:50.269601Z","title":"Influence maximization in real-world closed social networks,","venue":null,"work_id":"bb071dc4-4f1c-48ab-b4c0-6cf9cd7bd4c5","year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/2209.10286","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:d887e18f6f6958384bef7de9305712eb35cf303997ede8a19a3e1ea58eff862b","observation_id":"1c22d5fc-d61d-49dc-a502-e36c3ca1096b","resolution":{"observed_at":"2026-06-29T00:12:50.271016Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Do transformers really perform badly for graph representation?","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:d4fb7715029f5eca10f2e71fa118c3fed780d41ae86804b5fbb5a7afd5ca2f1a","observation_id":"a57b13a5-61e8-4e71-95aa-95fce6c73226","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Graph neural networks for social recommendation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:6d683bb4b8f30765dcb7ddcefca2e248b9550a888ddb53e83a1c4efb9f9a7478","observation_id":"c6184815-9e19-4b06-a484-6bb0daeea64d","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.10733","last_updated":"2021-09-08T07:18:10Z","snapshot_observed_at":"2026-08-16T18:01:18.046143Z","submitted_at":"2021-08-24T13:46:19Z","title":"Graph Neural Networks: Methods, Applications, and Opportunities","version":2},"cited_work":{"arxiv_id":"2108.10733","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.10733","snapshot_observed_at":"2026-06-29T00:12:50.258066Z","title":"Graph neural networks: Methods, applications, and opportunities","venue":null,"work_id":"0f29df3d-3521-46ea-9679-8d8ed5fc5429","year":2021},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/2108.10733","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:262140c987c8a86feded4f0f308a33280b7309dc6c96af447bbcf610c0d0be91","observation_id":"5feee503-0438-4b88-a2e2-36163835b97d","resolution":{"observed_at":"2026-06-29T00:12:50.259461Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Nas-bench-graph: Benchmarking graph neural architecture search,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:09eefef7e1680bbde5b4236cc200d8db2d65b7b830ed20cac047494e9652f23e","observation_id":"6bb11a07-09e3-4394-a74d-453ed89c120c","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Remember the past: Distilling datasets into addressable memories for neural networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:9d55ae14a53dda0c770f75c8ea191c4841d5be98dee3125adff1bcd2dfde8e7a","observation_id":"68d6ec97-ce49-4741-9ffc-abd4dc4cfe6a","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10959","last_updated":"2020-02-24T23:25:50Z","snapshot_observed_at":"2026-08-18T06:11:01.992422Z","submitted_at":"2018-11-27T13:17:45Z","title":"Dataset Distillation","version":3},"cited_work":{"arxiv_id":"1811.10959","doi":"10.48550/arxiv.1811.10959","metadata_source":"pith","pith_arxiv_id":"1811.10959","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dataset Distillation","venue":"cs.LG","work_id":"e5036812-7ef1-4616-8677-c754d141d74f","year":2018},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/1811.10959","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:732675cd952a1030260787f2433a0da17b708004e64f9bfc6505fc2205a6c995","observation_id":"bfab1cc5-5d40-49b1-8ba3-d63b99118618","resolution":{"observed_at":"2026-06-29T00:12:50.278636Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Does graph distillation see like vision dataset counterpart?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:86d219417cb669bb5b55e1cc039ee260c77623f2a6a7f3f4f264ef8b3b1aba22","observation_id":"054e238d-55e2-46c1-a155-8413f5b69ca7","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Dataset condensation with differentiable siamese augmentation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:97e9168676882d4644199b599b887f2bc16583757acec8165f6970783c239709","observation_id":"945f4abf-5cb8-4a31-a0a6-72acf92a468e","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05929","last_updated":"2021-03-08T13:31:22Z","snapshot_observed_at":"2026-08-09T10:26:02.821053Z","submitted_at":"2020-06-10T16:30:52Z","title":"Dataset Condensation with Gradient Matching","version":3},"cited_work":{"arxiv_id":"2006.05929","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.05929","snapshot_observed_at":"2026-07-04T03:29:29.787182Z","title":"Dataset condensation with gradient matching","venue":null,"work_id":"d8fcd60b-5c36-46b6-9812-2613367634e7","year":2006},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/2006.05929","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:150dd417104028d484906d91dd2d810bd2cdb78491cb4bbae8460617ccb0db27","observation_id":"45b227ce-96f9-4d92-ab29-05c67bcc56ce","resolution":{"observed_at":"2026-06-29T00:12:50.276517Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Dataset condensation with distribution matching,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:3859138501b757b4422c64e9e5730b804a89b95a4651a169d87e3a19e02ccb12","observation_id":"a47fc338-7bac-41ab-b001-28dd2e8a504b","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.00050","last_updated":"2021-03-22T19:15:46Z","snapshot_observed_at":"2026-08-18T01:15:46.456683Z","submitted_at":"2020-10-30T18:54:04Z","title":"Dataset Meta-Learning from Kernel Ridge-Regression","version":3},"cited_work":{"arxiv_id":"2011.00050","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.00050","snapshot_observed_at":"2026-07-04T03:29:29.824869Z","title":"Dataset meta-learning from kernel ridge-regression","venue":null,"work_id":"aa97142a-d368-40f3-ba32-562f9fa6f6f5","year":2011},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/2011.00050","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:6ec408c03e8ab9f503ea75b87846f3dcefc0517b46b79cf1aa1e77bde84ccbec","observation_id":"007bddd1-274f-4f1e-8ec1-49a80073a317","resolution":{"observed_at":"2026-06-29T00:12:50.257014Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Cafe: Learning to condense dataset by aligning features,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:d1fb7d5dab1daa6798a83db08f2204284e5b7cf3405d5d38b0881d1cfbc86672","observation_id":"463d7212-a212-4767-a091-99ab79e86f4c","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2110.07580","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.07580","snapshot_observed_at":"2026-07-02T12:26:56.812714Z","title":"Graph condensation for graph neural networks","venue":null,"work_id":"dd2205d9-9f8d-483d-b7d1-fff344c96ebb","year":2021},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/2110.07580","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:14b3fa20a03044062b71d958f0b2efeb45f49fa6256aa721c53f768b5bda154e","observation_id":"eec7291c-fcb9-43bd-b4cd-efed569429d8","resolution":{"observed_at":"2026-06-29T00:12:50.250679Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Condensing graphs via one-step gradient matching,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:9ad2f19337255ce40d75540bd1ecc7a6ab4ae47dd4bc6e3c64b6bb9fa4984097","observation_id":"f27b3ba0-bdf6-49e5-9717-b7acfc85cef5","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.13697","last_updated":"2022-06-28T02:10:05Z","snapshot_observed_at":"2026-08-16T16:49:57.471215Z","submitted_at":"2022-06-28T02:10:05Z","title":"Graph Condensation via Receptive Field Distribution Matching","version":1},"cited_work":{"arxiv_id":"2206.13697","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.13697","snapshot_observed_at":"2026-07-04T10:29:44.392264Z","title":"arXiv preprint arXiv:2206.13697 , year=","venue":null,"work_id":"440ab4b0-7c8f-4e21-9d32-9e222b86d825","year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/2206.13697","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:610e1855f2aa6256816bf2699878b84c39ecdadedfd308b6b89bd48160910458","observation_id":"91880982-342b-4264-9f5f-ca6936e8aa4d","resolution":{"observed_at":"2026-06-29T00:12:50.254454Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Structure-free graph condensation: From large-scale graphs to condensed graph-free data,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:375f44236a758cf7b445daa519515567ae04fd8523dd37686d0b877c815f4d00","observation_id":"73029250-b6ef-4e06-93d3-61d296b0b7de","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05011","last_updated":"2024-06-18T12:38:51Z","snapshot_observed_at":"2026-08-18T07:54:50.778626Z","submitted_at":"2024-02-07T16:32:02Z","title":"Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching","version":3},"cited_work":{"arxiv_id":"2402.05011","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05011","snapshot_observed_at":"2026-06-29T00:12:50.272308Z","title":"Navigating complexity: Toward lossless graph condensation via expanding window matching,","venue":null,"work_id":"3b39b2b9-0e63-4272-a684-eccd0768a519","year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/2402.05011","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:886afccaedc58561457df1ba37631a1a59baa5c002491f8a3190c0d6ef1cce3e","observation_id":"ef05df7a-b627-4744-955e-1fb92c5c1dbc","resolution":{"observed_at":"2026-06-29T00:12:50.273727Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Fast graph condensation with structure-based neural tangent kernel,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:f7ea70a4a41afde61e7761c39e1f09ce14e51e02e891dacf105873d591fb4480","observation_id":"3deca5b5-abbb-4bc1-aea7-d880b1356ea9","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Kernel ridge regression-based graph dataset distillation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:1da2844e0ced5ac1a27b321558c9fccee4710d3153f11bacdb512dfd8c1b6280","observation_id":"cde9facd-e59e-42b4-96c6-b09301909dd0","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Simple graph condensation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:9d467d0840ca9f4e3a6f141a2e1b4109bdd0a94f1e07a7e2a838a3a3e2a7072a","observation_id":"62f060f0-e67d-4cfc-9e97-1e2e21c38de5","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Rethinking and accelerating graph condensation: A training-free approach with class partition,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:fd7336f7a18f8e399e77d2e7e10300e2e9670415d3d36509c5e574dba0ca43fd","observation_id":"e0956ea3-9fe5-41aa-93f5-319df695bbf7","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Graph spectral image smoothing using the heat kernel,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:ab32b45f1a322a35d8448011eb9c6a278b0499d9268f70a960f7c60ddf1c5254","observation_id":"055a944b-5d37-4509-b1f5-299786c3cccb","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Adaptive diffusion in graph neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:fd356601ea44d760e5117f9f2b7e55d5d20a8d2571c92ab807813395a13b25be","observation_id":"281cd290-f43d-4045-b065-b54f7c1d2f2c","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Distributed implementation of heat kernel smoothing for graph signal denoising,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:d79064bf20f2818ebf0093481a56ecb0fc9f62e4a805ba5db895820d518ca6ed","observation_id":"1994d2fe-17e4-46be-9db9-ba7e72d5aa97","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Fast approximate truncated svd,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:a4d1cd9ebca601af21602e093a0d55240fca3cd3540413589e32850ce3b5ea5f","observation_id":"7da4250e-f51a-4223-beb6-3cbf2a5eec75","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Random features for large-scale kernel machines,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:4c72347e9b22047382eaa31725e33f83c6322bdd69adabdb2fd6bd56054a3117","observation_id":"92cd366d-00bb-4ecf-b1f9-eaae17217331","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Disentangled condensation for large-scale graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:3037e4af42150fbe8febc4f0749c581a17e9245dbc0ae61931d261367562e470","observation_id":"28b33671-1a95-43d9-8a9a-6a8f2e7ca69c","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Herding dynamical weights to learn,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:c7d31f18a2ff1b53879cf33f9ec15b497eab3806bfd9097f68a9990d793311be","observation_id":"f23ef587-882d-4f75-b2a4-be5e313d9068","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.00489","last_updated":"2018-06-01T10:17:23Z","snapshot_observed_at":"2026-08-16T13:51:24.988660Z","submitted_at":"2017-08-01T19:50:53Z","title":"Active Learning for Convolutional Neural Networks: A Core-Set Approach","version":4},"cited_work":{"arxiv_id":"1708.00489","doi":"10.48550/arxiv.1708.00489","metadata_source":"pith","pith_arxiv_id":"1708.00489","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Active Learning for Convolutional Neural Networks: A Core-Set Approach","venue":"stat.ML","work_id":"64b057c0-f8b3-4d7a-9f16-e2880f8b501c","year":2017},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/1708.00489","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:febe5797fdb9e00417a781500df57c3822d8e3300ae57c7b3568b9efda59e02e","observation_id":"587cb993-6a78-4ac2-a2bf-6fece46de5d4","resolution":{"observed_at":"2026-06-29T00:12:50.268465Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"1609.02907","doi":"10.1039/d0cp00305k","metadata_source":"pith","pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","venue":"cs.LG","work_id":"21fff118-807d-49cd-8229-f7087ba57b5d","year":2016},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:edd4803d0d6ea6dd47166afe8437a72ded75969d59a7d4174a956104e684af14","observation_id":"176b614a-db98-4a38-bdf6-44963e64de02","resolution":{"observed_at":"2026-06-29T00:12:50.262310Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Simplifying graph convolutional networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:4f0dbdea5fad2bf46da967c70748d01a58244cb3f96e345bb65626bbd97b21ae","observation_id":"7f3396a9-257a-49b9-aa8b-e033be473db8","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:a2bb4507fe85056d1540d400b22f7285ee345d6d012af124db249bf08051925a","observation_id":"9dbd4938-0e46-436e-8bf8-8f84c1be69b4","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:2bab87f632cd8e92df325ff86a274bc8bcf09ebf37506e9cda8c86da9abf08e5","observation_id":"49e3cad8-a469-4085-87d1-166f7f3c403c","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-16T22:36:46.056142Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:fb0fee34761c8d44357dcc46ba1c49ffe104eca77864433402aae80a626d9b74","observation_id":"889ec963-7ce0-48b8-9381-e1c59f8c63d8","resolution":{"observed_at":"2026-06-29T00:12:50.265265Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Graph tensor convolutional network,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:8f9a745bd603b7c7f77f13b56c80419c4ba0ed0091219cca98970bc3cadcd5c5","observation_id":"475bc4b7-46e5-447c-9c48-3c8d3b0de949","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Advanced high-order graph convolutional networks with assorted time-frequency transforms,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:91c7a13ad2ba62c3fe4fa7bef2811c50c84d6cd5593df25cd60ee858a9df43a4","observation_id":"ed607292-4d5b-450d-a5a4-a2295903616d","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A node-collaboration-informed graph convolutional network for highly accurate representation to undirected weighted graph,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:474675ac82581aa49800a3a9815cc350b7a393359e1d86e302daea9e09fc656e","observation_id":"95d8e7c5-fa6a-473b-9166-cdce402a251c","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Gt-a 2 t: Graph tensor alliance attention network,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:fee4f54fc2cf044beae6c49e075d18b5c6a4c1498646faf0609df514654ab8e6","observation_id":"73401792-6462-4f3e-848b-8c7c19d34063","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A kalman-filter-incorporated latent factor analysis model for temporally dynamic sparse data,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:f4e9d8df2512285a47876c91d28e06ed3f2a8ac059fabdbcf9622c2aef542d80","observation_id":"55c22c90-35f7-4b64-8818-885a8becc3e4","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"An adaptive divergence-based non-negative latent factor model,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:09eac51a4de2f39a41fa8f56ab6a25089c478583dd91fb88ace1ccd53fc1606d","observation_id":"83db7298-0556-4971-ae25-0f87fb9518c8","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A multilayered-and-randomized latent factor model for high-dimensional and sparse matrices,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:03a257fd7e7a97d810a51cdbcc44c01d3a5a02a3dd4a20db94e3ff810c017a10","observation_id":"54cabb25-30f0-4ff2-8578-857319c7e9ae","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A generalized and fast-converging non-negative latent factor model for predicting user preferences in recommender systems,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:779b283ff98b99964a51e955346ae9349987f599d43bb22feb023e94986af825","observation_id":"af69bf6f-0d78-4bbb-8bcf-1942941bbf04","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Temporal web service qos prediction via kalman filter-incorporated latent factor analysis","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:f134ad725f6603f10ee37cf3e6ff67fcd0f97e6456a45d41b2d74d2faf19d26f","observation_id":"7b985578-be38-4ff9-a6c5-107a8e2eb990","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Non-gradient hash factor learning for high-dimensional and incomplete data representation learning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:403e4f521d7c5ebeb111c2c3e87f70bdb276f22b6bb0fd0139124825808fc9d1","observation_id":"05a10d41-f166-4b7e-89d9-e9a60aa99c6e","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Learning accurate representation to nonstandard tensors via a mode-aware tucker network,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:9ce4662e740cf6a6b05e3f34d02253f19110a2518e3ff2026a8e7758364eadf7","observation_id":"72684095-36af-4506-bb64-f034671225d1","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Tensor low-rank orthogonal compression for convolutional neural networks,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:8da3318ae9e7d96285d096bce911d56445d6b171c97657145740744629447e93","observation_id":"79387177-a509-435e-a0d3-29db4ad55eba","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Discovering spatiotemporal–individual coupled features from nonstandard tensors—a novel dynamic graph mixer approach,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:72756141a9c81e60e5dd7fb8e52f5d565296d8c5743b0cde196a81bd7e7329b9","observation_id":"848cd8c2-50f9-434e-9e97-51b8e883356c","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Scg: A novel spatiotemporal coupling graph convolutional network-incorporated approach for dynamic qos estimation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:c11bcf7cf0bee2831cb47df946b8cbbbbac2997147d749f4cf706e1b4dc86720","observation_id":"36bced14-167e-49f3-9025-a825666067c0","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A convolution bias-incorporated nonnegative latent factorization of tensors model for accurate representation learning to dynamic directed graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:38cb008dff566acd5ac108314aec8fee6bae91dc9d33dade2897ea95b799d66c","observation_id":"7427f2a3-d59e-4381-8833-0b87e7ddb89f","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Knowledge-driven multiple instance learning with hierarchical cluster-incorporated aware filtering for larynx pathological grading,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:06c34ed67ea4e3f50a09cc5d5d339dec0cea4dacf2e36be34ee1ced57ac5dc8b","observation_id":"74f9f97f-5c34-4b6b-96d5-b5d60b34b216","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Fmvpci: a multiview fusion neural network for identifying protein complex via fuzzy clustering,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:110b727c295ca662092e0b4e964f8e37702cf9f69666031e4db60df9cf3c67a6","observation_id":"2f114d46-412d-4017-996f-92924132db61","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Graph-based prediction of mirna-drug associations with multisource information and metapath enhancement matrices,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:5ae1b17dd7135a74d5612be81905dd3c472a19a7d95495c96685d6286e19fe5e","observation_id":"6c987864-0759-4d7e-ab95-3f5bd7739822","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Fuzzy mixture-of-experts aggregation for organoid identification with multiscale state space features,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:77889afef4c0eb455fa7c74c3e2bea461dd95a352466768877bcda8bb15c0785","observation_id":"c2a5bbea-40a9-4953-a770-98dbaa243398","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Ncsac: Effective neural community search via attribute-augmented conductance,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:15ec90e6a0ba8dd7b4dc698c3b166a831d065904f707a0b8b4b80a2badc81139","observation_id":"5b4a5d6d-b314-4b3e-ac8a-8090185a48a2","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A proximal-admm-incorporated nonnegative latent-factorization-of-tensors model for representing dynamic cryptocurrency transaction network,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:781298f5dd2ec9122266cb9823addec15a62f0147605e246b52f51bbd1de17b4","observation_id":"f6408c21-0f84-4ffc-a5b4-45a128649e7b","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Multi-scale collaborative distillation graph neural networks for session-based recommendation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:dfddaf9b1871d2c8156426627ef9f9b0eb60c6d892025b08558bd08a4c8e84ae","observation_id":"e43ada72-fe10-4102-9855-bbc5ac7e65d0","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A generalized nesterov’s accelerated gradient-incorporated non-negative latent- factorization-of-tensors model for efficient representation to dynamic qos data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:3db628db2f9aa8ddbd7f49b4c429137cb28446f428c03b67f85e44918785e65b","observation_id":"68995da5-989f-4284-8923-a6d21d69b48e","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Symmetry and graph bi-regularized non-negative matrix factorization for precise community detection,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:4403b17ef85dc2849d20de123c1a6fa98ece63b63465335b6f43aec7e6ab78c6","observation_id":"f5c25301-d165-42db-83a4-0b38e3fa8b90","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Mmlf: Multi-metric latent feature analysis for high-dimensional and incomplete data,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:97b88a9e47258ffb13a3f486fdcb1c429cd3baef69b125bcaa167ce4f8733685","observation_id":"4163e29f-282c-4da1-bc76-7f34a439343f","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Learning error refinement in stochastic gradient descent-based latent factor analysis via diversified pid controllers,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:d56a4d518fbafab93b33c62800df6371657dc0d8926fcad744d6d8edc193b196","observation_id":"242a021d-5f4e-43c5-ae24-8f4cc80617f5","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A fuzzy pid-incorporated stochastic gradient descent algorithm for fast and accurate latent factor analysis,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:24f85f92d74a15df4775f321d415ca8b94c83312c01bcb3f9faadc970bc44a46","observation_id":"cb77e090-c0b3-41eb-af33-001a5c4fcfcc","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Adaptively-accelerated parallel stochastic gradient descent for high-dimensional and incomplete data representation learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:149084d6348260374709de80251a5386da7c1cb12aef6655bb03fad9d55095d7","observation_id":"685595b5-2934-4d45-8bd6-544a893a1dc4","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Sgd-dyg: Self-reliant global dependency apprehending on dynamic graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:172cfb92cb13c62cc1ca6887e15cdce73b433164b915edcf9e5f92c0500cd06a","observation_id":"c643f5f4-5038-455d-94fd-6196f14cc6dd","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Auto-encoding neural tucker factorization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:bc69dfe6c59d03450e363a522c8a77a4edb232e39ee4640dcdf97c3bb7fbcfd8","observation_id":"3dcb4cc8-85a4-48d9-acd3-4ee4bcf728a3","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Multimetric autoencoder for representing high-dimensional and incomplete data,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:12f26f09c3a9a637e61b395806caad2aec5c51974e06fbe25593c4c413e98d13","observation_id":"5b99a22e-d1f6-4d6c-bc76-199646a2c5a9","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A novel tensor causal convolution network model for highly-accurate representation to spatio-temporal data,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:c6b152140c992a0aae77a3d387144f192ad7a47d243b4f241feb1b11a102de2a","observation_id":"734d9807-7fc1-4e90-98cb-29e71751ce93","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Adaptive divergence-based non-negative latent factor analysis of high-dimensional and incomplete matrices from industrial applications,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:e7e8a7cba8ee392ef0b51f1bba506e613070f0c6ca29f59adcf3f8ca7390c081","observation_id":"a5d74aa7-83ec-4189-a544-8d0500fb6625","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"An adaptively bias-extended non-negative latent factorization of tensors model for accurately representing the dynamic qos data,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:9ff756cd2b3005e62a5927199c1d8ecc8458d5aa0b9decb262e651db97df947e","observation_id":"b1e4eb5d-3992-41df-8228-d507a1bfac48","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A robust coevolutionary neural-based optimization algorithm for constrained nonconvex optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:298f8033d6878b77da3db977f3fdfbe0b8e6b07f996c2405064ef826d8481950","observation_id":"bc2b0a6f-73df-4898-b72f-ded51564858f","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A scalable multichannel sentiment analysis model with enhanced semantic understanding and redundancy reduction,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:ecde3ffc8a7413bd6f8a2d3deb3b3b08a73c5c14f9a17406451cf9654112c898","observation_id":"d538b020-1594-405b-a68a-9ba7a35a9dee","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A novel tensor decomposition-based efficient detector for low-altitude aerial objects with knowledge distillation scheme,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:9bee6c4ca6a098ed6005185ade90faaf25674d9f40df52d16833b3b7700fe7c7","observation_id":"39c0ddd7-ab44-460a-a981-c2c394966a6b","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A fast nonnegative autoencoder-based approach to latent feature analysis on high-dimensional and incomplete data,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:213f45cc29df0a7828915061fa17d4ac08e40eaae9fff6b16eb965f481252378","observation_id":"a2418bba-74a7-4ef6-b3bf-01245ed7e982","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"A sampling-neighborhood-regularized latent factorization of tensor for dynamic qos estimation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:364adb8525c9cfefe9da1e0e7c567423244f44308054077cb4dc505f0031f2fc","observation_id":"f1db689f-3b07-4273-9e64-0a3a222d6360","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Attention-mechanism-based neural latent-factorization-of-tensors model,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:d2d1fc07b6fe5b7c8ee6e099b099a80d7b695a5c09e00241a1e453c2f5db7af4","observation_id":"5ce0a35d-96b3-4e85-a5d5-56cec8b050d2","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Graph linear convolution pooling for learning in incomplete high-dimensional data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:fdf3de86cd52ea1cd1ab4edb2dd494da95026595abdb4da996d70a333e893874","observation_id":"33c2adbb-e3d2-4e76-8142-a3a854e6de4d","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"An outlier-resilient autoencoder for representing high-dimensional and incomplete data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:fee70e7bb6c440de09e87e9ba2f69704a0e38d08ec88586c977fdef9cd9c9766","observation_id":"2e015265-2ea7-4ca6-8f88-0c8442c86a9d","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Robust low-rank latent feature analysis for spatiotemporal signal recovery,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:2263bf6ca0e526a37d203108984aa3abfd23b5ff6ab444df92a299dcd6b53ef5","observation_id":"26301941-148b-4d01-b343-08971d1bbb5c","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Neural tucker factorization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:9bae325c827238446637608a05719a76fb56f3c63386367523fc5a096e48de78","observation_id":"923bfc3b-ad80-40f6-ac04-0e60793c6d39","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Link-based attributed graph clustering via approximate generative bayesian learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:e2f58f55bb0286a91278863af8f908a5e01f9c6ab913bf297d26d584829e0e7b","observation_id":"67a32fa4-002d-41a5-9af1-4e33e1351beb","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Neural nonnegative latent factorization of tensors model with acceleration and unconstraint,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:5dac9660a6b51a1b7bfe08e3269e43f187223f6107a324f35191e509d2be1eec","observation_id":"8efc8ab0-43ee-4589-a886-c39e70ddd700","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Latent factor analysis model with temporal regularized constraint for road traffic data imputation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:0f3242dbf7988203e6de4e5ac99df1606af6619f01c2450fba852c3f1136595a","observation_id":"ef1ff085-385d-4a7e-a7fe-efe090b2764e","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Local search-based anytime algorithms for continuous distributed constraint optimization problems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:5585388dbc9f871151166b501ed4b2de5c3d509affa1526b8b5537ca41adc2ca","observation_id":"7e5d318e-0976-432d-bca0-0d3b2c658650","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Local search-based anytime algorithms for continuous distributed constraint optimization problems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:fd2434ccc05e9c62440f6ad16ae8b35f2953d5775f6849afe8397003f68af607","observation_id":"f70677f8-87b5-4c1b-884e-e22c9ceebc3a","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:03:13.278727Z","title":"Iterative role negotiation via the bilevel gra++ with decision tolerance,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:e011861b2dc59b071df60bc165ec61a39c4ea52079fd907edfe0f7bf915c61ef","observation_id":"11b910a8-8c2f-4203-ae5c-7816fae99a12","resolution":{"observed_at":"2026-06-29T00:03:13.278727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving"},"reference_resolution":{"displayed":85,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":74,"verified_exact":10,"verified_fuzzy":0},"total_outbound_references":85},"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 18 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 0 inbound Pith citation observations for arXiv:2605.31016."}