{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:KFKFLNV7TBAT4ZKXQ7FJBWPBD2","short_pith_number":"pith:KFKFLNV7","canonical_record":{"source":{"id":"2109.05536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-09-12T15:19:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b524b5d05fa1586d1ceb9f0da533134103382f727e0cb0c1ee55f25cadf3cfb2","abstract_canon_sha256":"128f501939024da750b6af5dd6ec6eba880edcb970494f555572df3a660693cc"},"schema_version":"1.0"},"canonical_sha256":"515455b6bf98413e655787ca90d9e11e8cfb70e24c79f05ea4cc5ed13e91b74c","source":{"kind":"arxiv","id":"2109.05536","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.05536","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"arxiv_version","alias_value":"2109.05536v3","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.05536","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"pith_short_12","alias_value":"KFKFLNV7TBAT","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"pith_short_16","alias_value":"KFKFLNV7TBAT4ZKX","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"pith_short_8","alias_value":"KFKFLNV7","created_at":"2026-07-05T06:57:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:KFKFLNV7TBAT4ZKXQ7FJBWPBD2","target":"record","payload":{"canonical_record":{"source":{"id":"2109.05536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-09-12T15:19:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b524b5d05fa1586d1ceb9f0da533134103382f727e0cb0c1ee55f25cadf3cfb2","abstract_canon_sha256":"128f501939024da750b6af5dd6ec6eba880edcb970494f555572df3a660693cc"},"schema_version":"1.0"},"canonical_sha256":"515455b6bf98413e655787ca90d9e11e8cfb70e24c79f05ea4cc5ed13e91b74c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:57:48.918633Z","signature_b64":"g1QtH2UmKkG4aSLwkNl3QngpU9dVxt1JH/BeuIMD6t5hvosYD3/NVovqyT32fGGu5byw6aJT0xE/weuVCGqqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"515455b6bf98413e655787ca90d9e11e8cfb70e24c79f05ea4cc5ed13e91b74c","last_reissued_at":"2026-07-05T06:57:48.918114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:57:48.918114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.05536","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:57:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLBGArxwiiW9abMzrXbWNqxobuyUhaUetrvWjDa+wdr+qqFdD2rgXvzGJQHjosUJMChCBoKTGdiGzDuoivhZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T12:57:15.271516Z"},"content_sha256":"4dd19173863b4608984e38cf63c8d4b3b69494fac135555813b2df5e10a4a0bd","schema_version":"1.0","event_id":"sha256:4dd19173863b4608984e38cf63c8d4b3b69494fac135555813b2df5e10a4a0bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:KFKFLNV7TBAT4ZKXQ7FJBWPBD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Link 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, Chirag Rao, Gunjan Verma, Santiago Segarra, Zhongyuan Zhao","submitted_at":"2021-09-12T15:19:59Z","abstract_excerpt":"Efficient scheduling of transmissions is a key problem in wireless networks. The main challenge stems from the fact that optimal link scheduling involves solving a maximum weighted independent set (MWIS) problem, which is known to be NP-hard. In practical schedulers, centralized and distributed greedy heuristics are commonly used to approximately solve the MWIS problem. However, most of these greedy heuristics ignore important topological information of the wireless network. To overcome this limitation, we propose fast heuristics based on graph convolutional networks (GCNs) that can be impleme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.05536","kind":"arxiv","version":3},"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/2109.05536/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:57:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Igk4B/flimjNGubHkwKIFMgPnpQbma+HPPD15Z5Z7Wbz20tL7Gp+aoFVGQ3H1tUYvHmmC/AnEUdXVWzFFlGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T12:57:15.272060Z"},"content_sha256":"1dec5fb01a6bb4ed3829908899d382cf987481de14cb4d85c5eaf29352ebd6bb","schema_version":"1.0","event_id":"sha256:1dec5fb01a6bb4ed3829908899d382cf987481de14cb4d85c5eaf29352ebd6bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFKFLNV7TBAT4ZKXQ7FJBWPBD2/bundle.json","state_url":"https://pith.science/pith/KFKFLNV7TBAT4ZKXQ7FJBWPBD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFKFLNV7TBAT4ZKXQ7FJBWPBD2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T12:57:15Z","links":{"resolver":"https://pith.science/pith/KFKFLNV7TBAT4ZKXQ7FJBWPBD2","bundle":"https://pith.science/pith/KFKFLNV7TBAT4ZKXQ7FJBWPBD2/bundle.json","state":"https://pith.science/pith/KFKFLNV7TBAT4ZKXQ7FJBWPBD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFKFLNV7TBAT4ZKXQ7FJBWPBD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KFKFLNV7TBAT4ZKXQ7FJBWPBD2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"128f501939024da750b6af5dd6ec6eba880edcb970494f555572df3a660693cc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-09-12T15:19:59Z","title_canon_sha256":"b524b5d05fa1586d1ceb9f0da533134103382f727e0cb0c1ee55f25cadf3cfb2"},"schema_version":"1.0","source":{"id":"2109.05536","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.05536","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"arxiv_version","alias_value":"2109.05536v3","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.05536","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"pith_short_12","alias_value":"KFKFLNV7TBAT","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"pith_short_16","alias_value":"KFKFLNV7TBAT4ZKX","created_at":"2026-07-05T06:57:48Z"},{"alias_kind":"pith_short_8","alias_value":"KFKFLNV7","created_at":"2026-07-05T06:57:48Z"}],"graph_snapshots":[{"event_id":"sha256:1dec5fb01a6bb4ed3829908899d382cf987481de14cb4d85c5eaf29352ebd6bb","target":"graph","created_at":"2026-07-05T06:57:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.05536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient scheduling of transmissions is a key problem in wireless networks. The main challenge stems from the fact that optimal link scheduling involves solving a maximum weighted independent set (MWIS) problem, which is known to be NP-hard. In practical schedulers, centralized and distributed greedy heuristics are commonly used to approximately solve the MWIS problem. However, most of these greedy heuristics ignore important topological information of the wireless network. To overcome this limitation, we propose fast heuristics based on graph convolutional networks (GCNs) that can be impleme","authors_text":"Ananthram Swami, Chirag Rao, Gunjan Verma, Santiago Segarra, Zhongyuan Zhao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-09-12T15:19:59Z","title":"Link Scheduling using Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.05536","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4dd19173863b4608984e38cf63c8d4b3b69494fac135555813b2df5e10a4a0bd","target":"record","created_at":"2026-07-05T06:57:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"128f501939024da750b6af5dd6ec6eba880edcb970494f555572df3a660693cc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-09-12T15:19:59Z","title_canon_sha256":"b524b5d05fa1586d1ceb9f0da533134103382f727e0cb0c1ee55f25cadf3cfb2"},"schema_version":"1.0","source":{"id":"2109.05536","kind":"arxiv","version":3}},"canonical_sha256":"515455b6bf98413e655787ca90d9e11e8cfb70e24c79f05ea4cc5ed13e91b74c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"515455b6bf98413e655787ca90d9e11e8cfb70e24c79f05ea4cc5ed13e91b74c","first_computed_at":"2026-07-05T06:57:48.918114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:57:48.918114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1QtH2UmKkG4aSLwkNl3QngpU9dVxt1JH/BeuIMD6t5hvosYD3/NVovqyT32fGGu5byw6aJT0xE/weuVCGqqDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:57:48.918633Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.05536","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dd19173863b4608984e38cf63c8d4b3b69494fac135555813b2df5e10a4a0bd","sha256:1dec5fb01a6bb4ed3829908899d382cf987481de14cb4d85c5eaf29352ebd6bb"],"state_sha256":"4825a49b80fb5f54d4edaca1730cba8d9b398b6f7face9cc8a192e9dfc80c2a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afkSG+m/fvzYR+lUGj1HWT3T2z3bZMsQQrDq5zgrZ+yQhjp5NLPTLnEJgsGpnV2UAvj5N7CqZErXknbxEeFdBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T12:57:15.277253Z","bundle_sha256":"37924c78559fec6b67135091382fd075dbd8258d8ca55a37f296e5b49d1ed428"}}