{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MRNG3GD2D4R3ZWPAZIZX3UWA2T","short_pith_number":"pith:MRNG3GD2","canonical_record":{"source":{"id":"1307.0585","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-02T03:51:39Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"8bcd0f6ea7e86cf906aa7a02b792e3c4d00c691e95b1899a638ac78a975d57ba","abstract_canon_sha256":"21423e14f2d191f456196b61a8f090baab3a37dc93646488680d5e80ca82822c"},"schema_version":"1.0"},"canonical_sha256":"645a6d987a1f23bcd9e0ca337dd2c0d4c747d2acd8a646b52d3eadea68f1dc17","source":{"kind":"arxiv","id":"1307.0585","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0585","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0585v2","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0585","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"MRNG3GD2D4R3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MRNG3GD2D4R3ZWPA","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MRNG3GD2","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MRNG3GD2D4R3ZWPAZIZX3UWA2T","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0585","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-02T03:51:39Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"8bcd0f6ea7e86cf906aa7a02b792e3c4d00c691e95b1899a638ac78a975d57ba","abstract_canon_sha256":"21423e14f2d191f456196b61a8f090baab3a37dc93646488680d5e80ca82822c"},"schema_version":"1.0"},"canonical_sha256":"645a6d987a1f23bcd9e0ca337dd2c0d4c747d2acd8a646b52d3eadea68f1dc17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:33.093577Z","signature_b64":"G+ANcNgjc3yJMgV4zXtWLH2Uf8Gphu6VQBNA2vFZDXVvQtWAmbwXvgJZgjoWpPy2vWZwxF0x51CLVugdZcmYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"645a6d987a1f23bcd9e0ca337dd2c0d4c747d2acd8a646b52d3eadea68f1dc17","last_reissued_at":"2026-05-18T03:11:33.093046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:33.093046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0585","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-18T03:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJeoMsEPS5UaRD1qZsQKd6Tcf/tKKxHNzqDqpAYemFFU8PVBGlK5fDFAR5a3EmOQRYGSyOCE+DM/IPloA8UJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:22:31.136112Z"},"content_sha256":"0a5c647954cff72cbc1321eb268420bde8fdd3ff7bd10ccff9d26bd174aeb56b","schema_version":"1.0","event_id":"sha256:0a5c647954cff72cbc1321eb268420bde8fdd3ff7bd10ccff9d26bd174aeb56b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MRNG3GD2D4R3ZWPAZIZX3UWA2T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamentals of Throughput Maximization with Random Arrivals for M2M Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Harish Viswanathan, Harpreet S. Dhillon, Howard C. Huang, Reinaldo A. Valenzuela","submitted_at":"2013-07-02T03:51:39Z","abstract_excerpt":"For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The framework considers both coordinated transmission (where devices are scheduled) and uncoordinated transmission (where devices communicate on a random access channel and a provision is made for retransmissions). Our main contribution is a novel characterization of the optimal throughput for the case of uncoordinated transmission and a strategy for achieving this th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0585","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-18T03:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Msgu/1R6VpJZwtNGqEVa0VsKytCu0DfZWacvMcebC+7lrclgCM1AUcCCjg9eN5saOowcUMLCu4jLtDoYmUtwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:22:31.136488Z"},"content_sha256":"3fd77d24e23042991e040f910cc5225169748a18727e336d79c4a6872b239f14","schema_version":"1.0","event_id":"sha256:3fd77d24e23042991e040f910cc5225169748a18727e336d79c4a6872b239f14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRNG3GD2D4R3ZWPAZIZX3UWA2T/bundle.json","state_url":"https://pith.science/pith/MRNG3GD2D4R3ZWPAZIZX3UWA2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRNG3GD2D4R3ZWPAZIZX3UWA2T/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-30T17:22:31Z","links":{"resolver":"https://pith.science/pith/MRNG3GD2D4R3ZWPAZIZX3UWA2T","bundle":"https://pith.science/pith/MRNG3GD2D4R3ZWPAZIZX3UWA2T/bundle.json","state":"https://pith.science/pith/MRNG3GD2D4R3ZWPAZIZX3UWA2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRNG3GD2D4R3ZWPAZIZX3UWA2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MRNG3GD2D4R3ZWPAZIZX3UWA2T","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":"21423e14f2d191f456196b61a8f090baab3a37dc93646488680d5e80ca82822c","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-02T03:51:39Z","title_canon_sha256":"8bcd0f6ea7e86cf906aa7a02b792e3c4d00c691e95b1899a638ac78a975d57ba"},"schema_version":"1.0","source":{"id":"1307.0585","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0585","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0585v2","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0585","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"MRNG3GD2D4R3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MRNG3GD2D4R3ZWPA","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MRNG3GD2","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:3fd77d24e23042991e040f910cc5225169748a18727e336d79c4a6872b239f14","target":"graph","created_at":"2026-05-18T03:11: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":"For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The framework considers both coordinated transmission (where devices are scheduled) and uncoordinated transmission (where devices communicate on a random access channel and a provision is made for retransmissions). Our main contribution is a novel characterization of the optimal throughput for the case of uncoordinated transmission and a strategy for achieving this th","authors_text":"Harish Viswanathan, Harpreet S. Dhillon, Howard C. Huang, Reinaldo A. Valenzuela","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-02T03:51:39Z","title":"Fundamentals of Throughput Maximization with Random Arrivals for M2M Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0585","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:0a5c647954cff72cbc1321eb268420bde8fdd3ff7bd10ccff9d26bd174aeb56b","target":"record","created_at":"2026-05-18T03:11: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":"21423e14f2d191f456196b61a8f090baab3a37dc93646488680d5e80ca82822c","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-02T03:51:39Z","title_canon_sha256":"8bcd0f6ea7e86cf906aa7a02b792e3c4d00c691e95b1899a638ac78a975d57ba"},"schema_version":"1.0","source":{"id":"1307.0585","kind":"arxiv","version":2}},"canonical_sha256":"645a6d987a1f23bcd9e0ca337dd2c0d4c747d2acd8a646b52d3eadea68f1dc17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"645a6d987a1f23bcd9e0ca337dd2c0d4c747d2acd8a646b52d3eadea68f1dc17","first_computed_at":"2026-05-18T03:11:33.093046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:33.093046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G+ANcNgjc3yJMgV4zXtWLH2Uf8Gphu6VQBNA2vFZDXVvQtWAmbwXvgJZgjoWpPy2vWZwxF0x51CLVugdZcmYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:33.093577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0585","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a5c647954cff72cbc1321eb268420bde8fdd3ff7bd10ccff9d26bd174aeb56b","sha256:3fd77d24e23042991e040f910cc5225169748a18727e336d79c4a6872b239f14"],"state_sha256":"29a9aa78df0c0f5c49df1db71d4b402c01d135843e12c8e46535e6c7a1946daa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfB2Z21+I2Dyasbt4e1SaGidSwzgQont0bQTj9WN26b0GtlYfZRxj0SpiHahBALGycCS5v5BlneQCuNZ2LdJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:22:31.138371Z","bundle_sha256":"57ba1919c7aabe42fca9a9d995eb58bee1a5a6ea0b9467a59400ebb55b3d89ec"}}