{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6I5QRAC4EQVPHRJNYU4HQDOZKA","short_pith_number":"pith:6I5QRAC4","canonical_record":{"source":{"id":"1607.05017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-18T11:07:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2bca7193587b75743efa84f38fc58f99385f36b96a401b1f446b4d565aaa5794","abstract_canon_sha256":"d377ad42c2f191a165611d902cde4ae6780abe3c80ea8c01f50efaf554ad0eb3"},"schema_version":"1.0"},"canonical_sha256":"f23b08805c242af3c52dc538780dd9501c8d54376492071a84419591bf2cc8cd","source":{"kind":"arxiv","id":"1607.05017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05017","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05017v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05017","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"6I5QRAC4EQVP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6I5QRAC4EQVPHRJN","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6I5QRAC4","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6I5QRAC4EQVPHRJNYU4HQDOZKA","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-18T11:07:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2bca7193587b75743efa84f38fc58f99385f36b96a401b1f446b4d565aaa5794","abstract_canon_sha256":"d377ad42c2f191a165611d902cde4ae6780abe3c80ea8c01f50efaf554ad0eb3"},"schema_version":"1.0"},"canonical_sha256":"f23b08805c242af3c52dc538780dd9501c8d54376492071a84419591bf2cc8cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:33.165567Z","signature_b64":"YF951t3n/X+7PukXr+ZHXKv6LNzDOMBnMfV7CnGA06TlFF61xwai5ZhrGbc5p8YlbpGa4OuktjjEJz5HYrJSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f23b08805c242af3c52dc538780dd9501c8d54376492071a84419591bf2cc8cd","last_reissued_at":"2026-05-18T00:58:33.164915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:33.164915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05017","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:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tAmz3F+IUpiC+3aUcP23WQAE0oADWkfHgIw6De19+a8R0NYO851p7+t63cuKbpVryuDu1rd737IjGt15ScyRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:50:57.874130Z"},"content_sha256":"79e3d9c0986f86eea816bd2a0be60ee3ad332775898f0c6ef0c550afd89a4ec1","schema_version":"1.0","event_id":"sha256:79e3d9c0986f86eea816bd2a0be60ee3ad332775898f0c6ef0c550afd89a4ec1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6I5QRAC4EQVPHRJNYU4HQDOZKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Grant-free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xianbin Wang, Yan Chen, Yu Zhang, Zhaoyang Zhang","submitted_at":"2016-07-18T11:07:26Z","abstract_excerpt":"Rateless Multiple Access (RMA) is a novel non-orthogonal multiple access framework that is promising for massive access in Internet of Things (IoT) due to its high efficiency and low complexity. In the framework, after certain \\emph{registration}, each active user respectively transmits to the access point (AP) randomly based on an assigned random access control function (RACf) until receiving an acknowledgement (ACK). In this work, by exploiting the intrinsic access pattern of each user, we propose a grant-free RMA scheme, which no longer needs the registration process as in the original RMA,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05017","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:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5k/rfA0+k6gbIqCe59WKemE1wwaIeAv06WtYYOP+DMxxsJzfY2yLE4M6P1oIgn7azEif5L+ok9HTyfMiGavoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:50:57.874549Z"},"content_sha256":"76a6233845b495eb23d1f2d893c81959f400859b0605eed812d8376a0973f007","schema_version":"1.0","event_id":"sha256:76a6233845b495eb23d1f2d893c81959f400859b0605eed812d8376a0973f007"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6I5QRAC4EQVPHRJNYU4HQDOZKA/bundle.json","state_url":"https://pith.science/pith/6I5QRAC4EQVPHRJNYU4HQDOZKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6I5QRAC4EQVPHRJNYU4HQDOZKA/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-28T15:50:57Z","links":{"resolver":"https://pith.science/pith/6I5QRAC4EQVPHRJNYU4HQDOZKA","bundle":"https://pith.science/pith/6I5QRAC4EQVPHRJNYU4HQDOZKA/bundle.json","state":"https://pith.science/pith/6I5QRAC4EQVPHRJNYU4HQDOZKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6I5QRAC4EQVPHRJNYU4HQDOZKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6I5QRAC4EQVPHRJNYU4HQDOZKA","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":"d377ad42c2f191a165611d902cde4ae6780abe3c80ea8c01f50efaf554ad0eb3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-18T11:07:26Z","title_canon_sha256":"2bca7193587b75743efa84f38fc58f99385f36b96a401b1f446b4d565aaa5794"},"schema_version":"1.0","source":{"id":"1607.05017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05017","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05017v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05017","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"6I5QRAC4EQVP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6I5QRAC4EQVPHRJN","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6I5QRAC4","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:76a6233845b495eb23d1f2d893c81959f400859b0605eed812d8376a0973f007","target":"graph","created_at":"2026-05-18T00:58:33Z","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":"Rateless Multiple Access (RMA) is a novel non-orthogonal multiple access framework that is promising for massive access in Internet of Things (IoT) due to its high efficiency and low complexity. In the framework, after certain \\emph{registration}, each active user respectively transmits to the access point (AP) randomly based on an assigned random access control function (RACf) until receiving an acknowledgement (ACK). In this work, by exploiting the intrinsic access pattern of each user, we propose a grant-free RMA scheme, which no longer needs the registration process as in the original RMA,","authors_text":"Xianbin Wang, Yan Chen, Yu Zhang, Zhaoyang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-18T11:07:26Z","title":"Grant-free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05017","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:79e3d9c0986f86eea816bd2a0be60ee3ad332775898f0c6ef0c550afd89a4ec1","target":"record","created_at":"2026-05-18T00:58:33Z","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":"d377ad42c2f191a165611d902cde4ae6780abe3c80ea8c01f50efaf554ad0eb3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-18T11:07:26Z","title_canon_sha256":"2bca7193587b75743efa84f38fc58f99385f36b96a401b1f446b4d565aaa5794"},"schema_version":"1.0","source":{"id":"1607.05017","kind":"arxiv","version":1}},"canonical_sha256":"f23b08805c242af3c52dc538780dd9501c8d54376492071a84419591bf2cc8cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f23b08805c242af3c52dc538780dd9501c8d54376492071a84419591bf2cc8cd","first_computed_at":"2026-05-18T00:58:33.164915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:33.164915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YF951t3n/X+7PukXr+ZHXKv6LNzDOMBnMfV7CnGA06TlFF61xwai5ZhrGbc5p8YlbpGa4OuktjjEJz5HYrJSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:33.165567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79e3d9c0986f86eea816bd2a0be60ee3ad332775898f0c6ef0c550afd89a4ec1","sha256:76a6233845b495eb23d1f2d893c81959f400859b0605eed812d8376a0973f007"],"state_sha256":"2cc9656d8ef8e1d1097974e3fc79d3aee6f54ad4d773829adc4cef9e603ef1af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cUOTKa2IxgcRRQPHOPIP5uCZlGC2zms5MWseRcAxbXXliatqDeDm9tdvEFyZXoJ0ncTdXohWcxcw7ZHKqduAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:50:57.877508Z","bundle_sha256":"a8727f970af7223c199a725e9a5cc8e774e507a907db3e3e43e6fe642320117a"}}