{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ROQHA6V7A5CESTRXWJXEKMU7CT","short_pith_number":"pith:ROQHA6V7","canonical_record":{"source":{"id":"1601.06065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T16:38:21Z","cross_cats_sorted":["cs.NI","math.IT","math.PR","stat.AP"],"title_canon_sha256":"601f21c79fb4d0edff357338f216309b26491568d172bdc987940d88ba316795","abstract_canon_sha256":"b6b1e3065f37083daa7381222a7f9312dad11b1751bdf6fd62e80328adf91ab3"},"schema_version":"1.0"},"canonical_sha256":"8ba0707abf0744494e37b26e45329f14ced24a03e7ec7fdafc2e7a352fadcb8c","source":{"kind":"arxiv","id":"1601.06065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06065","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06065v2","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06065","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"ROQHA6V7A5CE","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROQHA6V7A5CESTRX","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROQHA6V7","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ROQHA6V7A5CESTRXWJXEKMU7CT","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T16:38:21Z","cross_cats_sorted":["cs.NI","math.IT","math.PR","stat.AP"],"title_canon_sha256":"601f21c79fb4d0edff357338f216309b26491568d172bdc987940d88ba316795","abstract_canon_sha256":"b6b1e3065f37083daa7381222a7f9312dad11b1751bdf6fd62e80328adf91ab3"},"schema_version":"1.0"},"canonical_sha256":"8ba0707abf0744494e37b26e45329f14ced24a03e7ec7fdafc2e7a352fadcb8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:09.803644Z","signature_b64":"yERPDrHODcqI17otquIR9vf2xKqJXmAZzQx35CBLxKhJ3tAU0SGDPnsvystanw4wFu2xrn0UwFORrGQH1j1dBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ba0707abf0744494e37b26e45329f14ced24a03e7ec7fdafc2e7a352fadcb8c","last_reissued_at":"2026-05-18T00:50:09.803101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:09.803101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06065","source_version":2,"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:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnuP5le2T9TiUEVT6qGQ3n2KwjRPLvVcS+u3qFioc9TH6IN4UjjKvhX4j26HMIN8ANESzT8hmhDakIMf7YrvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T16:10:38.176677Z"},"content_sha256":"b7fed1792676d6744e31c96a0a3587187d57496583b1fe1aa38a1f9ca12f7e83","schema_version":"1.0","event_id":"sha256:b7fed1792676d6744e31c96a0a3587187d57496583b1fe1aa38a1f9ca12f7e83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ROQHA6V7A5CESTRXWJXEKMU7CT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive CSMA under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","math.PR","stat.AP"],"primary_cat":"cs.IT","authors_text":"Krishna Jagannathan, Peruru Subrahmanya Swamy, Radha Krishna Ganti","submitted_at":"2016-01-22T16:38:21Z","abstract_excerpt":"We consider a Carrier Sense Multiple Access (CSMA) based scheduling algorithm for a single-hop wireless network under a realistic Signal-to-interference-plus-noise ratio (SINR) model for the interference. We propose two local optimization based approximation algorithms to efficiently estimate certain attempt rate parameters of CSMA called fugacities. It is known that adaptive CSMA can achieve throughput optimality by sampling feasible schedules from a Gibbs distribution, with appropriate fugacities. Unfortunately, obtaining these optimal fugacities is an NP-hard problem. Further, the existing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06065","kind":"arxiv","version":2},"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:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KF6LSttEoVT/Y8Pqm9aNhm+4dV9ainYWCeDtqbUQSRlYO7LTyHYX3blrVDBCOual9Qhmci4mZ0ZjFyAgvTjEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T16:10:38.177030Z"},"content_sha256":"fba92fef7a130f55428895cd2001aee881395b9ff4a91f01ecc5de956e18e95b","schema_version":"1.0","event_id":"sha256:fba92fef7a130f55428895cd2001aee881395b9ff4a91f01ecc5de956e18e95b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROQHA6V7A5CESTRXWJXEKMU7CT/bundle.json","state_url":"https://pith.science/pith/ROQHA6V7A5CESTRXWJXEKMU7CT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROQHA6V7A5CESTRXWJXEKMU7CT/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-25T16:10:38Z","links":{"resolver":"https://pith.science/pith/ROQHA6V7A5CESTRXWJXEKMU7CT","bundle":"https://pith.science/pith/ROQHA6V7A5CESTRXWJXEKMU7CT/bundle.json","state":"https://pith.science/pith/ROQHA6V7A5CESTRXWJXEKMU7CT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROQHA6V7A5CESTRXWJXEKMU7CT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ROQHA6V7A5CESTRXWJXEKMU7CT","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":"b6b1e3065f37083daa7381222a7f9312dad11b1751bdf6fd62e80328adf91ab3","cross_cats_sorted":["cs.NI","math.IT","math.PR","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T16:38:21Z","title_canon_sha256":"601f21c79fb4d0edff357338f216309b26491568d172bdc987940d88ba316795"},"schema_version":"1.0","source":{"id":"1601.06065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06065","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06065v2","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06065","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"ROQHA6V7A5CE","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROQHA6V7A5CESTRX","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROQHA6V7","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:fba92fef7a130f55428895cd2001aee881395b9ff4a91f01ecc5de956e18e95b","target":"graph","created_at":"2026-05-18T00:50:09Z","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":"We consider a Carrier Sense Multiple Access (CSMA) based scheduling algorithm for a single-hop wireless network under a realistic Signal-to-interference-plus-noise ratio (SINR) model for the interference. We propose two local optimization based approximation algorithms to efficiently estimate certain attempt rate parameters of CSMA called fugacities. It is known that adaptive CSMA can achieve throughput optimality by sampling feasible schedules from a Gibbs distribution, with appropriate fugacities. Unfortunately, obtaining these optimal fugacities is an NP-hard problem. Further, the existing ","authors_text":"Krishna Jagannathan, Peruru Subrahmanya Swamy, Radha Krishna Ganti","cross_cats":["cs.NI","math.IT","math.PR","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T16:38:21Z","title":"Adaptive CSMA under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06065","kind":"arxiv","version":2},"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:b7fed1792676d6744e31c96a0a3587187d57496583b1fe1aa38a1f9ca12f7e83","target":"record","created_at":"2026-05-18T00:50:09Z","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":"b6b1e3065f37083daa7381222a7f9312dad11b1751bdf6fd62e80328adf91ab3","cross_cats_sorted":["cs.NI","math.IT","math.PR","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T16:38:21Z","title_canon_sha256":"601f21c79fb4d0edff357338f216309b26491568d172bdc987940d88ba316795"},"schema_version":"1.0","source":{"id":"1601.06065","kind":"arxiv","version":2}},"canonical_sha256":"8ba0707abf0744494e37b26e45329f14ced24a03e7ec7fdafc2e7a352fadcb8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ba0707abf0744494e37b26e45329f14ced24a03e7ec7fdafc2e7a352fadcb8c","first_computed_at":"2026-05-18T00:50:09.803101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:09.803101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yERPDrHODcqI17otquIR9vf2xKqJXmAZzQx35CBLxKhJ3tAU0SGDPnsvystanw4wFu2xrn0UwFORrGQH1j1dBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:09.803644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7fed1792676d6744e31c96a0a3587187d57496583b1fe1aa38a1f9ca12f7e83","sha256:fba92fef7a130f55428895cd2001aee881395b9ff4a91f01ecc5de956e18e95b"],"state_sha256":"4ea14e160703f39bf4b8b29259b16bddf06e67f7034e8195f593b8a7d82aa63a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dknMqKOzhgt9UH2cSpL/cKnp3haen3nvwe9NzbWyd3XSk1HGFSURuHQ0s+yoOnhnG3Du5gBoWclB2Kx7ZtevAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T16:10:38.179012Z","bundle_sha256":"ebe747e568efa2dffc15086bb6e21b0104dc0ea6f8076d8082f9d30dfd63e916"}}