{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:COWHAIEVQ4YCR2KW5XOZARXMQM","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":"9307ead3e78fa92efc94076f3bb80568595c7f70f93055e12de4de7fdc89880a","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-04T14:03:10Z","title_canon_sha256":"158c5c898b236ec5f96c3ccbf4e0dc65449b0346a88630303a78c89c18e37bdd"},"schema_version":"1.0","source":{"id":"1808.01486","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01486","created_at":"2026-07-05T02:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01486v3","created_at":"2026-07-05T02:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01486","created_at":"2026-07-05T02:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"COWHAIEVQ4YC","created_at":"2026-07-05T02:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"COWHAIEVQ4YCR2KW","created_at":"2026-07-05T02:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"COWHAIEV","created_at":"2026-07-05T02:12:38Z"}],"graph_snapshots":[{"event_id":"sha256:9cceccb80ca358137ea1dbc3e4ff80b099b998946d5ddb80b40f023f6dd3ceba","target":"graph","created_at":"2026-07-05T02:12:38Z","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/1808.01486/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The optimal scheduling of interfering links in a dense wireless network with full frequency reuse is a challenging task. The traditional method involves first estimating all the interfering channel strengths then optimizing the scheduling based on the model. This model-based method is however resource intensive and computationally hard because channel estimation is expensive in dense networks; furthermore, finding even a locally optimal solution of the resulting optimization problem may be computationally complex. This paper shows that by using a deep learning approach, it is possible to bypas","authors_text":"Kaiming Shen, Wei Cui, Wei Yu","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-04T14:03:10Z","title":"Spatial Deep Learning for Wireless Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01486","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:9a8c0b9735b6f1cedc16afd6f57c4c8caa54cbc72790c0364d256f03cbe841dc","target":"record","created_at":"2026-07-05T02:12:38Z","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":"9307ead3e78fa92efc94076f3bb80568595c7f70f93055e12de4de7fdc89880a","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-04T14:03:10Z","title_canon_sha256":"158c5c898b236ec5f96c3ccbf4e0dc65449b0346a88630303a78c89c18e37bdd"},"schema_version":"1.0","source":{"id":"1808.01486","kind":"arxiv","version":3}},"canonical_sha256":"13ac702095873028e956eddd9046ec831cbf4eff22a9c61fd5eec97378733d41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13ac702095873028e956eddd9046ec831cbf4eff22a9c61fd5eec97378733d41","first_computed_at":"2026-07-05T02:12:38.741914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:12:38.741914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSDVmUwXjALWNTLCEiN95+8gJQ6TB37QSCeMKCf0YM/zDpSeDUf56bc3Deo7I4hzf8cbh1ztrqbuVs7hxpYCAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:12:38.742327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01486","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a8c0b9735b6f1cedc16afd6f57c4c8caa54cbc72790c0364d256f03cbe841dc","sha256:9cceccb80ca358137ea1dbc3e4ff80b099b998946d5ddb80b40f023f6dd3ceba"],"state_sha256":"a199fb900046318b1ba9a923c3b5f235d071dec755684be118a6f78b34007463"}