{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UFQCL24F5HCBUNQS76O45XEKVK","short_pith_number":"pith:UFQCL24F","canonical_record":{"source":{"id":"1612.05715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-17T07:41:46Z","cross_cats_sorted":[],"title_canon_sha256":"3d0b7b0406e58812ea4278c2e8ea45a8a8880867529514bb25d863f35d43eaad","abstract_canon_sha256":"162a14ca3462c907a3fc5f8b3ee6d56bd173497e2605da7c0b0b148393f8049c"},"schema_version":"1.0"},"canonical_sha256":"a16025eb85e9c41a3612ff9dcedc8aaab672a53fb20bfed98b9ee157a60e2d22","source":{"kind":"arxiv","id":"1612.05715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05715","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05715v1","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05715","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"UFQCL24F5HCB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UFQCL24F5HCBUNQS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UFQCL24F","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UFQCL24F5HCBUNQS76O45XEKVK","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-17T07:41:46Z","cross_cats_sorted":[],"title_canon_sha256":"3d0b7b0406e58812ea4278c2e8ea45a8a8880867529514bb25d863f35d43eaad","abstract_canon_sha256":"162a14ca3462c907a3fc5f8b3ee6d56bd173497e2605da7c0b0b148393f8049c"},"schema_version":"1.0"},"canonical_sha256":"a16025eb85e9c41a3612ff9dcedc8aaab672a53fb20bfed98b9ee157a60e2d22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:46.880994Z","signature_b64":"znqThHtfBKzBwuqDYoE4u4ssbd9/xo3HYnSXXbW/d6N4cdh9+qA3uqJcYWqKGq0Iw0RSGbRS8Xxuu3Iz09+NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a16025eb85e9c41a3612ff9dcedc8aaab672a53fb20bfed98b9ee157a60e2d22","last_reissued_at":"2026-05-18T00:54:46.880326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:46.880326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05715","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:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cuOvjPqx0LtliB/yyGnjF2tcx6Q6xZTpz72CgJlRHREPOw6np7PkaPp4DgjkVcw9OPssB+MMvYGNPy33gBBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:58:02.116613Z"},"content_sha256":"cc9590408868eb82c963e20ae8508d4ed1c67876bed8647ab13883a896dad634","schema_version":"1.0","event_id":"sha256:cc9590408868eb82c963e20ae8508d4ed1c67876bed8647ab13883a896dad634"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UFQCL24F5HCBUNQS76O45XEKVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity-Cognizant Multiple-Access Schemes for Large Wireless Networks With Node Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmed El Shafie, Naofal Al-Dhahir, Ridha Hamila","submitted_at":"2016-12-17T07:41:46Z","abstract_excerpt":"This paper proposes efficient multiple-access schemes for large wireless networks based on the transmitters' buffer state information and their transceivers' duplex transmission capability. First, we investigate the case of half-duplex nodes where a node can either transmit or receive in a given time instant. The network is said to be naturally sparse if the number of nonempty-queue transmitters in a given frame is much smaller than the number of users, which is the case when the arrival rates to the queues are very small and the number of users is large. If the network is not naturally sparse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05715","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:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmHeLui3yrkm5D2I1puaNH+QXYYFbnLYcca5j3ppFqfa+HQlTfz9cewBBSD/Vqx3RUqt9IXzDlnL3OA/DqqfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:58:02.117178Z"},"content_sha256":"15a212f5206e2574017e54d8710dd5c84390059e3ccfcd44fdbccdbf5b5fbd0f","schema_version":"1.0","event_id":"sha256:15a212f5206e2574017e54d8710dd5c84390059e3ccfcd44fdbccdbf5b5fbd0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFQCL24F5HCBUNQS76O45XEKVK/bundle.json","state_url":"https://pith.science/pith/UFQCL24F5HCBUNQS76O45XEKVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFQCL24F5HCBUNQS76O45XEKVK/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-23T21:58:02Z","links":{"resolver":"https://pith.science/pith/UFQCL24F5HCBUNQS76O45XEKVK","bundle":"https://pith.science/pith/UFQCL24F5HCBUNQS76O45XEKVK/bundle.json","state":"https://pith.science/pith/UFQCL24F5HCBUNQS76O45XEKVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFQCL24F5HCBUNQS76O45XEKVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UFQCL24F5HCBUNQS76O45XEKVK","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":"162a14ca3462c907a3fc5f8b3ee6d56bd173497e2605da7c0b0b148393f8049c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-17T07:41:46Z","title_canon_sha256":"3d0b7b0406e58812ea4278c2e8ea45a8a8880867529514bb25d863f35d43eaad"},"schema_version":"1.0","source":{"id":"1612.05715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05715","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05715v1","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05715","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"UFQCL24F5HCB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UFQCL24F5HCBUNQS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UFQCL24F","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:15a212f5206e2574017e54d8710dd5c84390059e3ccfcd44fdbccdbf5b5fbd0f","target":"graph","created_at":"2026-05-18T00:54:46Z","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 proposes efficient multiple-access schemes for large wireless networks based on the transmitters' buffer state information and their transceivers' duplex transmission capability. First, we investigate the case of half-duplex nodes where a node can either transmit or receive in a given time instant. The network is said to be naturally sparse if the number of nonempty-queue transmitters in a given frame is much smaller than the number of users, which is the case when the arrival rates to the queues are very small and the number of users is large. If the network is not naturally sparse","authors_text":"Ahmed El Shafie, Naofal Al-Dhahir, Ridha Hamila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-17T07:41:46Z","title":"Sparsity-Cognizant Multiple-Access Schemes for Large Wireless Networks With Node Buffers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05715","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:cc9590408868eb82c963e20ae8508d4ed1c67876bed8647ab13883a896dad634","target":"record","created_at":"2026-05-18T00:54:46Z","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":"162a14ca3462c907a3fc5f8b3ee6d56bd173497e2605da7c0b0b148393f8049c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-17T07:41:46Z","title_canon_sha256":"3d0b7b0406e58812ea4278c2e8ea45a8a8880867529514bb25d863f35d43eaad"},"schema_version":"1.0","source":{"id":"1612.05715","kind":"arxiv","version":1}},"canonical_sha256":"a16025eb85e9c41a3612ff9dcedc8aaab672a53fb20bfed98b9ee157a60e2d22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a16025eb85e9c41a3612ff9dcedc8aaab672a53fb20bfed98b9ee157a60e2d22","first_computed_at":"2026-05-18T00:54:46.880326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:46.880326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"znqThHtfBKzBwuqDYoE4u4ssbd9/xo3HYnSXXbW/d6N4cdh9+qA3uqJcYWqKGq0Iw0RSGbRS8Xxuu3Iz09+NDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:46.880994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc9590408868eb82c963e20ae8508d4ed1c67876bed8647ab13883a896dad634","sha256:15a212f5206e2574017e54d8710dd5c84390059e3ccfcd44fdbccdbf5b5fbd0f"],"state_sha256":"f2cc979c03998866b50d7d8a342b97b8a4ba9d3ff64f2820e38881025d3bfddf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0EB59w7hgpDOZ+vAK2UUe2c3s6Y5DK5242UE98hasZS8Lxh4RZSPkGBvKqjlTyklBYgU4YFtaEga3Oi55x+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:58:02.119901Z","bundle_sha256":"44eafbe25d9aa0c9434c61447bf0c55ebe386cfe791a2af28d8d0fcb87837f9d"}}