{"as_of":"2026-08-19T18:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8b21037d09b4f2db106ef6ec05ae8697a69f9e56034a5556b37b46b9ebc9a440","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:21:50.998953Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2504.15905/citation-record","integrity":"/paper/2504.15905/integrity","json":"/paper/2504.15905/citation-record.json","paper":"/paper/2504.15905"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:51.754815Z","title":"Secure and traceable multikey image retrieval in cloud-assisted internet of things.IEEE Internet of Things Journal, pages 1–1, 2024","venue":null,"work_id":"e3a90fbf-fed8-41fe-a20b-71f6fc4b41d9","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.759743Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:33ff1c6cf4850e6824a8d01f9fcec0006d047e967dda3f2a78a60c292b2904c9","observation_id":"a88d9632-5689-4918-b032-a6459d9ea08f","resolution":{"observed_at":"2026-08-16T11:21:51.758382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.743422Z","title":"Alqahtani,andMinChen","venue":null,"work_id":"5c8eac90-a021-4ddc-b7da-e9a02524aba4","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.764862Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:e3db08312339541f29eb2762c69ed58b681f92581600f5774f6622c47f6269c8","observation_id":"d2440950-50e5-4ba4-9219-ebab1a0659c7","resolution":{"observed_at":"2026-08-16T11:21:51.746821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.730143Z","title":"Enabling balanced data deduplication in mobile edge computing.IEEE Trans- actionsonParallelandDistributedSystems ,34(5):1420–1431,2023","venue":null,"work_id":"07131068-aaf7-4b7c-bfd2-7676114bc9ee","year":2023},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.768535Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:81baa9b0fe7c876f080898696061efe3699ec6c132ec9463e7c4ddf33b561e17","observation_id":"9f36a806-b54a-44ca-8188-5547ef8c64cf","resolution":{"observed_at":"2026-08-16T11:21:51.734590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.717180Z","title":"Ripple: Enabling decentralized data deduplication at the edge.IEEE Transactions on Parallel and Distributed Systems, 2024","venue":null,"work_id":"e9426301-cc88-4ec2-8859-393b1dd6bf1a","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.772478Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:cc22f0840da7fd057c6762bb42e07129253fda9c34bf4b93ccdc8b3720d776b8","observation_id":"57ec1fa9-cee7-4e55-87e1-b299da7b824e","resolution":{"observed_at":"2026-08-16T11:21:51.721571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.704809Z","title":"Edge data deduplication under uncertainties: A robust optimization approach.IEEE Transactions on Parallel and Distributed Systems, 2024","venue":null,"work_id":"14a21446-6ed4-4cc1-9d67-f329d1189284","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.776352Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:6b9de8351745eb810560ed1bc434a808eb7c78b544c792b53a43c9d36c574d76","observation_id":"9e97b775-a803-4235-bfa5-bf2811995dc3","resolution":{"observed_at":"2026-08-16T11:21:51.708932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.689231Z","title":"Influence maximization on social graphs: A survey","venue":null,"work_id":"e95682d4-882e-4be5-a1d1-2c76c9f11611","year":2018},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.780148Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:88d4cfd2c220fefdceec3610414c3e465a32af77eb28bb6f94b40c97b69d144c","observation_id":"ad659637-a763-4126-8aad-6f43afad5a9e","resolution":{"observed_at":"2026-08-16T11:21:51.694784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.676341Z","title":"IEEETransactions on Vehicular Technology, pages 1–16, 2023","venue":null,"work_id":"8c97e7a6-71cd-44ba-a580-4a8468b50176","year":2023},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.785387Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:7c4af8fc13bf6ccf6d176d58b1b616a118af7bc536edd00672792dbcf3901d29","observation_id":"74e8424a-95a3-40cb-8381-a51adb46e32c","resolution":{"observed_at":"2026-08-16T11:21:51.680449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.664782Z","title":"Evit: Privacy-preserving image retrieval via encrypted vision transformer in cloud computing.IEEE Transactions on Circuits and Systems for Video Technology, 34(8):7467–7483, 2024","venue":null,"work_id":"b5a8848b-ad51-487c-bcb2-59b65469a151","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.789379Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:8447d7fbcf9e7f4810444973a1d08b90ec7170031b560647c766133f18213c78","observation_id":"070b48c1-bac0-42f8-ba4c-48e02fd258d3","resolution":{"observed_at":"2026-08-16T11:21:51.669100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.653620Z","title":"Novel transformation deep learning model for electrocardio- gram classification and arrhythmia detection using edge computing","venue":null,"work_id":"f23d2e68-ec83-43de-9125-fe7d709081e8","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.793332Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:be2b7588e5a7575965a37e461d7d6f526571c2f89e74e0daa80973b4eeb91fe5","observation_id":"7a1c2824-6530-4e4d-9afe-5233ab41aa48","resolution":{"observed_at":"2026-08-16T11:21:51.657739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.641882Z","title":"Real-time monitoring and analysisoftrackandfieldathletesbasedonedgecomputinganddeep reinforcement learning algorithm.Alexandria Engineering Journal, 114:136–146, 2025","venue":null,"work_id":"feaee98b-d7c5-4b84-8c0b-96a06f75733b","year":2025},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.797580Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:c53cbe40be8ac03c2ccbc09347160941a206285b6b1ce1223e760bc15e9cb913","observation_id":"e39cd530-17e7-498c-9ae5-3ced334e1bb4","resolution":{"observed_at":"2026-08-16T11:21:51.646125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.629757Z","title":"Agricultural weed identification in images and videos by integrating optimized deep learning architecture on an edge computing technology","venue":null,"work_id":"ed96eff5-0172-4045-93b6-ba0f5dc0a18c","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.801545Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:f34343d8e8e805db87c3aba09a242dbe0804201ea861b48c77f86bf5aacf1e68","observation_id":"07713c3f-91de-4b46-b856-3a25ed151a59","resolution":{"observed_at":"2026-08-16T11:21:51.633285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.619436Z","title":"Pflow: An end-to-end heterogeneous acceleration frame- work for cnn inference on fpgas.Journal of Systems Architecture, 150:103113, 2024","venue":null,"work_id":"9bc31d15-0e9c-4b2c-889c-a7b78d119dc1","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.805647Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:49a74b1e6b4b543bbb9ba862db84e9bffac8ec9017e125e6377685fde83341fa","observation_id":"c8692869-c66a-4b83-83aa-5ce9184a14b6","resolution":{"observed_at":"2026-08-16T11:21:51.622917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.608711Z","title":"Asurveyofvideo surveillance systems in smart city.Electronics, 12(17):3567, 2023","venue":null,"work_id":"02bc38b3-0f72-43b1-abed-8ca22b2450aa","year":2023},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.810560Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:f407d9a71d602040c88c4339334d3bfe2244d7742022cf3c467024feaa35d91a","observation_id":"e2557e18-9799-4c4b-8efd-04f078dab08e","resolution":{"observed_at":"2026-08-16T11:21:51.612564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.596823Z","title":"mm-casgan: A cascaded adversarial neural framework for mmwave radar point cloud enhancement.Information Fusion, 108:102388, 2024","venue":null,"work_id":"101f76ee-67ff-4646-a137-ce37f61eb08b","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.814563Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:5f45a17871609b25d1ccf0e11c68612d021c3e0272ae987226711a2684e2bef1","observation_id":"dee236d7-43e9-4d7f-831e-b98f2e43a552","resolution":{"observed_at":"2026-08-16T11:21:51.600767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.584518Z","title":"Cool: a conjoint perspective on spatio-temporal graph neural network for traffic fore- casting","venue":null,"work_id":"c1e68d8b-bd83-4d01-b853-b6d9725002b9","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.823098Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:28b12d3048cb4f23fcc143a54af4c5be4d3d043affedf19afe37d6764a481720","observation_id":"b3e290c8-4b11-4889-b9c9-23d669ca6a6a","resolution":{"observed_at":"2026-08-16T11:21:51.588736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.572483Z","title":"Eeoa: cost and energy efficient task scheduling in a cloud-fog framework.Sensors, 23(5):2445, 2023","venue":null,"work_id":"9f31d6e8-80d6-4cde-9c39-8ca2f90c3544","year":2023},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.830327Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:a04e0d1e96525936dc66184bde31e02a00def554763587595a64422b1bc7b730","observation_id":"ebaadd64-86c7-4ff1-aeb1-2724f3a3d72a","resolution":{"observed_at":"2026-08-16T11:21:51.576818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.561387Z","title":"A cost and energy efficient taskschedulingtechniquetooffloadmicroservicesbasedapplications in mobile cloud computing.IEEE Access, 10:46633–46651, 2022","venue":null,"work_id":"0cca2365-171e-4cf8-a9ed-d82d2f3193d0","year":2022},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.834098Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:22b6fd3059fa8d69c65244a545e02d7d7caebeaf825b063a8f60b6c22a79b96a","observation_id":"66b11a2d-d8c7-4065-9a80-78a6c9b00fa0","resolution":{"observed_at":"2026-08-16T11:21:51.565334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.550138Z","title":"Adaptive compression offloading and resource allocationforedgevisioncomputing","venue":null,"work_id":"6ac6ffb2-e77d-4929-9d77-80be9b041011","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.838052Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:8f467256bcecc7feaf8c231fa28e5de055d459d05378d621371f6af273698252","observation_id":"75d78c8b-f4a8-4322-9316-5b9a72ceb12f","resolution":{"observed_at":"2026-08-16T11:21:51.553971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.538512Z","title":"Deep reinforcement learning for trajectory path planning and distributed inference in resource- constrained uav swarms","venue":null,"work_id":"cad7be41-7ff3-400a-994d-194b96f75d5c","year":2022},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.841634Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:0a238f8885f3def77a18153d8757e0bf0585f017c858cc29f47304cbd332b5dc","observation_id":"4a521c76-bd90-429f-ab0e-2bee20a7bc9f","resolution":{"observed_at":"2026-08-16T11:21:51.542520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.526854Z","title":"Joint multi-domain resource allocation and trajectory optimization in uav-assistedmaritimeiotnetworks","venue":null,"work_id":"38149452-9ebc-49f2-84b4-eff478a334df","year":2022},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.845425Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:28f758fdfc40aa9f26f0d49fed33169a7856a5509af996fa2250da0b8ebc52f4","observation_id":"7704b182-6508-4d67-b8c7-e508b45c2bf5","resolution":{"observed_at":"2026-08-16T11:21:51.530896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.513915Z","title":"Digital twin-assisted urllc-enabled task offloading in mobile edge network via robust combinatorial optimization.IEEE Journal on Selected Areas in Communications, 2023","venue":null,"work_id":"8959e8c5-72ae-4f31-bdcb-f74ea7e1f9b5","year":2023},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.849433Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:a6aa967ec80c9c4104be15bf08c7bae3bfb1faac7143a4d485edf32e14132887","observation_id":"0cfd8c66-ba9c-45ce-a303-6f66a0cb7570","resolution":{"observed_at":"2026-08-16T11:21:51.517859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.502361Z","title":"Joint sensing adaptation and model placement in 6g fabric computing.IEEE Journal on Selected Areas in Communications, 41(7):2013–2024, 2023","venue":null,"work_id":"ac4d2cd0-92e3-4b0a-9e6b-369871860719","year":2013},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.853106Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:d7ff233c053241c8083f5e5fa78bff0798e67092236f7ebac62952362cb05a1b","observation_id":"8ee45195-46e8-430e-a40f-783ef16748a8","resolution":{"observed_at":"2026-08-16T11:21:51.506421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.489801Z","title":"Collaborative computation offloading and resource allocation in multi-uav-assisted iotnetworks:Adeepreinforcementlearningapproach","venue":null,"work_id":"673a1004-7fc6-4600-badd-7b6407e40be2","year":2021},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.857397Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:4132a915ef00eae93f3f9a159aa0f6dbef5824cf2b3218f3abd7314f5038c46a","observation_id":"09ecefe2-6284-4096-abc4-fe7be48d34d7","resolution":{"observed_at":"2026-08-16T11:21:51.493460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.478690Z","title":"Jointuavtrajectoryplanning,dagtaskschedul- ing, andservice functiondeployment basedon drlin uav-empowered edge computing","venue":null,"work_id":"60418739-edfc-41d9-ad8c-e3669dd0444b","year":2023},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.861214Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:416909c39885a64828833257f9742a7df26e1d2cdb6a22a01eb4406f53ffd1c3","observation_id":"3c2b3a1f-baa9-4457-95e9-3a5c59f842c1","resolution":{"observed_at":"2026-08-16T11:21:51.482458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.467423Z","title":"Sgpl: An intelligent game-based secure collab- orative communication scheme for metaverse over 5g and beyond networks.IEEEJournalonSelectedAreasinCommunications ,2023","venue":null,"work_id":"6ad7a239-4c91-4d4b-b8e6-a0e1d365dc5d","year":2023},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.864638Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:23970bfebc6e03cec76fd4bf4666d1b0d6b41a20223df97775e20ee9a6f57a94","observation_id":"04904765-edc5-4e9e-a467-d4fd768c0ae4","resolution":{"observed_at":"2026-08-16T11:21:51.470955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.456625Z","title":"Model-assistedmulti-source fusion hypergraph convolutional neural networks for intelligent few- shot fault diagnosis to electro-hydrostatic actuator","venue":null,"work_id":"3aaf5c87-9c28-4b83-8eda-63352eab33ae","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.869091Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:cab0c6b897715cacb67c3a87d4bf81deddab20f5190d0a75d90bb8b44a67df0a","observation_id":"fa3b59bf-225e-4364-a9aa-624bfc4a3dea","resolution":{"observed_at":"2026-08-16T11:21:51.460329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.445291Z","title":"Enhancement of traffic forecasting through graph neural network-based information fusion techniques.Information Fusion, 110:102466, 2024","venue":null,"work_id":"a4fcf894-dc53-46e3-aabb-f6728814846f","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.872741Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:cb169b003fd189d6981a8754928984d541b05334fa38cd3bc66ab4042d811fd0","observation_id":"3bcc7a88-9b4a-47bb-8525-ef45a35b17fd","resolution":{"observed_at":"2026-08-16T11:21:51.449040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.434153Z","title":"Neural network operators: constructive interpola- tion of multivariate functions.Neural Networks, 67:28–36, 2015","venue":null,"work_id":"ca56a871-151b-45b0-9df0-87327ad7de1d","year":2015},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.877200Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:b52ae58b0d0c3d81b9e5bf5aa5549e684696486c3c504a7a8e0a61c2febe74c9","observation_id":"fe84f824-898b-4062-874b-04a384595f3e","resolution":{"observed_at":"2026-08-16T11:21:51.438051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6203","last_updated":"2014-05-21T16:27:09Z","snapshot_observed_at":"2026-08-14T23:50:42.645895Z","submitted_at":"2013-12-21T04:25:53Z","title":"Spectral Networks and Locally Connected Networks on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6203","snapshot_observed_at":"2026-08-16T11:21:50.881599Z","title":"Spectral networks and locally connected networks on graphs.arXiv preprint arXiv:1312.6203, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.881599Z"},"links":{"cited_paper":"/paper/1312.6203","citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:9c955171ffcc7f1cfb7475276bb22053a0bc20cc5c237cc754a76cac075d10f0","observation_id":"985b46c6-b27f-4f77-8c0e-415bd7cf3a4a","resolution":{"observed_at":"2026-08-16T11:21:50.881599Z","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-16T11:21:51.422247Z","title":"Inductive repre- sentation learning on large graphs.Advances in Neural Information Processing Systems, 30, 2017","venue":null,"work_id":"8fc43ef8-4d44-469e-959d-5dd9463f68b6","year":2017},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.886721Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:aa6e3d73b652d9d6555dbd82ec95c1d6f02f68d94f48d818a6afd86797e6800d","observation_id":"a044bc8a-352d-422b-9286-128eb4083595","resolution":{"observed_at":"2026-08-16T11:21:51.426248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.407737Z","title":"Spatio- temporalfusiongraphconvolutionalnetworkfortrafficflowforecast- ing","venue":null,"work_id":"cc78aef5-cc39-464c-9a70-1962c98f7d9b","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.893295Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:de845348939b69984cb942bedf8be894c79ebab47797b2b514b95ee98ca7e9bf","observation_id":"7fd3412b-67cf-4f3b-9709-3d799a7664ce","resolution":{"observed_at":"2026-08-16T11:21:51.412502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.394211Z","title":"Fograph:Enablingreal-timedeepgraphinferencewithfog computing","venue":null,"work_id":"b41a2a55-e94d-427b-89d6-fe66e84464da","year":2022},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.900416Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:2264ff867cc703f5c5e7c715d1b190eedb036492f77e540da65701ac71748aee","observation_id":"7bd91d45-542b-4dea-9d5a-9931d4791d1d","resolution":{"observed_at":"2026-08-16T11:21:51.398957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.07145","last_updated":"2021-09-08T00:22:55Z","snapshot_observed_at":"2026-08-16T18:31:31.761361Z","submitted_at":"2021-04-14T22:11:35Z","title":"FedGraphNN: A Federated Learning System and Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.07145","snapshot_observed_at":"2026-08-16T11:21:50.905754Z","title":"Fedgraphnn: A federated learning system and bench- mark for graph neural networks.arXiv preprint arXiv:2104.07145, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.905754Z"},"links":{"cited_paper":"/paper/2104.07145","citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:358c0335191bd12b7dfb9b1f058a23d73810dae8e58ed6842f0e6277035d6b0e","observation_id":"7ed991a0-b046-4a14-bbe2-570c327dbc80","resolution":{"observed_at":"2026-08-16T11:21:50.905754Z","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-16T11:21:51.381310Z","title":"Reducing com- munication in graph neural network training","venue":null,"work_id":"afd5d9cc-2588-4800-aa2c-68680d6be5c6","year":2020},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.910512Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:29780defa174c496c8769d88a9ba76d7cf66321cb44376b40c5d49fd4d0c35e6","observation_id":"7a046e49-c1a7-4a89-bec7-1bfa6bac675e","resolution":{"observed_at":"2026-08-16T11:21:51.385934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.365498Z","title":"Distdgl: distributed graph neural network training for billion-scale graphs","venue":null,"work_id":"cb89d0b3-d700-44b4-b27d-1d5595e96d83","year":2020},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.914498Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:7ffe3fe0fd8ccaf4623a2ae8141f43459719f296f6d3793bbfa5a5dbb336f2ba","observation_id":"8d7093a9-af7e-4f8b-9402-53effb789dd6","resolution":{"observed_at":"2026-08-16T11:21:51.370260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.350059Z","title":"Gnn at the edge: Cost-efficient graph neural network processing over distributed edge servers.IEEE Journal on Selected Areas in Communications, 41(3):720–739, 2022","venue":null,"work_id":"c9cd4994-cae6-4404-a173-9d61b7b1b497","year":2022},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.918272Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:50967b9ca56d0aa51d428b4e43837fe0204da0ece276d963429cc11a7e63fe88","observation_id":"d97dbf09-c4e2-4292-8371-272d9639f79f","resolution":{"observed_at":"2026-08-16T11:21:51.355198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.329176Z","title":"Intelligent offloading and resource allocation in heteroge- neous aerial access iot networks.IEEE Internet of Things Journal, 10(7):5704–5718, 2022","venue":null,"work_id":"0a97ee8a-d04c-4d9e-829e-098c1f511750","year":2022},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.923778Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:1909457757cadb7e642265882e53fffe5dfb056c47880bddd0bb60f487976b5b","observation_id":"7a662844-089d-448c-bc28-e34373e398d6","resolution":{"observed_at":"2026-08-16T11:21:51.334021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.309820Z","title":"Multi-agent reinforcement learn- ing based resource management in mec-and uav-assisted vehicular networks","venue":null,"work_id":"8bf458db-deb1-432f-99c1-978e72f214b1","year":2020},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.928092Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:1520caafbaa53b60a277e189f857c7ce4bbb625c92a9783c37338e09d5b0ab81","observation_id":"a9412e00-340a-4e13-9b2b-b8a103a97625","resolution":{"observed_at":"2026-08-16T11:21:51.314366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.286426Z","title":"Graph-reinforcement- learning-basedtaskoffloadingformultiaccessedgecomputing","venue":null,"work_id":"406387c4-bcce-4b4d-9920-507c3a452291","year":2021},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.932378Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:7a1c63dbd80833e472dff087e6fc4e2d0d39f4ed38dc3aaf7eec4d096fb3d4a9","observation_id":"7dedc3a8-0084-45a2-ab9c-b1b42413c995","resolution":{"observed_at":"2026-08-16T11:21:51.290086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.274337Z","title":"Exploring graph neural networks for joint cruise control and task offloading in uav-enabled mobile edge computing","venue":null,"work_id":"a5b7710d-ad5e-4bcf-a80e-c682e574ff96","year":null},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.936813Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:fd8e4173fffaeed11b887b4c0bdbc75321e84a0af48dd026050c434d03df38a9","observation_id":"92da0b73-7fa8-4246-930c-09eb1fe20472","resolution":{"observed_at":"2026-08-16T11:21:51.278272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.259350Z","title":"Dynamic semantic compression for cnn inference in multi-access edge computing: A graph reinforcement learning-based autoencoder.IEEE Transactions on Wireless Communications, 2024","venue":null,"work_id":"049fd2d2-897f-4a11-a1b1-1045c384bbfd","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.941458Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:e076d117eaf334965e1104f444933ac54e762adcdb7546a81e30901fbd4fd7e0","observation_id":"b53dd70c-8aee-4966-bd01-bc3f9104c9ff","resolution":{"observed_at":"2026-08-16T11:21:51.264399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.242283Z","title":"Dependenttaskoffloadinginedgecomputingusinggnn and deep reinforcement learning.IEEE Internet of Things Journal, 2024","venue":null,"work_id":"e8ab5f4f-80b5-417f-b776-f9d0ec75d025","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.945535Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:fda69400304d6cf33f6ce6296cb84b1c7f451e6ab46a57bda3404a33d864f541","observation_id":"fa9b852c-3242-470a-8c7d-d3b2c4a0b8b6","resolution":{"observed_at":"2026-08-16T11:21:51.248433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.226459Z","title":null,"venue":null,"work_id":"7001b0ba-40b3-479d-b675-fb3b2dbcde7b","year":2025},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.950866Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:ea2a609bbd1fc9332eed8aeb83d020c7915cec962f276a6edf5ea09b27a8bc0f","observation_id":"d5141e09-8607-49b5-aec0-c05d17ece744","resolution":{"observed_at":"2026-08-16T11:21:51.231574Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.210050Z","title":"Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2","venue":null,"work_id":"fc7e1a4a-47ed-4b82-b0f6-7c440e63dd19","year":2006},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.955161Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:608dd0f57a31744bf788a97a562fa2cc5f2bdf467ec6fa6bd17267d3cacb3b18","observation_id":"9599eef1-06bd-4192-8022-c073764cac6b","resolution":{"observed_at":"2026-08-16T11:21:51.214699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.196348Z","title":"Connectivity algorithm with depth first search (dfs) on simple graphs","venue":null,"work_id":"2f006523-adc8-47e5-a187-5d8c2d9ddffb","year":2018},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.960658Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:81b2940f066a10020bd553269539cc1576dc90c7da934003eda37d9149cc088b","observation_id":"97240139-06ff-4a64-b808-845ce5436efc","resolution":{"observed_at":"2026-08-16T11:21:51.200995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.183428Z","title":"Multi-agent actor-critic for mixed cooperative- competitive environments.Advances in Neural Information Process- ing Systems, 30, 2017","venue":null,"work_id":"a584ec18-4182-4eda-9726-36417bfa3b1f","year":2017},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.964885Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:c0d5d4812a74f1cae6872405a167f3b7fa5ae2df7e082303cf94676114459356","observation_id":"e9a0d611-6e3e-4080-afbb-6c7e10cb7be9","resolution":{"observed_at":"2026-08-16T11:21:51.187805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.171795Z","title":"Multistageenergymanagement ofcoordinatedsmartbuildings:Amultiagentmarkovdecisionprocess approach","venue":null,"work_id":"db105b60-fa56-4e58-b928-1ea593205596","year":2022},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.969296Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:80e4863da64eef5caa9e31928625181722998147964959f536cd9efb1dfe0e14","observation_id":"4d5c6edc-4437-4756-8740-84ba6b1f97c3","resolution":{"observed_at":"2026-08-16T11:21:51.175552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.159916Z","title":"Data fusion and transfer learning empowered granular trust evaluation for internet of things.Information Fusion, 78:149–157, 2022","venue":null,"work_id":"c568a173-54f5-4116-9f54-f47d06f5f5ef","year":2022},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.973068Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:8ee4e600edf264629722e3ee5f764b3f52f1bfe46761af259c3b11b1bf268118","observation_id":"2b33e64c-250a-4afe-9c92-2acc8a4c2653","resolution":{"observed_at":"2026-08-16T11:21:51.163988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.145518Z","title":"Fairness- based3-dmulti-uavtrajectoryoptimizationinmulti-uav-assistedmec system.IEEEInternetofThingsJournal ,10(13):11383–11395,2023","venue":null,"work_id":"730bd7bb-8241-4945-9e28-8b75e2acf6ab","year":2023},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.976358Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:e5ad510b71ecdc4a7de7a562b5299627fe29e2634637776cbf9d51014cd708a2","observation_id":"f77f3fc0-6513-4c2a-ab15-114e004777b2","resolution":{"observed_at":"2026-08-16T11:21:51.150530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.131175Z","title":"Chatmdg: A discourse parsing graph fusion based approach for multi-party dialogue generation","venue":null,"work_id":"135d7ca1-b1c5-414c-a1fe-8cc25909a805","year":2024},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.979779Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:f2012c844c85fe964768f306a6aedfcd77bd77f939185b32f23c6996c97b9a0e","observation_id":"ac8073d2-5b6e-4649-9c9f-3e619ed5c58e","resolution":{"observed_at":"2026-08-16T11:21:51.135955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.117512Z","title":"Simplifying graph convolutional networks","venue":null,"work_id":"13f84c46-2f44-4746-ab33-dfc9df1e761f","year":2019},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.983252Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:d1f1436828c7223e04806663021a5e316190db9493a00739aa264664e8378fab","observation_id":"5efc8cf0-22af-43fd-acf6-f5da3d344ab3","resolution":{"observed_at":"2026-08-16T11:21:51.121556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.103789Z","title":"Energy– latency tradeoff for computation offloading in uav-assisted multi- access edge computing system","venue":null,"work_id":"0345cac6-b9c7-4fe4-820e-94ba8006ec39","year":2020},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.988001Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:be90a40a5b34c7e47e21814d49a1535e95cfc05643839f47f9188ed0a0ebdb4b","observation_id":"a868b6ab-a1d4-4535-9d5f-b8d52d37661c","resolution":{"observed_at":"2026-08-16T11:21:51.108547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.089970Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":"b27588fa-56e7-4783-bb94-13dcc4ca6c25","year":2016},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.991677Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:4b7b64fee37f9e41c2424dd51458d3e9470641063122a582942c97bc126472ed","observation_id":"fc221702-59b6-4d80-9aae-becf4e30c8bd","resolution":{"observed_at":"2026-08-16T11:21:51.094024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:21:51.076014Z","title":"Collective classification in network data","venue":null,"work_id":"d8e85038-b4b9-41bc-94c0-ca7ab04e638d","year":2008},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.994796Z"},"links":{"citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:441708d6eac32d28667e6d8f01f05513783c82875c7aabb5cc861bf0ff616de6","observation_id":"1632533f-fde4-44d6-92c1-2ac2aa1b4acb","resolution":{"observed_at":"2026-08-16T11:21:51.081570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-16T11:21:50.998953Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T11:21:50.998953Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2504.15905"},"observation_digest":"sha256:947b216a1de3c05b029622a81e2ceabfdab052265831b3333a7bf54cba4a0ffb","observation_id":"58514b93-4309-46db-81db-0ece5e5678dc","resolution":{"observed_at":"2026-08-16T11:21:50.998953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.15905","last_updated":"2025-04-22T13:45:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T11:13:01.517875Z","submitted_at":"2025-04-22T13:45:13Z","title":"GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":51},"total_outbound_references":55},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2504.15905."}