{"as_of":"2026-08-07T10:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88a2366642d860beffbeecf8d2a55966b225dc4117511b779f99bd48d0bdaedb","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:29:43.741833Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2509.05447/citation-record","integrity":"/paper/2509.05447/integrity","json":"/paper/2509.05447/citation-record.json","paper":"/paper/2509.05447"},"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-05T05:29:44.289423Z","title":"Distributed link sparsification for scalable scheduling using graph neural networks,","venue":null,"work_id":"5606f89a-f8e7-4081-9894-caf8a6fd5c37","year":2022},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.393765Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:0f28f5e20054b745a865c8b5250c525f50a6110e3979f71dca441fbe3305cf69","observation_id":"b15e6447-f163-42c3-930e-56cf9182a917","resolution":{"observed_at":"2026-08-05T05:29:44.292063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.281872Z","title":"Cisco annual internet report (2018–2023),","venue":null,"work_id":"7e75d56c-527e-4aa2-a930-d94777c952d9","year":2018},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.465607Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:3eac8567ec51f0a5f08209bb80fcc13635d435ba29b1a84ad4e79b7e90e1895e","observation_id":"1d7608bf-7914-4ed5-b663-661783847cdf","resolution":{"observed_at":"2026-08-05T05:29:44.284681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.274658Z","title":"The internet of battle things,","venue":null,"work_id":"2252a35b-279f-4feb-9a64-d5561bf966b5","year":2016},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.499285Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:4e6f0a2b2661cebadf578bcc5a96af997ca59f07403973cd3b6a1313857ed0ff","observation_id":"88f43473-2bf0-41aa-947f-067e0e425359","resolution":{"observed_at":"2026-08-05T05:29:44.277368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.267424Z","title":"6G and beyond: The future of wireless communications systems,","venue":null,"work_id":"70b43d6d-5b78-4afd-92bd-5633f145a2b0","year":2020},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.560418Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:36084335e7828fb2683ad8410874d1d9f3d379bb454210af84fb420c12994b1a","observation_id":"606f1f68-700d-4d9d-8cc4-ff311d7b5090","resolution":{"observed_at":"2026-08-05T05:29:44.270085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.259179Z","title":"Massive access for 5G and beyond,","venue":null,"work_id":"5c297acf-0523-44ea-b1dd-6962bd52b32b","year":2021},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.625720Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:25338e801c4f1144bc0ee6cf70c0e2f19178527f2539feb81fdd582ffbbf6589","observation_id":"aa29a626-cadc-4f33-bc94-a1d747624efc","resolution":{"observed_at":"2026-08-05T05:29:44.261907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.251288Z","title":"Toward massive machine type commu- nications in ultra-dense cellular IoT networks: Current issues and ma- chine learning-assisted solutions,","venue":null,"work_id":"679ba921-5367-40f2-b2bb-981f31ba4dd7","year":2020},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.684413Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:ebbbd6c76f57cb6d784a91595b084432b6cf9da244d0707e8256b64f3d3783a9","observation_id":"d18a49ab-57c5-49c8-9012-4fd775b02268","resolution":{"observed_at":"2026-08-05T05:29:44.254131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.243902Z","title":"A tutorial on cross-layer opti- mization in wireless networks,","venue":null,"work_id":"d1fed7b7-93cc-4900-94b5-fcc4a8301fbb","year":2006},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.753681Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:dfe59b5d1d5dcf4e32be4901b414f31ce3ec3c538ffb694c38ced0ab2cf18a9f","observation_id":"ea284207-bc2b-457f-9bd4-45486310fc85","resolution":{"observed_at":"2026-08-05T05:29:44.246552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.236163Z","title":null,"venue":null,"work_id":"371aec63-32ca-4119-86ef-1513bbad7d04","year":2013},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.790840Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:0f9c89fa916768befd0ba7db98243135835b9b269f7912c11cedcb63103de6af","observation_id":"0778ce3f-f908-42c5-a695-5086ac58b1ae","resolution":{"observed_at":"2026-08-05T05:29:44.238527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.229474Z","title":"Performance evaluation of backpressure routing in integrated satellite-terrestrial backhaul for PPDR networks,","venue":null,"work_id":"bbd70dba-7db5-4ca1-836d-1d2c92dd0f1f","year":2016},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.847640Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:a31acd84efd94b04ec2cc0097a3b91adf4a1fffe226b528c5775b526b3217250","observation_id":"cfc73555-8906-4859-9700-2a63fa248b83","resolution":{"observed_at":"2026-08-05T05:29:44.231892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.222143Z","title":"Integrated access and backhaul: A key enabler for 5G millimeter-wave deployments,","venue":null,"work_id":"ef8c8221-2eb5-44a6-b662-010c7e0315f0","year":2021},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:38.931620Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:7cd1f0f168674a6f0760db04aa607cb055aaebfe1cc20c398881a04c32aa0b16","observation_id":"9055378e-13ed-4a9f-929a-6608ed6c35f8","resolution":{"observed_at":"2026-08-05T05:29:44.225194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.215561Z","title":"Graph-based deterministic policy gradient for repetitive combinatorial optimization problems,","venue":null,"work_id":"f7688e49-f0c4-4383-8c0a-bd3320e413a9","year":2023},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.013317Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:77eb473c578baeecfb8704093a2225180167fd61f1546e96889ee4b23f99f596","observation_id":"ddd5fc4a-feca-4013-8a78-f6f29e32a044","resolution":{"observed_at":"2026-08-05T05:29:44.217954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.208671Z","title":"Link scheduling using graph neural networks,","venue":null,"work_id":"af01341a-ce4d-48fb-a15a-1f3183295a92","year":2023},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.101060Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:c6ff2174eaa770cc8c79a401e360d696b43c5999e10b99c54c36c7dad03beaa5","observation_id":"f5ad5d62-627a-4531-b54b-59263fe17d00","resolution":{"observed_at":"2026-08-05T05:29:44.211153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.201386Z","title":"Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks,","venue":null,"work_id":"0309a8c5-286f-4f4c-8709-50c1546c6c33","year":2009},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.180681Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:338cd519cc99f11d3fc57b2f329f88296602ee8447b173b7361cffe827dbdcf0","observation_id":"3fd992ce-8653-430f-8578-5f0991965034","resolution":{"observed_at":"2026-08-05T05:29:44.204059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.194086Z","title":"Optimal cross-layer design of wireless fading multi-hop networks,","venue":null,"work_id":"38546e56-249a-45da-ad39-a255f76f967d","year":2011},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.251698Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:679c0f7e760531a13714ebee3ec63ff5c41e9262485e38323e41cb2c6d1d6428","observation_id":"bff7eb67-83cb-4b88-9f74-37a8ac5b6c96","resolution":{"observed_at":"2026-08-05T05:29:44.196758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.186510Z","title":"Finding a maximal weighted independent set in wireless networks,","venue":null,"work_id":"7409c7a2-3841-4392-9b7e-a6ce844f35ab","year":2001},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.300671Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:f804407e7805943116e5f93830c8619115bd123b5a8160435ca5aa3240c37874","observation_id":"6fba4538-d3a4-4f7a-96e6-0ebf022adeb9","resolution":{"observed_at":"2026-08-05T05:29:44.189187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.179021Z","title":"The complexity of channel scheduling in multi-radio multi-channel wireless networks,","venue":null,"work_id":"7b6cdce3-e35c-4594-a598-5d3c629db97d","year":2009},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.362059Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:25d4eae3c7edb47eed039043c9944bde5169e0a4df0b5fb59249421d36159ddb","observation_id":"d7720c17-70ec-4013-9082-14ecd9eb3369","resolution":{"observed_at":"2026-08-05T05:29:44.181560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.172247Z","title":"Local greedy approximation for scheduling in multihop wireless networks,","venue":null,"work_id":"e4ab5161-d700-418b-9c53-196f3c620cbd","year":2012},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.432771Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:d1ebfcbdf7460198255b13b757e08e3883f1fb154e676ba214ffac9b44f6dbfc","observation_id":"caf6a33b-df71-4908-8b39-83fab57b514a","resolution":{"observed_at":"2026-08-05T05:29:44.174580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.164978Z","title":"Distributed greedy approxima- tion to maximum weighted independent set for scheduling with fading channels,","venue":null,"work_id":"9a0ca111-b4df-4410-ad50-365ff72656b6","year":2015},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.505300Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:812f63d20fd872ab02f059ff9b45867057044fe76e7f3573db53e08eae1146b3","observation_id":"64ad1b0e-6f73-4741-91f3-c6c3d38067de","resolution":{"observed_at":"2026-08-05T05:29:44.167926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.157835Z","title":"A new distributed approximation algorithm for the maximum weight independent set problem,","venue":null,"work_id":"90721f1c-e78b-468c-95e1-b1f31f0562a2","year":2016},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.544537Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:ca045a4b00304fa8c438a68c9c531d43e27e5c5094d43e285d511ceb820a925a","observation_id":"d6a7ed06-3b71-42e7-9121-a3e556aacef6","resolution":{"observed_at":"2026-08-05T05:29:44.160243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.150583Z","title":"A message-passing algorithm for wireless network scheduling,","venue":null,"work_id":"fcef57ed-6140-4cec-acdd-66bb013f1d43","year":2015},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.610334Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:5aef8bdeda280dba99bdb804ef7c90c97e3390ec5ac61231557b89ab271c8641","observation_id":"38b1855a-a1e8-4730-b329-12a5c987d394","resolution":{"observed_at":"2026-08-05T05:29:44.153363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.142731Z","title":"On the complexity of scheduling in wireless networks,","venue":null,"work_id":"30ce139a-582d-438a-872f-b00271993405","year":2010},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.658238Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:d82e520a816bce017fbefd8f2bfdf9f5ffa49eeefa0e4cbb501737d867f8916f","observation_id":"7a0b281d-0d4b-4b2d-8093-a62e01ae4d97","resolution":{"observed_at":"2026-08-05T05:29:44.145348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.135502Z","title":"Distributed scheduling using graph neural networks,","venue":null,"work_id":"491e9bcf-2936-435a-9c29-cca3acc22ba3","year":2021},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.730122Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:d0e1c5f78537467ca3bb08fe7cd48be36566da4b2d8622464077d3eca1704c63","observation_id":"60c0c22b-b508-4367-997c-a0d9d9148231","resolution":{"observed_at":"2026-08-05T05:29:44.137831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.128264Z","title":"Q-CSMA: Queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks,","venue":null,"work_id":"f5d0df0b-2016-48bb-bf8f-e6624b924c37","year":2012},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.786561Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:d58e369da4aa581d96f5af2b0ea807f3b1c8888d2b098396d1dd1563b9a8499f","observation_id":"757c5bc8-4db3-47fb-85d9-a46018f0688c","resolution":{"observed_at":"2026-08-05T05:29:44.130824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.120412Z","title":"A distributed CSMA algorithm for throughput and utility maximization in wireless networks,","venue":null,"work_id":"0fd091d4-06a8-4b46-b6de-b8d52a4e15a0","year":2010},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:39.909751Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:6dbb0caf8e010707fc78f0ccb6857c36f78f29c5a2d0d55ef095ccfc89033dac","observation_id":"ca629437-795e-4ea2-a605-118ca14af357","resolution":{"observed_at":"2026-08-05T05:29:44.123297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.112665Z","title":"Constant-time distributed scheduling policies for ad hoc wireless networks,","venue":null,"work_id":"c66e7385-2f57-4f80-a930-3b3087d3244f","year":2009},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.055500Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:46e016f07d3baf117c0885766514409c04aebbb1cddf6ca864e8d278ac0128af","observation_id":"aa461a19-a9d4-4f67-9a0a-8939cffefe5d","resolution":{"observed_at":"2026-08-05T05:29:44.115479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.103439Z","title":"A simple parallel algorithm for the maximal independent set problem,","venue":null,"work_id":"bf69b997-5afd-4e3f-8a79-b8c75cb7788d","year":1985},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.132419Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:769e9927aa1386a136c964a963074470c1a46e7e3a5c56ba461d66ca77551e91","observation_id":"31515c30-2636-4cbc-8815-7d80590e2fd4","resolution":{"observed_at":"2026-08-05T05:29:44.106915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.094718Z","title":"Blind wireless network topology inference,","venue":null,"work_id":"9dbe3f22-9453-4bc7-9303-7a309611e142","year":2021},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.194290Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:1330140af825332a25d4e407e94ee2f0a22e162c6954cfa4e22b830d1e7384c1","observation_id":"539b2afb-2039-4847-95a9-53fa46c9ada1","resolution":{"observed_at":"2026-08-05T05:29:44.097787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.085866Z","title":"Medium access control with coordinated adaptive sleeping for wireless sensor networks,","venue":null,"work_id":"03552804-3080-41f5-b5d0-c5272edff927","year":2004},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.207299Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:614eada174e8e1e8bcb330f7c82fb4dbf1544f3e2014889fefb9a541ae11ee4a","observation_id":"ae59505b-a42a-436f-adc0-a996fb101890","resolution":{"observed_at":"2026-08-05T05:29:44.089151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.076686Z","title":"Topology control in wireless ad hoc and sensor networks,","venue":null,"work_id":"4f2334ed-32e1-4b2d-8497-7db57d8e8ba2","year":2005},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.285989Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:f06fc3e5e3d19069832e9abbcd3120756da24e90ed600943e295598853722bd6","observation_id":"3cc49f9c-9a0b-46f2-b07e-2c471378ceba","resolution":{"observed_at":"2026-08-05T05:29:44.079820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.066603Z","title":"Antenna beamforming and power control for ad hoc networks,","venue":null,"work_id":"5e8702a6-6a4a-401a-996f-219567117083","year":2004},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.436887Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:bc55d77e58ad7f357c2b77a870f8e375a8165ec2551c8df475ecef8166d0fe14","observation_id":"9bb4df73-dc9c-4f58-9aaf-4df53d71b18e","resolution":{"observed_at":"2026-08-05T05:29:44.069797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.056616Z","title":"A hybrid energy efficient protocol for mobile ad hoc networks,","venue":null,"work_id":"d074b9b4-0a3e-47d0-9dd0-12293b9f3d59","year":2016},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.546407Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:6ffaaf2e37d5c7ef747eda5daa7e7a0a251d9bb0fd171d2fed532448fe1b47eb","observation_id":"250621a0-011d-4880-8964-3db059ce1e4e","resolution":{"observed_at":"2026-08-05T05:29:44.059881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.045872Z","title":"Green wave sleep scheduling: Optimizing latency and throughput in duty cycling wireless networks,","venue":null,"work_id":"d940d3bf-bc02-49f9-8a86-22295ce4d85f","year":2011},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.723764Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:7ef92f73a139bb21b0bacce109292035e43d895734475e9b76d0cc3312b07fbb","observation_id":"f6ebaed5-00f3-4fa8-915d-309a4ab213f8","resolution":{"observed_at":"2026-08-05T05:29:44.049271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.034906Z","title":"Collaborative duty cycling strategies in energy harvesting sensor networks,","venue":null,"work_id":"73303c5e-6e6c-4dff-a329-f67c9665078b","year":2020},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:40.863478Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:d1d11c2041195435da7df24a3cf138175f7932885ebcba559bb0429d04b03c52","observation_id":"ea2b9828-657c-4366-9ea7-18485550a26e","resolution":{"observed_at":"2026-08-05T05:29:44.038336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.024108Z","title":"Low-complexity and distributed energy minimization in multihop wireless networks,","venue":null,"work_id":"52e4f470-7805-4ea7-aace-2eead36a3d30","year":2010},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:41.083513Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:12d473db1624c437c8daa6d7ce98d3553fa86340dc5ac493e7474c66f7e4568e","observation_id":"dd26ebf6-6119-4277-9cd7-fc67ea842727","resolution":{"observed_at":"2026-08-05T05:29:44.027723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.014046Z","title":"Energy-efficient link selection and transmission scheduling in mobile cloud computing,","venue":null,"work_id":"f1a89f45-9ba8-4e22-9313-21860d02549f","year":2014},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:41.207024Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:5f7b82899525017fca057e61957bb067b2268dd33f0b533966ca89a9a4753179","observation_id":"8fb0bb86-b4c3-4e93-923b-b129c075fbc1","resolution":{"observed_at":"2026-08-05T05:29:44.017270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:44.004089Z","title":"Energy-efficient link scheduling in time-variant dual-hop 60GHz wireless networks,","venue":null,"work_id":"bc4c2c2d-a71d-4c56-91e3-8d2dceb19138","year":2020},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:41.359255Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:18bac53e90d466cddaa9c8f926c1cf2d87fb73da2ef58d78af68746a7da32a24","observation_id":"e59eb3bc-1903-4b3b-8a92-2dfdb0555f0c","resolution":{"observed_at":"2026-08-05T05:29:44.007254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.994334Z","title":"Network information flow,","venue":null,"work_id":"1e629e0c-2446-44d2-a6fb-236a274eee4d","year":2000},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:41.518109Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:f8b437e6be6de215ebc350d6db34afe6e6ed1b34b0da96dcfeb315e9b52fc698","observation_id":"898d5961-466e-426c-95c5-5a2f0db13089","resolution":{"observed_at":"2026-08-05T05:29:43.997194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.984646Z","title":"Delay-optimal back- pressure routing algorithm for multihop wireless networks,","venue":null,"work_id":"71da641d-7964-43ec-907a-be88bd9a113e","year":2018},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:41.649661Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:ccd81d71ddadeb6376f253e10bbbd9998bf5340f2863c5363a331a908184c824","observation_id":"7e043d1c-52f2-4e50-ab08-1afb4b1619c1","resolution":{"observed_at":"2026-08-05T05:29:43.987746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.974515Z","title":"Generalization of graph neural networks is robust to model mismatch,","venue":null,"work_id":"2d7f947c-87a7-4c9d-889c-66c59a214ccd","year":2025},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:41.809277Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:2b50f56f6893bc6acdf1667a0ecd49e650b5bc75428917ca75908b597507feb7","observation_id":"d7a8cb05-c995-4ec8-8e43-0af16ce5c2e8","resolution":{"observed_at":"2026-08-05T05:29:43.977816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.964574Z","title":"Learning decentralized wireless resource allocations with graph neural networks,","venue":null,"work_id":"2c0b5aeb-58b1-4c7a-9f47-dd41205c3360","year":2022},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:41.952509Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:fa1e3cc23a5fa437c5f4534c3a783ea486bca0715282ea36fa5f24e2658f74b3","observation_id":"569837e4-0dd9-4c8f-a2b3-290e36048b0a","resolution":{"observed_at":"2026-08-05T05:29:43.967688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.954657Z","title":"A primer on zeroth-order optimization in signal processing and machine learning: Principals, recent advances, and applications,","venue":null,"work_id":"9c7a6c9c-d574-4640-85fd-9d00f6647792","year":2020},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:42.112102Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:51aacc8100e1682298e4271809dde3a606377518a56f60498d06bb73002b0a98","observation_id":"1f236df0-b565-47be-81a5-54a5bdac565f","resolution":{"observed_at":"2026-08-05T05:29:43.957806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.943945Z","title":"A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay,","venue":null,"work_id":"caf8de9e-9f6a-45ad-b80c-daa6a9d86393","year":2012},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:42.260466Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:f3626b69ea9ff614be2651cb81d0f1f1cc0c80c8e2620a3aeea6e7a8dcc40e05","observation_id":"e090bbdf-8750-481d-9b55-634e954ca4c9","resolution":{"observed_at":"2026-08-05T05:29:43.947534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.933343Z","title":"Low-complexity distributed schedul- ing algorithms for wireless networks,","venue":null,"work_id":"8cda3817-1705-43a5-95bf-37e584cc07b3","year":2009},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:42.472452Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:5eeb92a79f450bbcacb979bdbdb3aab1e5fca3c439085fd9ccda3bcbbea6aa08","observation_id":"34767477-91a9-40eb-9d2b-83254d85c517","resolution":{"observed_at":"2026-08-05T05:29:43.936890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.922414Z","title":"Timescale decoupled routing and rate control in intermittently connected networks,","venue":null,"work_id":"19980aad-a33a-4432-9071-1cc8372c5b47","year":2012},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:42.665987Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:1cfdbb248e791314e8f9a6d735020de18181563da620b583ee49966ffc11058e","observation_id":"f6e985fa-c28b-4653-9f5a-9b21bdb9d7d2","resolution":{"observed_at":"2026-08-05T05:29:43.925750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.911937Z","title":"Queueing systems with a removable service station,","venue":null,"work_id":"49e4169f-0a2b-4971-a973-aa8daa4d570f","year":1963},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:42.751379Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:99e9ff0b7560df1c62379099b82896b4e631899032c1b950502c2c429c6fbcfa","observation_id":"3c4017de-3434-42a2-b991-c1d0c71aef3e","resolution":{"observed_at":"2026-08-05T05:29:43.915094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.902091Z","title":"The threshold policy in the M/G/1 queue with server vacations,","venue":null,"work_id":"c96c0a34-23f7-46e9-9553-2a34ec54dde0","year":1989},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:42.897957Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:1477cfdf1d1c2fdd07f928124efa2d138fca4c05214466b8a062799bdd5a154a","observation_id":"aac99cf0-bf1d-4036-8894-b59c4fdbba1a","resolution":{"observed_at":"2026-08-05T05:29:43.905269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.891100Z","title":"The n-policy of a discrete time Geo/G/1 queue with disasters and its application to wireless sensor networks,","venue":null,"work_id":"593b98ea-d47e-4484-aea3-ceb9e8066fd1","year":2013},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.060140Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:2648db538ec127bb2699d76aceaabd4d02e560f34f0bab80352bdbd237e95dbf","observation_id":"7a8c3b75-3a50-4c7c-9e3c-7888274f0624","resolution":{"observed_at":"2026-08-05T05:29:43.895119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.880740Z","title":"Traffic-aware two-stage queueing communication networks: Queue analysis and energy saving,","venue":null,"work_id":"9af0c466-7397-4b5a-8063-e5f665cdb640","year":2020},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.204958Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:932b1db01d7cdc95ce22e7d8015ef97b4e4027fd953933d8647c9de904b3a97a","observation_id":"780117c8-949f-4290-9103-0acf2c4ee4e9","resolution":{"observed_at":"2026-08-05T05:29:43.883940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.319146Z","title":"A comprehensive survey on graph neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.319146Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:e5307c581b1a514731a2c4d3df7f660470d8979ba6a221e5ed4a0166c7d53809","observation_id":"1e01565c-ca70-4199-8bf6-98d3f79428ba","resolution":{"observed_at":"2026-08-05T05:29:43.319146Z","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-05T05:29:43.863090Z","title":"A comprehensive survey of multiagent reinforcement learning,","venue":null,"work_id":"a05d243b-5456-4796-a6be-6137c06dc029","year":2008},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.479488Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:c09031ec1450c3d6feaef1f6d436b7bba86c426b494ee862a7efbd1c64ebd7e7","observation_id":"90f69e02-964f-4b20-ac95-cc1cd5246e0e","resolution":{"observed_at":"2026-08-05T05:29:43.866386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.853071Z","title":"Giselsson and A","venue":null,"work_id":"def4d0ec-d1f4-4084-b358-7f0b982fc32e","year":2018},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.603540Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:4b208e9c55edf300376c2960018cf98773df45590129cf89abae7042a6d8805e","observation_id":"7559c4c2-3198-447a-a824-b791d471f33c","resolution":{"observed_at":"2026-08-05T05:29:43.856088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.842584Z","title":"A reduction of imitation learning and structured prediction to no-regret online learning,","venue":null,"work_id":"46ccb4a4-de12-46ae-b062-13b745b58c54","year":2011},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.719966Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:ea43ead63ef3567521c1ad2bcb51a6c5b3b371b8f8e2dbbba6233c616e991c43","observation_id":"971bc372-fa87-438e-a359-01672444a113","resolution":{"observed_at":"2026-08-05T05:29:43.845935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.724396Z","title":"Q-learning,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.724396Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:6a123f586481d771b66a4b907a959854422581c251a0ad60edb82e67659a2e21","observation_id":"3b5afe39-7b3e-40fa-a93b-695439325992","resolution":{"observed_at":"2026-08-05T05:29:43.724396Z","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-05T05:29:43.824225Z","title":"Mastering the game of go with deep neural networks and tree search,","venue":null,"work_id":"629dc6a1-6066-4cf8-9d05-26a20297f935","year":2016},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.727450Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:9d8156c407e937f38867cd93c1a1fa41420b2cecf98c7534f33f5c988e16c4dc","observation_id":"50a524e9-4d63-4107-9ba8-ad9a8413ccde","resolution":{"observed_at":"2026-08-05T05:29:43.827718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.813636Z","title":"Deterministic policy gradient algorithms,","venue":null,"work_id":"af30ddbf-ae2b-4580-9691-2b702f3557e0","year":2014},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.730329Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:dcf85b4275a2c341bbecad950559b1345a2b542ff5559ad6e04aebdadc127db2","observation_id":"b6d8666b-36c0-4376-9bf3-1dc7f7e536d9","resolution":{"observed_at":"2026-08-05T05:29:43.816724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.803164Z","title":"Distributed graph coloring: Fundamentals and recent developments,","venue":null,"work_id":"6df854da-c91c-490d-b956-157e4bf2da87","year":2013},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.733239Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:e26a8cb5d0620372aeb08daf24fc7ed1b0b54b0a5b93616e2fb4683bee483d20","observation_id":"222dd55a-2b79-40ff-b5ef-0bf891a7b7e5","resolution":{"observed_at":"2026-08-05T05:29:43.806317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.791808Z","title":"LTE physical layer: Performance analysis and evaluation,","venue":null,"work_id":"fe04e717-3cb5-4cb0-943b-daaf303311aa","year":2019},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.735975Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:778bc742268463f8bf40d01e206b9e2b25b377f8b365594b7d8639ae80a13161","observation_id":"89138d8b-1f16-4a78-8a4b-0afdd9b1a3cb","resolution":{"observed_at":"2026-08-05T05:29:43.795930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.781927Z","title":"On random graphs I,","venue":null,"work_id":"9b6c8e13-eff8-4f69-9f7d-a810a30319a9","year":1959},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.738993Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:9e3d753c376a387dba3999557220e92a222c30e1e4c194d707787c66002f20b1","observation_id":"d2a1dfca-0d07-4796-bfee-30364c68781c","resolution":{"observed_at":"2026-08-05T05:29:43.784962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:29:43.769356Z","title":"Barabási and M","venue":null,"work_id":"1795f748-6d81-4020-880f-c55c34ef62dd","year":2016},"citing_paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T05:29:43.741833Z"},"links":{"citing_paper":"/paper/2509.05447"},"observation_digest":"sha256:fa95c756777938261e780fee46dd3e612191f1f26a28d27b4f670bcf231e717e","observation_id":"78bb7d0c-2790-4624-9f8b-e6c5541ba85c","resolution":{"observed_at":"2026-08-05T05:29:43.773791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.05447","last_updated":"2025-09-05T18:59:14Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-05T05:29:36.920025Z","submitted_at":"2025-09-05T18:59:14Z","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":56},"total_outbound_references":59},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2509.05447."}