{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MXYYMZ2FP5T6SYKOUC5GAWLAPU","short_pith_number":"pith:MXYYMZ2F","canonical_record":{"source":{"id":"1610.07250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T00:05:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8dbb5ed67fa9d51d6af87f1f62e9abd544feb849f08397676b2880fb21bfa342","abstract_canon_sha256":"0413b56f571d4922bae40bdd80e7ad5b3be8a9fcaa04038897274e6640b4a90c"},"schema_version":"1.0"},"canonical_sha256":"65f18667457f67e9614ea0ba6059607d38c2fc26397bf0985f8354f588dcf9b3","source":{"kind":"arxiv","id":"1610.07250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07250","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07250v1","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07250","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"MXYYMZ2FP5T6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXYYMZ2FP5T6SYKO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXYYMZ2F","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MXYYMZ2FP5T6SYKOUC5GAWLAPU","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T00:05:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8dbb5ed67fa9d51d6af87f1f62e9abd544feb849f08397676b2880fb21bfa342","abstract_canon_sha256":"0413b56f571d4922bae40bdd80e7ad5b3be8a9fcaa04038897274e6640b4a90c"},"schema_version":"1.0"},"canonical_sha256":"65f18667457f67e9614ea0ba6059607d38c2fc26397bf0985f8354f588dcf9b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:30.541398Z","signature_b64":"lNr1wRWG7qAv8q3zT16Ud93p2pvDDYCSPVgeQ2ABo5g1bIkwDHuYo0ec7bR4slVD7hJ5K2JAofYM2niH9pXxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f18667457f67e9614ea0ba6059607d38c2fc26397bf0985f8354f588dcf9b3","last_reissued_at":"2026-05-18T01:01:30.540942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:30.540942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07250","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-18T01:01:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrH8KRElinxg1MNbq5mIQZd68q9/71SwnvXEpuImkcxyDPnDwuKUTvZSK7QjiwKOXF1H/7XaIA7OQlAQK2JiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:26:20.397064Z"},"content_sha256":"a98492cdec4324850c57dbdae0a83068832d8f76eeb1d275a03f830dfb4e20e7","schema_version":"1.0","event_id":"sha256:a98492cdec4324850c57dbdae0a83068832d8f76eeb1d275a03f830dfb4e20e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MXYYMZ2FP5T6SYKOUC5GAWLAPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Multiple Access for M2M Communications with QoS Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Mahyar Shirvanimoghaddam, Rana Abbas, Yonghui Li","submitted_at":"2016-10-24T00:05:32Z","abstract_excerpt":"We propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type communication (MTC) devices transmit over the same radio channel. Based on the latency requirements, MTC devices are divided into groups of different sizes, and the transmission frame is divided into subframes of different lengths. In each subframe, each group is assigned an access probability based on which an MTC device decides to transmit replicas of its packet or re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07250","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-18T01:01:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPDe1pKP4SuP7GtCWMm6xgpDu+ZFeYNOhNyn9rpajIvtb7Djyrr9UoGlZt6ea7AzIhXX6YQwdA+QuC5KHBmRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:26:20.397496Z"},"content_sha256":"4e8ffe193d49bb98b0ad404519848a6d6f028f2d1ff55772b167ccead314d20a","schema_version":"1.0","event_id":"sha256:4e8ffe193d49bb98b0ad404519848a6d6f028f2d1ff55772b167ccead314d20a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXYYMZ2FP5T6SYKOUC5GAWLAPU/bundle.json","state_url":"https://pith.science/pith/MXYYMZ2FP5T6SYKOUC5GAWLAPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXYYMZ2FP5T6SYKOUC5GAWLAPU/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-25T16:26:20Z","links":{"resolver":"https://pith.science/pith/MXYYMZ2FP5T6SYKOUC5GAWLAPU","bundle":"https://pith.science/pith/MXYYMZ2FP5T6SYKOUC5GAWLAPU/bundle.json","state":"https://pith.science/pith/MXYYMZ2FP5T6SYKOUC5GAWLAPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXYYMZ2FP5T6SYKOUC5GAWLAPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MXYYMZ2FP5T6SYKOUC5GAWLAPU","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":"0413b56f571d4922bae40bdd80e7ad5b3be8a9fcaa04038897274e6640b4a90c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T00:05:32Z","title_canon_sha256":"8dbb5ed67fa9d51d6af87f1f62e9abd544feb849f08397676b2880fb21bfa342"},"schema_version":"1.0","source":{"id":"1610.07250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07250","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07250v1","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07250","created_at":"2026-05-18T01:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"MXYYMZ2FP5T6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXYYMZ2FP5T6SYKO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXYYMZ2F","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:4e8ffe193d49bb98b0ad404519848a6d6f028f2d1ff55772b167ccead314d20a","target":"graph","created_at":"2026-05-18T01:01:30Z","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 propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type communication (MTC) devices transmit over the same radio channel. Based on the latency requirements, MTC devices are divided into groups of different sizes, and the transmission frame is divided into subframes of different lengths. In each subframe, each group is assigned an access probability based on which an MTC device decides to transmit replicas of its packet or re","authors_text":"Branka Vucetic, Mahyar Shirvanimoghaddam, Rana Abbas, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T00:05:32Z","title":"Random Multiple Access for M2M Communications with QoS Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07250","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:a98492cdec4324850c57dbdae0a83068832d8f76eeb1d275a03f830dfb4e20e7","target":"record","created_at":"2026-05-18T01:01:30Z","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":"0413b56f571d4922bae40bdd80e7ad5b3be8a9fcaa04038897274e6640b4a90c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T00:05:32Z","title_canon_sha256":"8dbb5ed67fa9d51d6af87f1f62e9abd544feb849f08397676b2880fb21bfa342"},"schema_version":"1.0","source":{"id":"1610.07250","kind":"arxiv","version":1}},"canonical_sha256":"65f18667457f67e9614ea0ba6059607d38c2fc26397bf0985f8354f588dcf9b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65f18667457f67e9614ea0ba6059607d38c2fc26397bf0985f8354f588dcf9b3","first_computed_at":"2026-05-18T01:01:30.540942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:30.540942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lNr1wRWG7qAv8q3zT16Ud93p2pvDDYCSPVgeQ2ABo5g1bIkwDHuYo0ec7bR4slVD7hJ5K2JAofYM2niH9pXxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:30.541398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a98492cdec4324850c57dbdae0a83068832d8f76eeb1d275a03f830dfb4e20e7","sha256:4e8ffe193d49bb98b0ad404519848a6d6f028f2d1ff55772b167ccead314d20a"],"state_sha256":"0c9bee9b30d2a06888be5dd79bcc527b50631946ee9139c01c725fcdd6532f2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+DIlS0DqmiH+Ru5MdVOGPOicjXxEVpsd086h8zgGgHMys8ejBV51brbpEPrPxa8GlZoKzJE+E/0Qosry96DDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:26:20.400437Z","bundle_sha256":"140148559951ef4aea18c5d00743401c155fdbc1749f918a5d64740d6416d043"}}