{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CEMLSJGYV5HRTOXLMZMHWMFOCW","short_pith_number":"pith:CEMLSJGY","canonical_record":{"source":{"id":"1808.03602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T17:56:11Z","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.CO"],"title_canon_sha256":"00b681e518f1a47230a8bdf14e71160ea42c48c4e3f37072030cb1e3720eca29","abstract_canon_sha256":"5835171fbade3e08215a48a399a24e670d0c2994a19aaafbd8adc8383769f010"},"schema_version":"1.0"},"canonical_sha256":"1118b924d8af4f19baeb66587b30ae15bcd21b93ce293a831d823a6c6e3ad330","source":{"kind":"arxiv","id":"1808.03602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03602","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03602v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03602","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"CEMLSJGYV5HR","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CEMLSJGYV5HRTOXL","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CEMLSJGY","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CEMLSJGYV5HRTOXLMZMHWMFOCW","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T17:56:11Z","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.CO"],"title_canon_sha256":"00b681e518f1a47230a8bdf14e71160ea42c48c4e3f37072030cb1e3720eca29","abstract_canon_sha256":"5835171fbade3e08215a48a399a24e670d0c2994a19aaafbd8adc8383769f010"},"schema_version":"1.0"},"canonical_sha256":"1118b924d8af4f19baeb66587b30ae15bcd21b93ce293a831d823a6c6e3ad330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.579857Z","signature_b64":"Z0WRFaNLXTnDUBnxL8HhouqzbUNCAPtWUPzx47OkJDzijsGxyphpnAnEPfH7X+t5rA/Kvd1GnnXUuVJjGCBYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1118b924d8af4f19baeb66587b30ae15bcd21b93ce293a831d823a6c6e3ad330","last_reissued_at":"2026-05-18T00:08:24.579333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.579333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03602","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:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubkepZwHZctoGspMWzcxzdAoTHCPH7/aasrC/q7xWafRFDPArARrYDI9t0L/p+Z65JV+xQs7Qh44T2d3TFClDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:05:01.581918Z"},"content_sha256":"7094b0582a569cc32a0c4b4161aa5960c0c882c6eaeed4a1c51b54b9c1ddfee6","schema_version":"1.0","event_id":"sha256:7094b0582a569cc32a0c4b4161aa5960c0c882c6eaeed4a1c51b54b9c1ddfee6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CEMLSJGYV5HRTOXLMZMHWMFOCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal starvation in multi-channel CSMA networks: an analytical framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.NI","math.CO"],"primary_cat":"math.PR","authors_text":"Alessandro Zocca","submitted_at":"2018-08-09T17:56:11Z","abstract_excerpt":"In this paper we consider a stochastic model for a frequency-agile CSMA protocol for wireless networks where multiple orthogonal frequency channels are available. Even when the possible interference on the different channels is described by different conflict graphs, we show that the network dynamics can be equivalently described as that of a single-channel CSMA algorithm on an appropriate virtual network. Our focus is on the asymptotic regime in which the network nodes try to activate aggressively in order to achieve maximum throughput. Of particular interest is the scenario where the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03602","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:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4fVORwElk6YzWMWZwtgzfwd0h/epXDsFua9E+ZGaj4l5OmFMfAPYfz2c4644FuD2BO0KhrYCffrBZJcPhPEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:05:01.582269Z"},"content_sha256":"5f5b604be8a47ce204c46ec45b3c394858bb41c4b3f4cdbf14901c3f58610a13","schema_version":"1.0","event_id":"sha256:5f5b604be8a47ce204c46ec45b3c394858bb41c4b3f4cdbf14901c3f58610a13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEMLSJGYV5HRTOXLMZMHWMFOCW/bundle.json","state_url":"https://pith.science/pith/CEMLSJGYV5HRTOXLMZMHWMFOCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEMLSJGYV5HRTOXLMZMHWMFOCW/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-21T22:05:01Z","links":{"resolver":"https://pith.science/pith/CEMLSJGYV5HRTOXLMZMHWMFOCW","bundle":"https://pith.science/pith/CEMLSJGYV5HRTOXLMZMHWMFOCW/bundle.json","state":"https://pith.science/pith/CEMLSJGYV5HRTOXLMZMHWMFOCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEMLSJGYV5HRTOXLMZMHWMFOCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CEMLSJGYV5HRTOXLMZMHWMFOCW","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":"5835171fbade3e08215a48a399a24e670d0c2994a19aaafbd8adc8383769f010","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T17:56:11Z","title_canon_sha256":"00b681e518f1a47230a8bdf14e71160ea42c48c4e3f37072030cb1e3720eca29"},"schema_version":"1.0","source":{"id":"1808.03602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03602","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03602v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03602","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"CEMLSJGYV5HR","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CEMLSJGYV5HRTOXL","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CEMLSJGY","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:5f5b604be8a47ce204c46ec45b3c394858bb41c4b3f4cdbf14901c3f58610a13","target":"graph","created_at":"2026-05-18T00:08:24Z","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 consider a stochastic model for a frequency-agile CSMA protocol for wireless networks where multiple orthogonal frequency channels are available. Even when the possible interference on the different channels is described by different conflict graphs, we show that the network dynamics can be equivalently described as that of a single-channel CSMA algorithm on an appropriate virtual network. Our focus is on the asymptotic regime in which the network nodes try to activate aggressively in order to achieve maximum throughput. Of particular interest is the scenario where the number ","authors_text":"Alessandro Zocca","cross_cats":["cond-mat.stat-mech","cs.NI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T17:56:11Z","title":"Temporal starvation in multi-channel CSMA networks: an analytical framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03602","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:7094b0582a569cc32a0c4b4161aa5960c0c882c6eaeed4a1c51b54b9c1ddfee6","target":"record","created_at":"2026-05-18T00:08:24Z","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":"5835171fbade3e08215a48a399a24e670d0c2994a19aaafbd8adc8383769f010","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T17:56:11Z","title_canon_sha256":"00b681e518f1a47230a8bdf14e71160ea42c48c4e3f37072030cb1e3720eca29"},"schema_version":"1.0","source":{"id":"1808.03602","kind":"arxiv","version":1}},"canonical_sha256":"1118b924d8af4f19baeb66587b30ae15bcd21b93ce293a831d823a6c6e3ad330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1118b924d8af4f19baeb66587b30ae15bcd21b93ce293a831d823a6c6e3ad330","first_computed_at":"2026-05-18T00:08:24.579333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:24.579333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z0WRFaNLXTnDUBnxL8HhouqzbUNCAPtWUPzx47OkJDzijsGxyphpnAnEPfH7X+t5rA/Kvd1GnnXUuVJjGCBYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:24.579857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7094b0582a569cc32a0c4b4161aa5960c0c882c6eaeed4a1c51b54b9c1ddfee6","sha256:5f5b604be8a47ce204c46ec45b3c394858bb41c4b3f4cdbf14901c3f58610a13"],"state_sha256":"2713e471cfab3d800bdf76ce63df6457d615e2ebb8606eccb4ca249f93b5a474"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEcAV70vldNhi1Xl2uj90+o3FrEywETYRCLsgnInsM+OFRggvye6hNwfpEB4n1CNA27FzZcfjl+Sq6QQ/xq0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:05:01.584255Z","bundle_sha256":"fc18ed51066c50a6b417b31b828ec4ca7bded8ef33b3f8aa04ccd116b78d4d71"}}