{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FCYBOOUADX6ZX47R2P3HFZBPT7","short_pith_number":"pith:FCYBOOUA","canonical_record":{"source":{"id":"1811.12708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T10:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"f9baebf9628802bb3e457f24880a65f9a5f4f54aa12bb34d5436efe2461d540c","abstract_canon_sha256":"602693259c70651222261cb45fced99ace964f3fa69cc3b64d616ba130393f30"},"schema_version":"1.0"},"canonical_sha256":"28b0173a801dfd9bf3f1d3f672e42f9feb7c21d8e070eb0d65397cbb743d89ca","source":{"kind":"arxiv","id":"1811.12708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12708","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12708v1","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12708","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"FCYBOOUADX6Z","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FCYBOOUADX6ZX47R","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FCYBOOUA","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FCYBOOUADX6ZX47R2P3HFZBPT7","target":"record","payload":{"canonical_record":{"source":{"id":"1811.12708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T10:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"f9baebf9628802bb3e457f24880a65f9a5f4f54aa12bb34d5436efe2461d540c","abstract_canon_sha256":"602693259c70651222261cb45fced99ace964f3fa69cc3b64d616ba130393f30"},"schema_version":"1.0"},"canonical_sha256":"28b0173a801dfd9bf3f1d3f672e42f9feb7c21d8e070eb0d65397cbb743d89ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:28.771859Z","signature_b64":"vRmOQPImchFFe9vwqbDtUhAtqOd55qAushz7kQCl2m56LhKllyFNX6CkLIGowJtBpSnO390S83yrjxTOEHM+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28b0173a801dfd9bf3f1d3f672e42f9feb7c21d8e070eb0d65397cbb743d89ca","last_reissued_at":"2026-05-17T23:59:28.771336Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:28.771336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.12708","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-17T23:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OrEqjPRiKfWA1iisFA2Rldywc27vjOHFR3mavDsooCG6dYjoBh1Zz1CbuRGVImID3O39nONc7NqpfkqTzMUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:47:47.069166Z"},"content_sha256":"6e9b7be90adb9092c423cca997bc2eb2e958c0711628eb56401719576d875e86","schema_version":"1.0","event_id":"sha256:6e9b7be90adb9092c423cca997bc2eb2e958c0711628eb56401719576d875e86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FCYBOOUADX6ZX47R2P3HFZBPT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"2D Proactive Uplink Resource Allocation Algorithm for Event Based MTC Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Diep N. Nguyen, Eryk Dutkiewicz, Thai T. Vu","submitted_at":"2018-11-30T10:40:36Z","abstract_excerpt":"We propose a two dimension (2D) proactive uplink resource allocation (2D-PURA) algorithm that aims to reduce the delay/latency in event-based machine-type communications (MTC) applications. Specifically, when an event of interest occurs at a device, it tends to spread to the neighboring devices. Consequently, when a device has data to send to the base station (BS), its neighbors later are highly likely to transmit. Thus, we propose to cluster devices in the neighborhood around the event, also referred to as the disturbance region, into rings based on the distance from the original event. To re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12708","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-17T23:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+NN8WH/6xB4VXh9Fw92s7KM8aHPumPs0iSnuiZEnqadvWObzrORKPxRTgC0Y9uo1nnRVZkm/rVejtyKXHqoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:47:47.069839Z"},"content_sha256":"18fed33f3f98829e48dbc492212e22a53c9344b8255ed18992dc29c24456c91a","schema_version":"1.0","event_id":"sha256:18fed33f3f98829e48dbc492212e22a53c9344b8255ed18992dc29c24456c91a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCYBOOUADX6ZX47R2P3HFZBPT7/bundle.json","state_url":"https://pith.science/pith/FCYBOOUADX6ZX47R2P3HFZBPT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCYBOOUADX6ZX47R2P3HFZBPT7/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-31T20:47:47Z","links":{"resolver":"https://pith.science/pith/FCYBOOUADX6ZX47R2P3HFZBPT7","bundle":"https://pith.science/pith/FCYBOOUADX6ZX47R2P3HFZBPT7/bundle.json","state":"https://pith.science/pith/FCYBOOUADX6ZX47R2P3HFZBPT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCYBOOUADX6ZX47R2P3HFZBPT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FCYBOOUADX6ZX47R2P3HFZBPT7","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":"602693259c70651222261cb45fced99ace964f3fa69cc3b64d616ba130393f30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T10:40:36Z","title_canon_sha256":"f9baebf9628802bb3e457f24880a65f9a5f4f54aa12bb34d5436efe2461d540c"},"schema_version":"1.0","source":{"id":"1811.12708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12708","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12708v1","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12708","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"FCYBOOUADX6Z","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FCYBOOUADX6ZX47R","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FCYBOOUA","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:18fed33f3f98829e48dbc492212e22a53c9344b8255ed18992dc29c24456c91a","target":"graph","created_at":"2026-05-17T23:59:28Z","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 two dimension (2D) proactive uplink resource allocation (2D-PURA) algorithm that aims to reduce the delay/latency in event-based machine-type communications (MTC) applications. Specifically, when an event of interest occurs at a device, it tends to spread to the neighboring devices. Consequently, when a device has data to send to the base station (BS), its neighbors later are highly likely to transmit. Thus, we propose to cluster devices in the neighborhood around the event, also referred to as the disturbance region, into rings based on the distance from the original event. To re","authors_text":"Diep N. Nguyen, Eryk Dutkiewicz, Thai T. Vu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T10:40:36Z","title":"2D Proactive Uplink Resource Allocation Algorithm for Event Based MTC Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12708","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:6e9b7be90adb9092c423cca997bc2eb2e958c0711628eb56401719576d875e86","target":"record","created_at":"2026-05-17T23:59:28Z","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":"602693259c70651222261cb45fced99ace964f3fa69cc3b64d616ba130393f30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T10:40:36Z","title_canon_sha256":"f9baebf9628802bb3e457f24880a65f9a5f4f54aa12bb34d5436efe2461d540c"},"schema_version":"1.0","source":{"id":"1811.12708","kind":"arxiv","version":1}},"canonical_sha256":"28b0173a801dfd9bf3f1d3f672e42f9feb7c21d8e070eb0d65397cbb743d89ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28b0173a801dfd9bf3f1d3f672e42f9feb7c21d8e070eb0d65397cbb743d89ca","first_computed_at":"2026-05-17T23:59:28.771336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:28.771336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vRmOQPImchFFe9vwqbDtUhAtqOd55qAushz7kQCl2m56LhKllyFNX6CkLIGowJtBpSnO390S83yrjxTOEHM+CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:28.771859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e9b7be90adb9092c423cca997bc2eb2e958c0711628eb56401719576d875e86","sha256:18fed33f3f98829e48dbc492212e22a53c9344b8255ed18992dc29c24456c91a"],"state_sha256":"31d4c67ea89d7114b69c322f1216b6cd4551758fb0bea11dbb76a0505f9a99e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFJJ1M0g2tIrA6ET5EyscZ8qUtM+X9NBdONtNmzqWFZpy2Q+h05aLLJXz4W0xqryrvaDEJD6ixjp0UdQcLnuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:47:47.073257Z","bundle_sha256":"304b29c82e1106001aaca4ee5004940438ae694a6e27e533ab7ec6df8b3ecf36"}}