{"as_of":"2026-08-12T18:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:454b85e7e9be7e3d96d46b17729afb8a240d5d491e18bc8722960c0754dc5626","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:30:56.134074Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2412.05735/citation-record","integrity":"/paper/2412.05735/integrity","json":"/paper/2412.05735/citation-record.json","paper":"/paper/2412.05735"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.15367","last_updated":"2022-04-26T17:59:28Z","snapshot_observed_at":"2026-08-10T04:58:22.567603Z","submitted_at":"2021-11-27T02:52:10Z","title":"A Review on Graph Neural Network Methods in Financial Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.15367","snapshot_observed_at":"2026-08-11T20:30:55.939566Z","title":"A review on graph neural network methods in financial applica- tions,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.939566Z"},"links":{"cited_paper":"/paper/2111.15367","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:14b0cdea1900f266681d8aed97224665303628140dc9a303101c4309bd2757d3","observation_id":"c65bc1f0-6825-43dd-9b4e-2be72d0c6e71","resolution":{"observed_at":"2026-08-11T20:30:55.939566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.734126Z","title":"Improving the general- izability of protein-ligand binding predictions with ai- bind,","venue":null,"work_id":"a37bc000-c812-467c-ac99-c6b28e1dff8a","year":1989},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.943599Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:a0f6c3506ad2833eeabf0e423782f00cdf3ff2ef4240d954a0e11455dc9a79b9","observation_id":"6ec6684f-074e-4f7f-9a51-2f82805134d7","resolution":{"observed_at":"2026-08-11T20:30:56.738397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.724790Z","title":"Hyganno: hybrid graph neural network– based cell type annotation for single-cell atac sequenc- ing data,","venue":null,"work_id":"7437c540-2c3a-453d-bf9d-f5f20d4bd203","year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.946708Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:ff5c5acef19b0dee17fa6d7296ba31f6aa43e33d5600a20dbc3517c3ae2b7253","observation_id":"7bd8a21e-e66b-448c-8b97-0e4c7346e07d","resolution":{"observed_at":"2026-08-11T20:30:56.728277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.716154Z","title":"Graph convolutional neu- ral networks for web-scale recommender systems,","venue":null,"work_id":"9b51e407-2c85-4d8c-a167-f7c68c8f60ee","year":2018},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.949922Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:7779cc870d644f2f1b9fcac3f1ec589581cff330331d6b01e557041eb088c791","observation_id":"79165faa-f80a-4368-bdcd-08f272fa395f","resolution":{"observed_at":"2026-08-11T20:30:56.719505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-11T20:30:55.952925Z","title":"Distilling the knowledge in a neural net- work,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.952925Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:b24d7aa97a4a152d1df26cf60f9e229c131e34a5d7da5f87463273ce30b97206","observation_id":"a322e911-fd2c-436d-893b-a3a3ff89d9a2","resolution":{"observed_at":"2026-08-11T20:30:55.952925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.707150Z","title":"Graph-less neural networks: Teaching old mlps new tricks via distillation,","venue":null,"work_id":"64229d15-1be7-4334-b24d-b1bccc4e3ce8","year":2022},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.956538Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:36407c4c1a3851a8120a9c95c8259fe54f96480b9c29a7b31276f6c23962f46d","observation_id":"6de1d6a9-87b6-41b0-b969-7b70a23a0669","resolution":{"observed_at":"2026-08-11T20:30:56.710363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07511","last_updated":"2022-12-07T05:08:01Z","snapshot_observed_at":"2026-07-06T11:29:34.579530Z","submitted_at":"2021-07-15T17:59:50Z","title":"A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.07511","snapshot_observed_at":"2026-08-11T20:30:55.959853Z","title":"A gentle intro- duction to conformal prediction and distribution- free uncertainty quantification,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.959853Z"},"links":{"cited_paper":"/paper/2107.07511","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:2c70a6f77bfc8fda7eeba9841d2ed8d263668de42b19ec3b55a37ddf04a2b8bc","observation_id":"7062da31-e1e9-4867-97b4-b361b9327e4d","resolution":{"observed_at":"2026-08-11T20:30:55.959853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.698839Z","title":"Curriculum learning,","venue":null,"work_id":"065c7ed0-7633-4828-aef5-149cfa07b97f","year":2009},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.963062Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:6268c105f9e2cb26318b5d04208f6791fac051d2e9ac6f4f7ebaa6b73b7045f4","observation_id":"46803b73-2fa5-46e9-95a1-7f80390f7145","resolution":{"observed_at":"2026-08-11T20:30:56.701841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.690325Z","title":"Topology attack and defense for graph neural networks: an optimization perspective,","venue":null,"work_id":"230d4fce-a9d0-48f9-8a37-0516f319bd93","year":2019},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.966203Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:cc6954c07c71241a6c0e3c555e5afb2ccdf99f71c48e96d32e6f09565b22a1e9","observation_id":"76abc302-4015-4e0b-83cb-5078947104af","resolution":{"observed_at":"2026-08-11T20:30:56.693399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.680657Z","title":"Adversarial attacks on graph neural networks via meta learning,","venue":null,"work_id":"5047fbe0-2ee2-4dac-8636-cc945cc75d56","year":2019},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.969159Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:11bb92faebc407e8e655527c30f2e558f4f109e68eb7985ac179e297783dc01e","observation_id":"48883491-afbc-43ca-b06d-9f689f5bd087","resolution":{"observed_at":"2026-08-11T20:30:56.683787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.671973Z","title":"Towards reasonable budget allocation in untargeted graph struc- ture attacks via gradient debias,","venue":null,"work_id":"82d0ea1e-0d1f-45fb-9d2d-843b6c435509","year":2022},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.972099Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:da806035ff5bced2413548d1563fc3dec5e52da1fa0254a60372ba57f6e369fa","observation_id":"6ab59bb7-440c-4312-a4dc-6323afcaaa59","resolution":{"observed_at":"2026-08-11T20:30:56.675192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.663428Z","title":"Bayesian inference of network structure from unreli- able data,","venue":null,"work_id":"20fb65b0-621b-41ff-88e6-a21dae129d88","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.974864Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:56d08b386cb65ed5712698db09e446fa41f5b611e350eb56f91a0d7411c547c9","observation_id":"6d281466-31e6-41f3-bd6e-60c852fa3b50","resolution":{"observed_at":"2026-08-11T20:30:56.666354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01015","last_updated":"2025-03-21T08:18:30Z","snapshot_observed_at":"2026-08-10T11:47:52.263805Z","submitted_at":"2024-05-02T05:35:09Z","title":"Network reconstruction via the minimum description length principle","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01015","snapshot_observed_at":"2026-08-11T20:30:55.977728Z","title":"Network reconstruction via the min- imum description length principle,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.977728Z"},"links":{"cited_paper":"/paper/2405.01015","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:f11e9eb8564f77dd5e531cd9e2cb517b960a02d4862af0c32144431fc59f42be","observation_id":"31c9a309-9ec8-4def-bbb5-cf4f9115f67e","resolution":{"observed_at":"2026-08-11T20:30:55.977728Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.655051Z","title":"The minimum description length principle in coding and modeling,","venue":null,"work_id":"6d45f2b9-6040-49d9-8190-57eb254fe251","year":1998},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.980782Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:4a3eb68d7df693deba8c0f68513c2192011ca56e922299d8933d438211a73a22","observation_id":"8f625ab8-489d-414e-899c-335ac8c045ec","resolution":{"observed_at":"2026-08-11T20:30:56.658162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.644999Z","title":"Fast attributed graph embedding via density of states,","venue":null,"work_id":"e2fe310d-78c5-4e7e-bf52-700b3b268f27","year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.983627Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:aa365bec9f4db5e3c453b433c6f880de1f39660ff9325dcfad5f8116f3de4851","observation_id":"2bc7a130-4986-40a5-a0f5-d31d51104c7a","resolution":{"observed_at":"2026-08-11T20:30:56.649305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1109.1355","last_updated":"2011-09-07T05:10:58Z","snapshot_observed_at":"2026-07-06T02:33:35.807873Z","submitted_at":"2011-09-07T05:10:58Z","title":"Localization on low-order eigenvectors of data matrices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1109.1355","snapshot_observed_at":"2026-08-11T20:30:55.986148Z","title":"Localization on low-order eigenvectors of data matrices,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.986148Z"},"links":{"cited_paper":"/paper/1109.1355","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:8ba6bee414a63c2027386cee8f25e56bdaf5d5d924d922837dba71c2323dd55b","observation_id":"c17ce228-0a2e-4e45-9662-34847207001a","resolution":{"observed_at":"2026-08-11T20:30:55.986148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.635662Z","title":"Spectral and dy- namical properties in classes of sparse networks with mesoscopic inhomogeneities,","venue":null,"work_id":"58f0f783-9ce0-46ae-ad9d-2cc19b622568","year":2009},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.989572Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:d0b5b05a9351a9af0b3783445f449b2469756be4c96a135380ea78897ddf68de","observation_id":"6ebbc0a8-bf33-44f7-a262-dd083da22809","resolution":{"observed_at":"2026-08-11T20:30:56.639715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.627110Z","title":"The political blogo- sphere and the 2004 us election: divided they blog,","venue":null,"work_id":"b1eeb719-9d52-40cf-b221-3927fa4b772f","year":2004},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.992530Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:b5a0e94e2787129fa0b0fdb2eb436793e3b5fae6bac31dea536a50354d00995b","observation_id":"f9c50a01-cc53-4bc0-9c8a-19527265203c","resolution":{"observed_at":"2026-08-11T20:30:56.630157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.618456Z","title":"A survey on epistemic (model) uncertainty in su- pervised learning: Recent advances and applications,","venue":null,"work_id":"e9d30d70-a543-4f7d-bd8c-826bffc94573","year":2022},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.995763Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:65f0b0537c9b222d9812ff64e7b2d625f7c5655df431eb8353a0a00ef16cdab0","observation_id":"02687b6d-4870-4dd6-ad97-201a99574b88","resolution":{"observed_at":"2026-08-11T20:30:56.621723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.609801Z","title":"Aleatoric and epis- temic uncertainty in machine learning: An introduc- tion to concepts and methods,","venue":null,"work_id":"cedb2b8e-3c39-4f2f-83c6-53212c604f9b","year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:55.998564Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:de892d68e221d3775cafab881160a427260c6cfd2268f069e013198265526fe9","observation_id":"b7771846-f6e0-4522-a166-a093394e94ad","resolution":{"observed_at":"2026-08-11T20:30:56.612973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-11T20:30:56.001489Z","title":"Auto-encoding variational bayes,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.001489Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:13ebfb80c3f10bcbfe4dc1ae7e4a0fb4a8dd4a6b675fac4f9670a26c5f64c8e9","observation_id":"a0d7ef14-7ad6-4c6b-9a95-dd1f1dd69d43","resolution":{"observed_at":"2026-08-11T20:30:56.001489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.600842Z","title":"Automating the construction of internet portals with machine learning,","venue":null,"work_id":"ec6c4275-07a7-4c2d-baa1-35fc99750736","year":2000},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.004838Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:ffd6c05a3037ac2d9f057f2bdc0dbef5462a8cc29501211ef200f54db86f7ff5","observation_id":"281f2835-7a8a-456a-a91e-a306400b6bdc","resolution":{"observed_at":"2026-08-11T20:30:56.604335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.591810Z","title":"Cite- seer: An automatic citation indexing system,","venue":null,"work_id":"6d78d81b-8836-4905-86dd-0eb05c7603bb","year":1998},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.007712Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:8d32c872250902b65ed40e2f5d6569c1f50c3a0cc3b9a8ca1d089a5d1a67c347","observation_id":"f6105547-cc99-411c-bcf9-c61f70d79241","resolution":{"observed_at":"2026-08-11T20:30:56.595106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.583235Z","title":"Robust graph convolutional networks against adversarial attacks,","venue":null,"work_id":"ac3417a3-42f3-4bab-a348-a8e0541e1da9","year":2019},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.010683Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:24d64e3d492330ab0a8a822b5554cac0ca0e964b4c52e0395fd2623b8d6289ae","observation_id":"dc576669-4bed-450c-aaa2-0aae6188d2ae","resolution":{"observed_at":"2026-08-11T20:30:56.586277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.574268Z","title":"All you need is low (rank) defend- ing against adversarial attacks on graphs,","venue":null,"work_id":"f51e4288-cc4d-4d0f-a4ee-a3e77e27e67b","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.013616Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:ea78262df684c01e17f52fe9a4053e765a9fb869d951094043d7ed207353c01f","observation_id":"04e1f6e0-b295-4731-beec-c915f6e74f70","resolution":{"observed_at":"2026-08-11T20:30:56.577727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.565431Z","title":"Graph structure learning for robust graph neural networks,","venue":null,"work_id":"c8c39c8a-ae7e-4a78-800c-1bc8190130c5","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.016595Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:9c878df8c50d4e917c51a8508062ab5c8a3999e0e1c0883ea7a780e948276b1e","observation_id":"dbc734ca-7a9a-46fe-8492-b45c81fc52cc","resolution":{"observed_at":"2026-08-11T20:30:56.568659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.556785Z","title":"Gnnguard: Defending graph neural networks against adversarial attacks,","venue":null,"work_id":"f43b52a3-4ad6-49bc-9b65-73a13044ef05","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.019953Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:7fee1fe3d972f79284a27842392b0be84029ceca77bf87eade521487c28521a1","observation_id":"87b7a399-3693-42bd-8d8a-d647c525d9f7","resolution":{"observed_at":"2026-08-11T20:30:56.559885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.547901Z","title":"Graph structure reshaping against adversarial attacks on graph neural networks,","venue":null,"work_id":"ee67d808-4b8e-4fb2-bbaf-0f22dc048147","year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.022887Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:e2dcb4ecb7aaa5f4460ba06aba83d30b30a393184ab879a4faa57df04f9e2516","observation_id":"6ec709e2-002a-42eb-9548-f79b426ad013","resolution":{"observed_at":"2026-08-11T20:30:56.551075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.539169Z","title":"Graph adversarial diffusion convolution,","venue":null,"work_id":"eaec4ba4-71aa-4ded-9419-5d00186bc376","year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.026690Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:74106f9e7bb8ab9782e5d26489de5f928e03d0182ac0c75500def9fd8c0e7fc9","observation_id":"cb73515b-60d2-4ae4-b63b-c25da5a86a9b","resolution":{"observed_at":"2026-08-11T20:30:56.542402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.530048Z","title":"Ricci-gnn: Defending against structural attacks through a geometric approach,","venue":null,"work_id":"65c8e775-b2d4-437b-ade0-f9bacdbbf50f","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.029461Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:e63b096b73d1953c61e88fed6506d6749b567affbe7065cee48e1adafb9be0c7","observation_id":"05aa8f7e-4bc7-4a91-9e95-7204875741b1","resolution":{"observed_at":"2026-08-11T20:30:56.533599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.521200Z","title":"Diffusion improves graph learning,","venue":null,"work_id":"429d55c2-7f0c-4643-bc64-521e884aec2e","year":2019},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.032296Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:5789a61e2694db3987e13ce3e6eaee9a1a1572dbe8194965368db78172172005","observation_id":"55fecbce-72b5-4dcf-95dd-eb0f0027a388","resolution":{"observed_at":"2026-08-11T20:30:56.524332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.512424Z","title":"Ricci curvature of markov chains on metric spaces,","venue":null,"work_id":"bb03e1e3-93e2-42f6-ae22-a06f467cbe5c","year":2009},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.035042Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:ccefb7a6419ec92db76377eae16a581c2322b562ae3c0cf08727c0cecd18ee95","observation_id":"894990a3-9685-45b3-abf5-9fc7407207fc","resolution":{"observed_at":"2026-08-11T20:30:56.515669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.503274Z","title":"An information flow model for con- flict and fission in small groups,","venue":null,"work_id":"3720562d-679a-423f-8635-d7a8e439939c","year":1977},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.037919Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:c8e3943e4d6a3f968feb4c725a3225d46bf3fedcf23d9093233b15717ba8a157","observation_id":"c102893b-f3b8-4165-b5f3-501baec1f654","resolution":{"observed_at":"2026-08-11T20:30:56.506783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.494276Z","title":"Dgcu: A new deep directed method based on gaussian embed- ding for clustering uncertain graphs,","venue":null,"work_id":"3362cc52-b64c-4223-9d6a-d492f7266da3","year":2022},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.040917Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:6994c2bb86b6d356176cf1404d9fa85f0b709bf1cabe55ca27585e2053098872","observation_id":"741f53af-c482-470e-8b27-b8f104fd7028","resolution":{"observed_at":"2026-08-11T20:30:56.497514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.485536Z","title":"On embedding uncertain graphs,","venue":null,"work_id":"16766500-d9a9-4450-94a9-71969eb57957","year":2017},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.044105Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:8199c127baea867e814c9a7c1c9eb928353eafc5359e82c125f41dc86bccff91","observation_id":"a6765276-1b3d-4b1b-b5b9-c9c0b989ddee","resolution":{"observed_at":"2026-08-11T20:30:56.488701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.476295Z","title":"K- nearest neighbors in uncertain graphs,","venue":null,"work_id":"4f6ab7ea-71a6-4e29-a5e0-0a080d220a5e","year":2010},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.046922Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:a44dff6cdba1b87bf13991e1ea777a66e9bfa3a98e2e125cd5efdca40b1ecc6c","observation_id":"b9369bb9-4d20-4a3c-8fc0-8f393550f0d3","resolution":{"observed_at":"2026-08-11T20:30:56.479571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.467449Z","title":"Core decomposition of uncertain graphs,","venue":null,"work_id":"8770e0de-34f0-4b0f-9c62-88ebf78b8c6c","year":2014},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.049938Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:68b2a27569cfc0302adba782816b50ebd25d6aefbd1142390d3718534c0f762d","observation_id":"abca3f7c-a921-43b7-88db-6701d1b94661","resolution":{"observed_at":"2026-08-11T20:30:56.470582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.458547Z","title":"Shortest paths and centrality in uncer- tain networks,","venue":null,"work_id":"c6e59593-6e4e-43a5-bbda-424cfc6867b4","year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.052626Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:a40b0a7c915eb262cbc9a97fc29349c80eadb3997cb4ce20492e2b635059491a","observation_id":"232de051-16d8-49a2-b473-9aa116cf93f3","resolution":{"observed_at":"2026-08-11T20:30:56.461873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6623","last_updated":"2015-05-01T10:14:58Z","snapshot_observed_at":"2026-07-06T04:04:18.621124Z","submitted_at":"2014-12-20T07:42:40Z","title":"Word Representations via Gaussian Embedding","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6623","snapshot_observed_at":"2026-08-11T20:30:56.055609Z","title":"Word representations via gaussian embedding,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.055609Z"},"links":{"cited_paper":"/paper/1412.6623","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:58278ea68a56dbdaf7bf269d062ad807a1008537bc76d153594cc0dccedb7789","observation_id":"69bf6406-dfad-42d1-9a6b-9c70a874a5a6","resolution":{"observed_at":"2026-08-11T20:30:56.055609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.449256Z","title":"Confidence-based graph convolutional networks for semi-supervised learning,","venue":null,"work_id":"77fec9f3-c96a-4b2e-a4d6-d8a1837600a7","year":2019},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.058559Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:1230312cd0862df8a5e93f5d5c93912d7be7b6d08e0ce69463b233defd004c96","observation_id":"a0b5f1e8-e728-4a4b-8c9a-eed35d979e90","resolution":{"observed_at":"2026-08-11T20:30:56.452497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.440029Z","title":"Rethinking missing data: Aleatoric uncertainty-aware recommendation,","venue":null,"work_id":"28889cf7-2142-4286-bcda-a5b9bc6d453d","year":2023},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.061328Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:be845b204be0f93438f4d03e17212cadb288b5196ca8abab14872d5bb09ab3b8","observation_id":"e095abbc-23f6-48ba-aa84-669ba3c2e6f3","resolution":{"observed_at":"2026-08-11T20:30:56.443408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.430756Z","title":"Modeling uncertainty to improve personalized recommendations via bayesian deep learning,","venue":null,"work_id":"8cfb3347-e5dc-42eb-a9e6-702901ceb8dd","year":2023},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.064176Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:1b59eac85c006b05b6dfee60c44801018e992d704a8dbd02f60468969bfa11fd","observation_id":"195db96f-dfce-43b0-b87c-79885b3c90b0","resolution":{"observed_at":"2026-08-11T20:30:56.434023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.421472Z","title":"Uncer- tainty aware semi-supervised learning on graph data,","venue":null,"work_id":"a6f51530-ea47-42ee-bd65-457bf836d219","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.067245Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:9746a9d0e4feefc0cda2a2df8cb6c6c882327a088c341afe3791f0f71d64da12","observation_id":"91176858-d397-4e01-a26a-b148fd1d3597","resolution":{"observed_at":"2026-08-11T20:30:56.424970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.412364Z","title":"Uncertainty aware graph gaussian process for semi- supervised learning,","venue":null,"work_id":"1c40130e-370a-49cb-9304-e479852f988c","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.070067Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:66030e03db4381e99f3065336ef396bef1c49de11144ed7b71ea4a8c4298fe9d","observation_id":"b76cee73-6583-47d6-b542-abaa4ed00d16","resolution":{"observed_at":"2026-08-11T20:30:56.415753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.402771Z","title":"Bayesian semi- supervised learning with graph gaussian processes,","venue":null,"work_id":"bbfa0301-2790-4005-adbe-0f60f4dd4647","year":2018},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.072848Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:254551ac1a62155734615aa8deebf72c2075bc78cc08a668de19d0a4407fceed","observation_id":"8ff6b31d-c989-4a4b-97a8-695bc9ed187b","resolution":{"observed_at":"2026-08-11T20:30:56.406280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.393426Z","title":"Ud- gnn: Uncertainty-aware debiased training on semi- homophilous graphs,","venue":null,"work_id":"8e721e3c-87f7-4ef4-abf6-9598de662a02","year":2022},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.075587Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:a6d0ee8e26c6af9d410baad86c76ed367891d9677b1b36342fe7c564166b065c","observation_id":"e5cab29e-3736-4daa-8d93-948fdad4bc62","resolution":{"observed_at":"2026-08-11T20:30:56.396770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.078418Z","title":"Accurate and scalable estimation of epistemic uncertainty for graph neural networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.078418Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:8add1b183050991a7da9c01c7cc8dc9e8dcce0f46e6d2ea6053e69aee27642f7","observation_id":"cbb1b584-c7cc-4eb5-b102-c6384141fc56","resolution":{"observed_at":"2026-08-11T20:30:56.078418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.379610Z","title":"A general framework for quantifying aleatoric and epis- temic uncertainty in graph neural networks,","venue":null,"work_id":"4b4353be-cbd3-4274-8e0a-e85c24c6f124","year":2023},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.081257Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:0a080d41578e2038b69564b59ca1f4621c51afd55c4113169e537ffeafa8a3e4","observation_id":"7d0af11f-1e4d-4909-9b19-a4b1e7e84ddb","resolution":{"observed_at":"2026-08-11T20:30:56.382919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.371026Z","title":"Uag: Uncertainty- aware attention graph neural network for defending adversarial attacks,","venue":null,"work_id":"d1ff0419-0b75-42fd-9a10-3bf6b6f13b0b","year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.084127Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:e84036deb9ddc4fe70ca63bf37a70d2ddcdebb3eb3d6a7463cb84fcb81b3b445","observation_id":"87cb2ea3-fc83-4f7e-9c24-c8bcfbbfe1cd","resolution":{"observed_at":"2026-08-11T20:30:56.374289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.361903Z","title":"Un- certainty quantification over graph with conformalized graph neural networks,","venue":null,"work_id":"ae85b0e1-c9ce-4d78-8fd7-b376703f2ab1","year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.087051Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:631e3979b49361a5c8d4dcc9bc90927fd2c3682bf23ded9e837c134af566eb8d","observation_id":"6adabb34-95d9-4eb2-88c8-aaa284164087","resolution":{"observed_at":"2026-08-11T20:30:56.365474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.352835Z","title":"Fuzzy neural network for representation learning on uncertain graphs,","venue":null,"work_id":"49591008-841e-42a7-a6a1-bd618669f111","year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.090149Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:0394a98c0b821bb79db78a0e77c36330954f3e7a50eee214d5e6f33b550165e4","observation_id":"02baae8b-5428-4def-9aaf-52aa7f7a1687","resolution":{"observed_at":"2026-08-11T20:30:56.356269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.344173Z","title":"Fuzzy representation learning on graph,","venue":null,"work_id":"3639276a-c9cf-4b49-86cb-11c069349963","year":2023},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.093070Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:d536f30b66c67273d9ac7189d729a3d880295c8ec832c8f64bc2a0021b55070f","observation_id":"b8afdd96-b1c0-4dd6-abea-e931e249600e","resolution":{"observed_at":"2026-08-11T20:30:56.347395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.335175Z","title":"Fuzzy graph subspace convolutional network,","venue":null,"work_id":"463a65cb-d3bc-491e-889b-e529d71471ef","year":2022},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.096082Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:20159b97f79f15033f7b53d5c47f1b1cd7e151852038a8f2e874f26c364e75aa","observation_id":"cb0abf00-ac5b-486a-92aa-80d852fb86ba","resolution":{"observed_at":"2026-08-11T20:30:56.338327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07185","last_updated":"2025-03-08T22:08:40Z","snapshot_observed_at":"2026-08-10T16:28:29.355810Z","submitted_at":"2024-03-11T21:54:52Z","title":"Uncertainty in Graph Neural Networks: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07185","snapshot_observed_at":"2026-08-11T20:30:56.098901Z","title":"Uncertainty in graph neural networks: A survey,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.098901Z"},"links":{"cited_paper":"/paper/2403.07185","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:764f42e11c61363fea7d31dcd3c1ce3b2c380b8cc6422e560e75efeb2dc22155","observation_id":"05624081-2b8c-4e10-b37f-a7412647c957","resolution":{"observed_at":"2026-08-11T20:30:56.098901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.325901Z","title":"Adversarial attack and defense on graph data: A survey,","venue":null,"work_id":"e5a3fe25-053a-48e5-a69d-4aace4eed55c","year":2022},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.101915Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:974ef20aded443b7adefe3a070cdd70764ccc08366f6d76ee67083e3d6d77071","observation_id":"ef07b1ba-c368-4d21-b9a2-f6046412925a","resolution":{"observed_at":"2026-08-11T20:30:56.329429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.316580Z","title":"Adversar- ial graph augmentation to improve graph contrastive learning,","venue":null,"work_id":"5634c781-c3f8-42c3-875b-5d55b7a897e9","year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.104717Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:85c379fdb167a165816082f29078b248f8f63ff5528af3a30819972696e9a9a2","observation_id":"4abd0494-7288-4e2d-9e6c-34baf9508e09","resolution":{"observed_at":"2026-08-11T20:30:56.319899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.13085","last_updated":"2021-02-25T18:55:15Z","snapshot_observed_at":"2026-07-06T10:44:44.451935Z","submitted_at":"2021-02-25T18:55:15Z","title":"Towards Robust Graph Contrastive Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.13085","snapshot_observed_at":"2026-08-11T20:30:56.107570Z","title":"Towards robust graph contrastive learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.107570Z"},"links":{"cited_paper":"/paper/2102.13085","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:7ffbed5dbb62d314dc6d4d7ed6894dc031f7885144d1778f0ae80e20179e365d","observation_id":"9c1cb60a-075b-46ed-a524-dae277ea909a","resolution":{"observed_at":"2026-08-11T20:30:56.107570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.03679","last_updated":"2019-05-10T20:26:51Z","snapshot_observed_at":"2026-07-06T07:51:54.378890Z","submitted_at":"2019-05-09T15:10:30Z","title":"Adversarial Defense Framework for Graph Neural Network","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.03679","snapshot_observed_at":"2026-08-11T20:30:56.110482Z","title":"Adversarial defense framework for graph neural network,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.110482Z"},"links":{"cited_paper":"/paper/1905.03679","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:618dc5d2044abd501828cf70f60a60a5e08810d42cc2d1e8bdbf520972f164f8","observation_id":"89356eb6-8b32-4b24-8ee5-0fa506d96f87","resolution":{"observed_at":"2026-08-11T20:30:56.110482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.306569Z","title":"Adversarial examples for graph data: deep insights into attack and defense,","venue":null,"work_id":"97a59145-5c65-4279-a5f0-0d1acae3bb74","year":2019},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.113676Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:bde81c7eae4bee079a4a7dea37e02dc9b4f596b1485758eb3eb9d5c25dd0f8e1","observation_id":"aba9bab6-db98-48f0-aa6d-9f2a6747dd88","resolution":{"observed_at":"2026-08-11T20:30:56.310021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03833","last_updated":"2024-08-22T10:53:09Z","snapshot_observed_at":"2026-07-06T18:26:19.664486Z","submitted_at":"2024-06-06T08:08:01Z","title":"Talos: A More Effective and Efficient Adversarial Defense for GNN Models Based on the Global Homophily of Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03833","snapshot_observed_at":"2026-08-11T20:30:56.116476Z","title":"Exploiting global graph homophily for generalized defense in graph neural networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.116476Z"},"links":{"cited_paper":"/paper/2406.03833","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:6d1f5561f1714add979ce00664fa409fce370827abc68648b6c89ff6bd2d968b","observation_id":"0b3d411f-dfde-4b5d-91e6-c5452b1a83f3","resolution":{"observed_at":"2026-08-11T20:30:56.116476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.297184Z","title":"Learning to drop: Robust graph neural network via topological denoising,","venue":null,"work_id":"617d2799-640f-4713-8a56-87b98b125dea","year":2021},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.119486Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:628d990f6b35ef17b1b56cfbff3a96f42104a384e43fd4d3655d254dd7668e2f","observation_id":"2662c790-abb8-4815-8e44-7027e9ac42ad","resolution":{"observed_at":"2026-08-11T20:30:56.300410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.287971Z","title":"Learning graph embedding with adversarial training methods,","venue":null,"work_id":"e7c722b5-0fdb-4ea7-a050-132ed9380216","year":2019},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.122317Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:585e8d1a028a017d0db9cb5bd184ce0257946e367a410f369fa1e13a622fc9ff","observation_id":"4133b673-1792-413d-af48-c994c9d587cb","resolution":{"observed_at":"2026-08-11T20:30:56.291410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.08900","last_updated":"2020-06-16T03:30:23Z","snapshot_observed_at":"2026-08-11T11:30:44.737143Z","submitted_at":"2020-06-16T03:30:23Z","title":"DefenseVGAE: Defending against Adversarial Attacks on Graph Data via a Variational Graph Autoencoder","version":1},"cited_work":{"arxiv_id":"2006.08900","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.08900","snapshot_observed_at":"2026-08-11T20:30:56.174210Z","title":"DefenseVGAE: Defending against Adversarial Attacks on Graph Data via a Variational Graph Autoencoder","venue":"cs.LG","work_id":"aef7eab2-b6d1-4380-be9e-7a758a4592c1","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.125271Z"},"links":{"cited_paper":"/paper/2006.08900","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:94c38367f8864916adbe6c3a8798d87673a866c6cbfa6143551a71bd057c19ea","observation_id":"58bfa869-8eb9-446d-8d85-264210a55980","resolution":{"observed_at":"2026-08-11T20:30:56.177824Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03097","last_updated":"2024-06-05T09:40:08Z","snapshot_observed_at":"2026-08-06T18:07:36.786165Z","submitted_at":"2024-06-05T09:40:08Z","title":"Enhancing the Resilience of Graph Neural Networks to Topological Perturbations in Sparse Graphs","version":1},"cited_work":{"arxiv_id":"2406.03097","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.03097","snapshot_observed_at":"2026-08-11T20:30:56.159774Z","title":"Enhancing the Resilience of Graph Neural Networks to Topological Perturbations in Sparse Graphs","venue":"cs.LG","work_id":"b801fe23-7af9-4fec-8e65-c22f223906c2","year":2024},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.128260Z"},"links":{"cited_paper":"/paper/2406.03097","citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:5f520e418275d3dbeb5883be689075d48aadffda8a005960af7d6993bcb14f2b","observation_id":"402f5dff-87ba-4a98-9c1a-f61ea97ad525","resolution":{"observed_at":"2026-08-11T20:30:56.164970Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.279035Z","title":"Effi- cient robustness certificates for discrete data: Sparsity- aware randomized smoothing for graphs, images and more,","venue":null,"work_id":"06201e2d-df14-48be-9459-5020ae2c2692","year":2020},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.131108Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:fec404d87665812968d29f6910aad87588e4faa2232e6e68dee1c35186b29092","observation_id":"e410e1ad-7a29-4506-b2be-2d2fecf8d259","resolution":{"observed_at":"2026-08-11T20:30:56.282190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:30:56.269793Z","title":"However, REGE consistently outperforms REGE-NCT, highlighting the effectiveness of curricu- lum learning","venue":null,"work_id":"ac9d3079-e235-42a2-a17d-68e1aab7bdad","year":null},"citing_paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T20:30:56.134074Z"},"links":{"citing_paper":"/paper/2412.05735"},"observation_digest":"sha256:057b837ae2d9400e04f82b78ab6b0f8ca08cba681bb566423e7297617422d9b1","observation_id":"833383bb-f63c-441a-ba47-88af1eac1982","resolution":{"observed_at":"2026-08-11T20:30:56.273088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.05735","last_updated":"2024-12-07T20:09:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T20:22:13.758914Z","submitted_at":"2024-12-07T20:09:09Z","title":"REGE: A Method for Incorporating Uncertainty in Graph Embeddings"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":2,"verified_fuzzy":52},"total_outbound_references":66},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 0 inbound Pith citation observations for arXiv:2412.05735."}