{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CFHVL2YMJLMTDLVZ5BDBDZ2DLZ","short_pith_number":"pith:CFHVL2YM","canonical_record":{"source":{"id":"1711.00625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-02T06:11:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cf584b7c18964ba81a4b9bb5153abfdd71d0b2918b3832cc1ffe1adb6c8df874","abstract_canon_sha256":"c3ef70ce8b3dd2a72880fe399c8f26926bb53607593fb80a92eb404fc2398d9d"},"schema_version":"1.0"},"canonical_sha256":"114f55eb0c4ad931aeb9e84611e7435e5b93760146356c6980d8b7e9d7fdf977","source":{"kind":"arxiv","id":"1711.00625","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00625","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00625v1","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00625","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"CFHVL2YMJLMT","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CFHVL2YMJLMTDLVZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CFHVL2YM","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CFHVL2YMJLMTDLVZ5BDBDZ2DLZ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-02T06:11:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cf584b7c18964ba81a4b9bb5153abfdd71d0b2918b3832cc1ffe1adb6c8df874","abstract_canon_sha256":"c3ef70ce8b3dd2a72880fe399c8f26926bb53607593fb80a92eb404fc2398d9d"},"schema_version":"1.0"},"canonical_sha256":"114f55eb0c4ad931aeb9e84611e7435e5b93760146356c6980d8b7e9d7fdf977","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:29.979685Z","signature_b64":"oKlhUCoc/GKF2I/bkkcajxu4Gctn8lyDITzFi6uOmjoGgZnBpLdW6A4FzihS2kTS/tHRgEr245J2ztNDhFUMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"114f55eb0c4ad931aeb9e84611e7435e5b93760146356c6980d8b7e9d7fdf977","last_reissued_at":"2026-05-18T00:31:29.979050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:29.979050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00625","source_version":1,"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-05-18T00:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZcO1gQu/k5cQYuUojonEbHa+ntxm1xxynoagx3zv39n0atZTP2lf6qJ5C1msej+sivHbHMsXaRBd8sn89N+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:58:15.488392Z"},"content_sha256":"eb8736d180b2763ff29d4e09518cb1d89cce501a37e94af576c3f913de035b67","schema_version":"1.0","event_id":"sha256:eb8736d180b2763ff29d4e09518cb1d89cce501a37e94af576c3f913de035b67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CFHVL2YMJLMTDLVZ5BDBDZ2DLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Deep Scheduling for Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Gesbert, Maurizio Filippone, Paul de Kerret","submitted_at":"2017-11-02T06:11:26Z","abstract_excerpt":"In this paper, we study the problem of decentralized scheduling in Interference Channels (IC). In this setting, each Transmitter (TX) receives an arbitrary amount of feedback regarding the global multi-user channel state based on which it decides whether to transmit or to stay silent without any form of communication with the other TXs. While many methods have been proposed to tackle the problem of link scheduling in the presence of reliable Channel State Information (CSI), finding the optimally robust transmission strategy in the presence of arbitrary channel uncertainties at each TX has rema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00625","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":""},"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-05-18T00:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQF100HkbWWE1dzIBSjnkyhnJWQNmVvL7aBRkQDCVDfkUMo62SXVtkfnxIwVULrO7hd9KothmbdYCnF8KNN1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:58:15.488739Z"},"content_sha256":"e25bf781f609cecd4b0af18faca400a8907ed7690293c01943bbf83ac4e8b276","schema_version":"1.0","event_id":"sha256:e25bf781f609cecd4b0af18faca400a8907ed7690293c01943bbf83ac4e8b276"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFHVL2YMJLMTDLVZ5BDBDZ2DLZ/bundle.json","state_url":"https://pith.science/pith/CFHVL2YMJLMTDLVZ5BDBDZ2DLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFHVL2YMJLMTDLVZ5BDBDZ2DLZ/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-06-27T18:58:15Z","links":{"resolver":"https://pith.science/pith/CFHVL2YMJLMTDLVZ5BDBDZ2DLZ","bundle":"https://pith.science/pith/CFHVL2YMJLMTDLVZ5BDBDZ2DLZ/bundle.json","state":"https://pith.science/pith/CFHVL2YMJLMTDLVZ5BDBDZ2DLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFHVL2YMJLMTDLVZ5BDBDZ2DLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CFHVL2YMJLMTDLVZ5BDBDZ2DLZ","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":"c3ef70ce8b3dd2a72880fe399c8f26926bb53607593fb80a92eb404fc2398d9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-02T06:11:26Z","title_canon_sha256":"cf584b7c18964ba81a4b9bb5153abfdd71d0b2918b3832cc1ffe1adb6c8df874"},"schema_version":"1.0","source":{"id":"1711.00625","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00625","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00625v1","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00625","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"CFHVL2YMJLMT","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CFHVL2YMJLMTDLVZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CFHVL2YM","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:e25bf781f609cecd4b0af18faca400a8907ed7690293c01943bbf83ac4e8b276","target":"graph","created_at":"2026-05-18T00:31:29Z","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"},"paper":{"abstract_excerpt":"In this paper, we study the problem of decentralized scheduling in Interference Channels (IC). In this setting, each Transmitter (TX) receives an arbitrary amount of feedback regarding the global multi-user channel state based on which it decides whether to transmit or to stay silent without any form of communication with the other TXs. While many methods have been proposed to tackle the problem of link scheduling in the presence of reliable Channel State Information (CSI), finding the optimally robust transmission strategy in the presence of arbitrary channel uncertainties at each TX has rema","authors_text":"David Gesbert, Maurizio Filippone, Paul de Kerret","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-02T06:11:26Z","title":"Decentralized Deep Scheduling for Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00625","kind":"arxiv","version":1},"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:eb8736d180b2763ff29d4e09518cb1d89cce501a37e94af576c3f913de035b67","target":"record","created_at":"2026-05-18T00:31:29Z","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":"c3ef70ce8b3dd2a72880fe399c8f26926bb53607593fb80a92eb404fc2398d9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-02T06:11:26Z","title_canon_sha256":"cf584b7c18964ba81a4b9bb5153abfdd71d0b2918b3832cc1ffe1adb6c8df874"},"schema_version":"1.0","source":{"id":"1711.00625","kind":"arxiv","version":1}},"canonical_sha256":"114f55eb0c4ad931aeb9e84611e7435e5b93760146356c6980d8b7e9d7fdf977","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"114f55eb0c4ad931aeb9e84611e7435e5b93760146356c6980d8b7e9d7fdf977","first_computed_at":"2026-05-18T00:31:29.979050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:29.979050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oKlhUCoc/GKF2I/bkkcajxu4Gctn8lyDITzFi6uOmjoGgZnBpLdW6A4FzihS2kTS/tHRgEr245J2ztNDhFUMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:29.979685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00625","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb8736d180b2763ff29d4e09518cb1d89cce501a37e94af576c3f913de035b67","sha256:e25bf781f609cecd4b0af18faca400a8907ed7690293c01943bbf83ac4e8b276"],"state_sha256":"106f9a2e986e5e1ed5530e8ab19b84190cfb83624d4eeba6feb34708524c8107"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBSpU3gz5Y3roqj6ePEPqjOFFMrZbWqga5+AaGnhGmLxP/jYHiZapMrSNGjbN1BHwJim2r2dq2Fc6UDjeX13DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:58:15.490704Z","bundle_sha256":"ec91f24ee67e14f8f9242f446245c34999251ceb8be6f57b16ecab140cb3fc4d"}}