{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:H5XOMTR66JZ3XGHNMDPVKCAT4W","short_pith_number":"pith:H5XOMTR6","canonical_record":{"source":{"id":"1710.01751","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-04T18:13:46Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"7352662f5f86b09c7f0d27d8145c184bc7b85a5bb72249f291683f79b79860a8","abstract_canon_sha256":"8e85cbcaecd4b08b812cfb4c67082863713c4cd4c78cabdf84c921e0310af95b"},"schema_version":"1.0"},"canonical_sha256":"3f6ee64e3ef273bb98ed60df550813e58b8c0c240afeb26b5638b2fdceca1ad4","source":{"kind":"arxiv","id":"1710.01751","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01751","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01751v3","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01751","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"H5XOMTR66JZ3","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H5XOMTR66JZ3XGHN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H5XOMTR6","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:H5XOMTR66JZ3XGHNMDPVKCAT4W","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01751","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-04T18:13:46Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"7352662f5f86b09c7f0d27d8145c184bc7b85a5bb72249f291683f79b79860a8","abstract_canon_sha256":"8e85cbcaecd4b08b812cfb4c67082863713c4cd4c78cabdf84c921e0310af95b"},"schema_version":"1.0"},"canonical_sha256":"3f6ee64e3ef273bb98ed60df550813e58b8c0c240afeb26b5638b2fdceca1ad4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:53.618365Z","signature_b64":"vaM/M566NA6wVCmnJrOhkKDhTYSVM6dY55zPxFQHBmNWHoSI3n4VkppWCnR6Ggp4Nj8tW2V8RcC/IwQ1YgWPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f6ee64e3ef273bb98ed60df550813e58b8c0c240afeb26b5638b2fdceca1ad4","last_reissued_at":"2026-05-17T23:59:53.617828Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:53.617828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01751","source_version":3,"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-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0WrDhgQjiu+GXUZJkJM3RYZukMTNmtBQE6wvNnsCs6gSKsC43gNkFPg3s6lROAzOlLXF6curLeMB/PNpA7qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:46:09.740156Z"},"content_sha256":"aa5fb34ff72cfc84930cb1ac83a234e3be544af8c65b1c5c15ec56abc5343a95","schema_version":"1.0","event_id":"sha256:aa5fb34ff72cfc84930cb1ac83a234e3be544af8c65b1c5c15ec56abc5343a95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:H5XOMTR66JZ3XGHNMDPVKCAT4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Multiple Access with A General Link Layer Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Faeze Heydaryan, Jie Luo, Yanru Tang","submitted_at":"2017-10-04T18:13:46Z","abstract_excerpt":"This paper investigates the problem of distributed medium access control in a time slotted wireless multiple access network with an unknown finite number of homogeneous users. Assume that each user has a single transmission option. In each time slot, a user chooses either to idle or to transmit a packet. Under a general channel model, a distributed medium access control framework is proposed to adapt transmission probabilities of all users to a value that maximizes an arbitrarily chosen symmetric network utility. Probability target of each user in the proposed algorithm is calculated based upo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01751","kind":"arxiv","version":3},"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-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ylHK7Rqou+ucKunWpVh4weYj8dU7LSVtOLfdJU/s8SwpX4IcDw3q/AZfmHCXwqjM1vE8mvO6YrY//Rv43C9vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:46:09.740545Z"},"content_sha256":"3835771eb8afb14efa4d36e73be9d7e4d627a1ada89783718b89b10702a4164d","schema_version":"1.0","event_id":"sha256:3835771eb8afb14efa4d36e73be9d7e4d627a1ada89783718b89b10702a4164d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5XOMTR66JZ3XGHNMDPVKCAT4W/bundle.json","state_url":"https://pith.science/pith/H5XOMTR66JZ3XGHNMDPVKCAT4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5XOMTR66JZ3XGHNMDPVKCAT4W/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-04T22:46:09Z","links":{"resolver":"https://pith.science/pith/H5XOMTR66JZ3XGHNMDPVKCAT4W","bundle":"https://pith.science/pith/H5XOMTR66JZ3XGHNMDPVKCAT4W/bundle.json","state":"https://pith.science/pith/H5XOMTR66JZ3XGHNMDPVKCAT4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5XOMTR66JZ3XGHNMDPVKCAT4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:H5XOMTR66JZ3XGHNMDPVKCAT4W","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":"8e85cbcaecd4b08b812cfb4c67082863713c4cd4c78cabdf84c921e0310af95b","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-04T18:13:46Z","title_canon_sha256":"7352662f5f86b09c7f0d27d8145c184bc7b85a5bb72249f291683f79b79860a8"},"schema_version":"1.0","source":{"id":"1710.01751","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01751","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01751v3","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01751","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"H5XOMTR66JZ3","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H5XOMTR66JZ3XGHN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H5XOMTR6","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:3835771eb8afb14efa4d36e73be9d7e4d627a1ada89783718b89b10702a4164d","target":"graph","created_at":"2026-05-17T23:59:53Z","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 investigates the problem of distributed medium access control in a time slotted wireless multiple access network with an unknown finite number of homogeneous users. Assume that each user has a single transmission option. In each time slot, a user chooses either to idle or to transmit a packet. Under a general channel model, a distributed medium access control framework is proposed to adapt transmission probabilities of all users to a value that maximizes an arbitrarily chosen symmetric network utility. Probability target of each user in the proposed algorithm is calculated based upo","authors_text":"Faeze Heydaryan, Jie Luo, Yanru Tang","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-04T18:13:46Z","title":"Distributed Multiple Access with A General Link Layer Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01751","kind":"arxiv","version":3},"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:aa5fb34ff72cfc84930cb1ac83a234e3be544af8c65b1c5c15ec56abc5343a95","target":"record","created_at":"2026-05-17T23:59:53Z","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":"8e85cbcaecd4b08b812cfb4c67082863713c4cd4c78cabdf84c921e0310af95b","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-04T18:13:46Z","title_canon_sha256":"7352662f5f86b09c7f0d27d8145c184bc7b85a5bb72249f291683f79b79860a8"},"schema_version":"1.0","source":{"id":"1710.01751","kind":"arxiv","version":3}},"canonical_sha256":"3f6ee64e3ef273bb98ed60df550813e58b8c0c240afeb26b5638b2fdceca1ad4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f6ee64e3ef273bb98ed60df550813e58b8c0c240afeb26b5638b2fdceca1ad4","first_computed_at":"2026-05-17T23:59:53.617828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:53.617828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vaM/M566NA6wVCmnJrOhkKDhTYSVM6dY55zPxFQHBmNWHoSI3n4VkppWCnR6Ggp4Nj8tW2V8RcC/IwQ1YgWPDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:53.618365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01751","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa5fb34ff72cfc84930cb1ac83a234e3be544af8c65b1c5c15ec56abc5343a95","sha256:3835771eb8afb14efa4d36e73be9d7e4d627a1ada89783718b89b10702a4164d"],"state_sha256":"0ef7deb72781062bd609bdb8568f44b3c6a1d592c6d4a5e346766308ca068a3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGc89z5eMirUVzblpVYUd7ZiIjtl2C6V02kbyX6QvOywPjhIE4CYnSfBeV2lcR2Q/DqyHmvUzZ1t68TK+NvqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:46:09.743298Z","bundle_sha256":"a45ea9a626a9ae59179c36c68500ef219305e4a2198c1165e2d778da25a9ff17"}}