{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ICRNCINCTE44IVY56CSYAXHJ5S","short_pith_number":"pith:ICRNCINC","canonical_record":{"source":{"id":"1404.6931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-28T11:09:40Z","cross_cats_sorted":[],"title_canon_sha256":"d9ad49c68b404d1413dc690afa2af410a83b63d04fc8f1683e94dea4a141621f","abstract_canon_sha256":"32e351e2238c40142d067b90738976d80e141e30ce86d1dbd6f91d8dd99bcfb4"},"schema_version":"1.0"},"canonical_sha256":"40a2d121a29939c4571df0a5805ce9ec885dc61acb0c6affb0b21229bda2b83d","source":{"kind":"arxiv","id":"1404.6931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6931","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6931v1","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6931","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"ICRNCINCTE44","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ICRNCINCTE44IVY5","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ICRNCINC","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ICRNCINCTE44IVY56CSYAXHJ5S","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-28T11:09:40Z","cross_cats_sorted":[],"title_canon_sha256":"d9ad49c68b404d1413dc690afa2af410a83b63d04fc8f1683e94dea4a141621f","abstract_canon_sha256":"32e351e2238c40142d067b90738976d80e141e30ce86d1dbd6f91d8dd99bcfb4"},"schema_version":"1.0"},"canonical_sha256":"40a2d121a29939c4571df0a5805ce9ec885dc61acb0c6affb0b21229bda2b83d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:05.519482Z","signature_b64":"TarNONSdNs6Rp7ni5naR1EuiwPbxSGhNmcEz7GtkFBeSa6cSJj8qkawySijd+bClLeDQe619DYM5XapWPl/uDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40a2d121a29939c4571df0a5805ce9ec885dc61acb0c6affb0b21229bda2b83d","last_reissued_at":"2026-05-18T02:53:05.519063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:05.519063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6931","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-18T02:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q9ZV82T+nOEC/xPK50HnyIVJWqQB0o/F1rKFBp1TCrYMOPltqM1awig5ytkpfSEcUi1payLmlsE99QZnhgwKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:39.544584Z"},"content_sha256":"7c38c864e32b8112f01e53985cfaec06cda55f37fc015adb07bbfd43b6a42fb2","schema_version":"1.0","event_id":"sha256:7c38c864e32b8112f01e53985cfaec06cda55f37fc015adb07bbfd43b6a42fb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ICRNCINCTE44IVY56CSYAXHJ5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"To Achieve Maximal Throughputs in CSMA Wireless Networks Through Offered_load Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Caihong Kai, Lusheng Wang, Qi Zhang","submitted_at":"2014-04-28T11:09:40Z","abstract_excerpt":"This paper studies how to achieve the maximal link throughputs in a CSMA wireless network through offered-load control. First, we propose an analytical model, contention-graph-combination (CGC), to describe the relationship between the offered-load and the output link throughputs of an unsaturated CSMA network. Based on CGC, we then formulate a linear optimization model to improve the aggregate link throughput through properly setting the occurrence probabilities of each sub-network, based on which we can obtain the optimal offered-load of each link. Simulation results bore out the accuracy of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6931","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-18T02:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IF0ZN9he5DALivb2WAOQXF43wdCBccpokIUfjFpk/sZ4oQQPPZOlLonRVt+5EjnkPF1KzjfVj0LaMGTTnucuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:39.545277Z"},"content_sha256":"846c5bc2945fe97af7a71e08c9641a2b4b914c6864e2735f90430405d7ae4f76","schema_version":"1.0","event_id":"sha256:846c5bc2945fe97af7a71e08c9641a2b4b914c6864e2735f90430405d7ae4f76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICRNCINCTE44IVY56CSYAXHJ5S/bundle.json","state_url":"https://pith.science/pith/ICRNCINCTE44IVY56CSYAXHJ5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICRNCINCTE44IVY56CSYAXHJ5S/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-05-30T12:05:39Z","links":{"resolver":"https://pith.science/pith/ICRNCINCTE44IVY56CSYAXHJ5S","bundle":"https://pith.science/pith/ICRNCINCTE44IVY56CSYAXHJ5S/bundle.json","state":"https://pith.science/pith/ICRNCINCTE44IVY56CSYAXHJ5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICRNCINCTE44IVY56CSYAXHJ5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ICRNCINCTE44IVY56CSYAXHJ5S","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":"32e351e2238c40142d067b90738976d80e141e30ce86d1dbd6f91d8dd99bcfb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-28T11:09:40Z","title_canon_sha256":"d9ad49c68b404d1413dc690afa2af410a83b63d04fc8f1683e94dea4a141621f"},"schema_version":"1.0","source":{"id":"1404.6931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6931","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6931v1","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6931","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"ICRNCINCTE44","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ICRNCINCTE44IVY5","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ICRNCINC","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:846c5bc2945fe97af7a71e08c9641a2b4b914c6864e2735f90430405d7ae4f76","target":"graph","created_at":"2026-05-18T02:53:05Z","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":"This paper studies how to achieve the maximal link throughputs in a CSMA wireless network through offered-load control. First, we propose an analytical model, contention-graph-combination (CGC), to describe the relationship between the offered-load and the output link throughputs of an unsaturated CSMA network. Based on CGC, we then formulate a linear optimization model to improve the aggregate link throughput through properly setting the occurrence probabilities of each sub-network, based on which we can obtain the optimal offered-load of each link. Simulation results bore out the accuracy of","authors_text":"Caihong Kai, Lusheng Wang, Qi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-28T11:09:40Z","title":"To Achieve Maximal Throughputs in CSMA Wireless Networks Through Offered_load Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6931","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:7c38c864e32b8112f01e53985cfaec06cda55f37fc015adb07bbfd43b6a42fb2","target":"record","created_at":"2026-05-18T02:53:05Z","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":"32e351e2238c40142d067b90738976d80e141e30ce86d1dbd6f91d8dd99bcfb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-28T11:09:40Z","title_canon_sha256":"d9ad49c68b404d1413dc690afa2af410a83b63d04fc8f1683e94dea4a141621f"},"schema_version":"1.0","source":{"id":"1404.6931","kind":"arxiv","version":1}},"canonical_sha256":"40a2d121a29939c4571df0a5805ce9ec885dc61acb0c6affb0b21229bda2b83d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40a2d121a29939c4571df0a5805ce9ec885dc61acb0c6affb0b21229bda2b83d","first_computed_at":"2026-05-18T02:53:05.519063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:05.519063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TarNONSdNs6Rp7ni5naR1EuiwPbxSGhNmcEz7GtkFBeSa6cSJj8qkawySijd+bClLeDQe619DYM5XapWPl/uDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:05.519482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c38c864e32b8112f01e53985cfaec06cda55f37fc015adb07bbfd43b6a42fb2","sha256:846c5bc2945fe97af7a71e08c9641a2b4b914c6864e2735f90430405d7ae4f76"],"state_sha256":"66381d9e0037587dadb27bf61960915eefeb8d6733249bc2fdf1e4d4429aec57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WRfgPTjffBpHnEkHT5U83bY3Mj/iDrt9ZmHOcBXJDLF9lSoXxSjt2XE8VABeAHT7T3KTiS9sqN3hBhtvU2ghDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:39.548977Z","bundle_sha256":"ac3a4b55b5fa1b5f6f1f789f0ecac293f887bbf1461c4a5bf610a923c721dc2a"}}