{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MWRLWO2VAYUDPJWCMBUP6WKCLF","short_pith_number":"pith:MWRLWO2V","schema_version":"1.0","canonical_sha256":"65a2bb3b55062837a6c26068ff5942597b6f2d4af9a81d7dc174344f9865ce1f","source":{"kind":"arxiv","id":"2203.14339","version":1},"attestation_state":"computed","paper":{"title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Ananthram Swami, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2022-03-27T16:02:12Z","abstract_excerpt":"Distributed scheduling algorithms for throughput or utility maximization in dense wireless multi-hop networks can have overwhelmingly high overhead, causing increased congestion, energy consumption, radio footprint, and security vulnerability. For wireless networks with dense connectivity, we propose a distributed scheme for link sparsification with graph convolutional networks (GCNs), which can reduce the scheduling overhead while keeping most of the network capacity. In a nutshell, a trainable GCN module generates node embeddings as topology-aware and reusable parameters for a local decision"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2203.14339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-03-27T16:02:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"276e6dda9b17a09a9674971f1e5c59c6bc9c5a2fb2c8d72f57c5577632054935","abstract_canon_sha256":"9d2402a5fdefb7735d9d4c4796f5b956b54dd002464bfc11fac83287270f019c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:09:03.904805Z","signature_b64":"rNfLzIJw9nvLR96i3d5scpr/Xv4cs4VBNsMdJz0Lh4yUIPoE4DS/PqoTbfxpiHhl6feSPpO2iR1+KXLZOOBPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a2bb3b55062837a6c26068ff5942597b6f2d4af9a81d7dc174344f9865ce1f","last_reissued_at":"2026-07-05T04:09:03.904438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:09:03.904438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Ananthram Swami, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2022-03-27T16:02:12Z","abstract_excerpt":"Distributed scheduling algorithms for throughput or utility maximization in dense wireless multi-hop networks can have overwhelmingly high overhead, causing increased congestion, energy consumption, radio footprint, and security vulnerability. For wireless networks with dense connectivity, we propose a distributed scheme for link sparsification with graph convolutional networks (GCNs), which can reduce the scheduling overhead while keeping most of the network capacity. In a nutshell, a trainable GCN module generates node embeddings as topology-aware and reusable parameters for a local decision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.14339","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.14339/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2203.14339","created_at":"2026-07-05T04:09:03.904501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.14339v1","created_at":"2026-07-05T04:09:03.904501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.14339","created_at":"2026-07-05T04:09:03.904501+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWRLWO2VAYUD","created_at":"2026-07-05T04:09:03.904501+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWRLWO2VAYUDPJWC","created_at":"2026-07-05T04:09:03.904501+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWRLWO2V","created_at":"2026-07-05T04:09:03.904501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF","json":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF.json","graph_json":"https://pith.science/api/pith-number/MWRLWO2VAYUDPJWCMBUP6WKCLF/graph.json","events_json":"https://pith.science/api/pith-number/MWRLWO2VAYUDPJWCMBUP6WKCLF/events.json","paper":"https://pith.science/paper/MWRLWO2V"},"agent_actions":{"view_html":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF","download_json":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF.json","view_paper":"https://pith.science/paper/MWRLWO2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.14339&json=true","fetch_graph":"https://pith.science/api/pith-number/MWRLWO2VAYUDPJWCMBUP6WKCLF/graph.json","fetch_events":"https://pith.science/api/pith-number/MWRLWO2VAYUDPJWCMBUP6WKCLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF/action/storage_attestation","attest_author":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF/action/author_attestation","sign_citation":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF/action/citation_signature","submit_replication":"https://pith.science/pith/MWRLWO2VAYUDPJWCMBUP6WKCLF/action/replication_record"}},"created_at":"2026-07-05T04:09:03.904501+00:00","updated_at":"2026-07-05T04:09:03.904501+00:00"}