{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FO33JIL4O3UW4NVSXD6DQHPMXM","short_pith_number":"pith:FO33JIL4","canonical_record":{"source":{"id":"1604.00178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"82470f16b8e3eda0094a671452e73aa2156ddc4d63d9cac7ee876e6ea1a95b2c","abstract_canon_sha256":"fbe03228d7477d3190848b9170905545618f907c22f20eff49c41fc7773132fb"},"schema_version":"1.0"},"canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","source":{"kind":"arxiv","id":"1604.00178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00178","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00178v1","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00178","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"FO33JIL4O3UW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FO33JIL4O3UW4NVS","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FO33JIL4","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FO33JIL4O3UW4NVSXD6DQHPMXM","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"82470f16b8e3eda0094a671452e73aa2156ddc4d63d9cac7ee876e6ea1a95b2c","abstract_canon_sha256":"fbe03228d7477d3190848b9170905545618f907c22f20eff49c41fc7773132fb"},"schema_version":"1.0"},"canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:54.379584Z","signature_b64":"1ZwtfaRv1EQadY4rbXuD2TEw7/eR/pazJZCWMguMiluS7y1NWjbQwIWJsA2Xa41L/hbfGPJSVY1m/Hs5eU2OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","last_reissued_at":"2026-05-18T01:17:54.378966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:54.378966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00178","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-18T01:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiQ3zk5rX0DKQymdLgFOHZq4D1pyVYdGlsyf+WMSi/MHhoPJe/9FAW4TwvUeNG8rYhSmP7UGDYzJph4HliDODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:15:06.290446Z"},"content_sha256":"199cf45522cd9ce27ff0722377aa5840f95e9bd01d19e62978d8454cd5d529b4","schema_version":"1.0","event_id":"sha256:199cf45522cd9ce27ff0722377aa5840f95e9bd01d19e62978d8454cd5d529b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FO33JIL4O3UW4NVSXD6DQHPMXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approaching Optimal Centralized Scheduling with CSMA-based Random Access over Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Bjorn Landfeldt, Mehmet Karaca","submitted_at":"2016-04-01T09:45:11Z","abstract_excerpt":"Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput-optimality, these algorithms can either incur large delay and have large complexity or only operate over non-fading channels. In this letter, by assuming arbitrary back-off time we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely-conne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00178","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-18T01:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lAZ0jSmiAjyUduQfHlp32jo41VZYcinYNpzjpzMTTZdxiyf87pHczwFfqqwus+85QyIB50iJeMR95M4AS4fAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:15:06.290792Z"},"content_sha256":"005a8bbe763433b573e790b758ccad9678556dead70831f6eac3f5f2aeedd532","schema_version":"1.0","event_id":"sha256:005a8bbe763433b573e790b758ccad9678556dead70831f6eac3f5f2aeedd532"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/bundle.json","state_url":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/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-27T08:15:06Z","links":{"resolver":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM","bundle":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/bundle.json","state":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FO33JIL4O3UW4NVSXD6DQHPMXM","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":"fbe03228d7477d3190848b9170905545618f907c22f20eff49c41fc7773132fb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","title_canon_sha256":"82470f16b8e3eda0094a671452e73aa2156ddc4d63d9cac7ee876e6ea1a95b2c"},"schema_version":"1.0","source":{"id":"1604.00178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00178","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00178v1","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00178","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"FO33JIL4O3UW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FO33JIL4O3UW4NVS","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FO33JIL4","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:005a8bbe763433b573e790b758ccad9678556dead70831f6eac3f5f2aeedd532","target":"graph","created_at":"2026-05-18T01:17:54Z","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":"Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput-optimality, these algorithms can either incur large delay and have large complexity or only operate over non-fading channels. In this letter, by assuming arbitrary back-off time we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely-conne","authors_text":"Bjorn Landfeldt, Mehmet Karaca","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","title":"Approaching Optimal Centralized Scheduling with CSMA-based Random Access over Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00178","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:199cf45522cd9ce27ff0722377aa5840f95e9bd01d19e62978d8454cd5d529b4","target":"record","created_at":"2026-05-18T01:17:54Z","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":"fbe03228d7477d3190848b9170905545618f907c22f20eff49c41fc7773132fb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","title_canon_sha256":"82470f16b8e3eda0094a671452e73aa2156ddc4d63d9cac7ee876e6ea1a95b2c"},"schema_version":"1.0","source":{"id":"1604.00178","kind":"arxiv","version":1}},"canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","first_computed_at":"2026-05-18T01:17:54.378966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:54.378966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ZwtfaRv1EQadY4rbXuD2TEw7/eR/pazJZCWMguMiluS7y1NWjbQwIWJsA2Xa41L/hbfGPJSVY1m/Hs5eU2OCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:54.379584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:199cf45522cd9ce27ff0722377aa5840f95e9bd01d19e62978d8454cd5d529b4","sha256:005a8bbe763433b573e790b758ccad9678556dead70831f6eac3f5f2aeedd532"],"state_sha256":"09e10545d435f1a54637ceda624f577a5fa3e9ef4845f5296774511907bf8537"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVfBI0yQ3i3FeWcT4zflq8rI5kUeZBcl+b6p50IFEm1LGvVpbSFOyx06oQjj4/1Hx/m7HkWbYBYH45qyrG97AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:15:06.292707Z","bundle_sha256":"dd1493d960a5d9f5dced9bca223512de00889b55ede465b35cd8ee7a8c840bbf"}}