{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YXXK3VWOW6KSNI2XPQBAU3TEGO","short_pith_number":"pith:YXXK3VWO","canonical_record":{"source":{"id":"1611.03183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-10T04:33:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e94ef8b5764366f17d6eb6f6114023ebf7b7ce3f68f20b2ec7240f0b5844bf2","abstract_canon_sha256":"cd07a2f9448f2a5a553ee9b31a55e4d96a1f1504cc715ede20643b243f531112"},"schema_version":"1.0"},"canonical_sha256":"c5eeadd6ceb79526a3577c020a6e6433a5e24ebcc41996d137226341e648aeb3","source":{"kind":"arxiv","id":"1611.03183","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03183","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03183v2","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03183","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"YXXK3VWOW6KS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YXXK3VWOW6KSNI2X","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YXXK3VWO","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YXXK3VWOW6KSNI2XPQBAU3TEGO","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-10T04:33:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e94ef8b5764366f17d6eb6f6114023ebf7b7ce3f68f20b2ec7240f0b5844bf2","abstract_canon_sha256":"cd07a2f9448f2a5a553ee9b31a55e4d96a1f1504cc715ede20643b243f531112"},"schema_version":"1.0"},"canonical_sha256":"c5eeadd6ceb79526a3577c020a6e6433a5e24ebcc41996d137226341e648aeb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:02.308925Z","signature_b64":"KXN9eiCZKxmuSzRP3dJ6s9tW+MW+WFrWu0FnR1L507PzH5r8DQjjevXxOpbAJH7TEyKb9W4MIIPYMV8I36O8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5eeadd6ceb79526a3577c020a6e6433a5e24ebcc41996d137226341e648aeb3","last_reissued_at":"2026-05-18T00:33:02.308455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:02.308455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03183","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:33:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFsnJvZGbozjLG4suyKYug1/5jgIOOqMapeAU3a9f1sGsp6VZ3dncSF3a39aBW0FZ2+Ism+tHm1L6/j3q65kAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:53:35.982600Z"},"content_sha256":"766d1de57dcfc9c12bde0c277ea3440b220ce939e16e6c836f94462c75ebc749","schema_version":"1.0","event_id":"sha256:766d1de57dcfc9c12bde0c277ea3440b220ce939e16e6c836f94462c75ebc749"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YXXK3VWOW6KSNI2XPQBAU3TEGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Massive Machine Type Communication with Data Aggregation and Resource Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Halim Yanikomeroglu, Jing Guo, Salman Durrani, Xiangyun Zhou","submitted_at":"2016-11-10T04:33:46Z","abstract_excerpt":"To enable massive machine type communication (mMTC), data aggregation is a promising approach to reduce the congestion caused by a massive number of machine type devices (MTDs). In this work, we consider a two-phase cellular-based mMTC network where MTDs transmit to aggregators (i.e., aggregation phase) and the aggregated data is then relayed to base stations (i.e., relaying phase). Due to the limited resources, the aggregators not only aggregate data, but also schedule resources among MTDs. We consider two scheduling schemes: random resource scheduling (RRS) and channel-aware resource schedul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03183","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:33:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eUFUifpaKKNGdaPq8ScXDFeg4eZOZSOTW56gyuqEyFg0Qn1uHisS98pU9NNA/sOdZcUGlrRhjwz6hjL4RNTbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:53:35.983260Z"},"content_sha256":"16358a74069070794416f7d3d027e463bd0248c8640b2ce2de464bdf6d508a9d","schema_version":"1.0","event_id":"sha256:16358a74069070794416f7d3d027e463bd0248c8640b2ce2de464bdf6d508a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXXK3VWOW6KSNI2XPQBAU3TEGO/bundle.json","state_url":"https://pith.science/pith/YXXK3VWOW6KSNI2XPQBAU3TEGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXXK3VWOW6KSNI2XPQBAU3TEGO/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-01T01:53:35Z","links":{"resolver":"https://pith.science/pith/YXXK3VWOW6KSNI2XPQBAU3TEGO","bundle":"https://pith.science/pith/YXXK3VWOW6KSNI2XPQBAU3TEGO/bundle.json","state":"https://pith.science/pith/YXXK3VWOW6KSNI2XPQBAU3TEGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXXK3VWOW6KSNI2XPQBAU3TEGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YXXK3VWOW6KSNI2XPQBAU3TEGO","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":"cd07a2f9448f2a5a553ee9b31a55e4d96a1f1504cc715ede20643b243f531112","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-10T04:33:46Z","title_canon_sha256":"6e94ef8b5764366f17d6eb6f6114023ebf7b7ce3f68f20b2ec7240f0b5844bf2"},"schema_version":"1.0","source":{"id":"1611.03183","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03183","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03183v2","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03183","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"YXXK3VWOW6KS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YXXK3VWOW6KSNI2X","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YXXK3VWO","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:16358a74069070794416f7d3d027e463bd0248c8640b2ce2de464bdf6d508a9d","target":"graph","created_at":"2026-05-18T00:33:02Z","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":"To enable massive machine type communication (mMTC), data aggregation is a promising approach to reduce the congestion caused by a massive number of machine type devices (MTDs). In this work, we consider a two-phase cellular-based mMTC network where MTDs transmit to aggregators (i.e., aggregation phase) and the aggregated data is then relayed to base stations (i.e., relaying phase). Due to the limited resources, the aggregators not only aggregate data, but also schedule resources among MTDs. We consider two scheduling schemes: random resource scheduling (RRS) and channel-aware resource schedul","authors_text":"Halim Yanikomeroglu, Jing Guo, Salman Durrani, Xiangyun Zhou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-10T04:33:46Z","title":"Massive Machine Type Communication with Data Aggregation and Resource Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03183","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:766d1de57dcfc9c12bde0c277ea3440b220ce939e16e6c836f94462c75ebc749","target":"record","created_at":"2026-05-18T00:33:02Z","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":"cd07a2f9448f2a5a553ee9b31a55e4d96a1f1504cc715ede20643b243f531112","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-10T04:33:46Z","title_canon_sha256":"6e94ef8b5764366f17d6eb6f6114023ebf7b7ce3f68f20b2ec7240f0b5844bf2"},"schema_version":"1.0","source":{"id":"1611.03183","kind":"arxiv","version":2}},"canonical_sha256":"c5eeadd6ceb79526a3577c020a6e6433a5e24ebcc41996d137226341e648aeb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5eeadd6ceb79526a3577c020a6e6433a5e24ebcc41996d137226341e648aeb3","first_computed_at":"2026-05-18T00:33:02.308455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:02.308455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KXN9eiCZKxmuSzRP3dJ6s9tW+MW+WFrWu0FnR1L507PzH5r8DQjjevXxOpbAJH7TEyKb9W4MIIPYMV8I36O8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:02.308925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03183","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:766d1de57dcfc9c12bde0c277ea3440b220ce939e16e6c836f94462c75ebc749","sha256:16358a74069070794416f7d3d027e463bd0248c8640b2ce2de464bdf6d508a9d"],"state_sha256":"93f199460c28fd138bec88fae5d34e1748c9294843e708d0c15696c2687429c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9iDc0J2IPJ9y09To2DkOFuNKdQRWlW66hlnhHMBfmBE0+j2Iay+s0avndQjWM2BnnOrtCndVXFWvnDLS+ylAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:53:35.985952Z","bundle_sha256":"12ed4af32be00147868b966134670a6dbed5a73bdf245dad62afc65d81f4ef17"}}