{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GSEOS2RFWOBY6JSDCRDKMP4UB6","short_pith_number":"pith:GSEOS2RF","canonical_record":{"source":{"id":"1711.04614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T15:04:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"336e36c0aa9e60b41580d43620b9846059e1d41b1fc3446c9bf46401521c3fbf","abstract_canon_sha256":"82a6c012cce8aef4ac8509ffd75cebebb5b2982cb28e919c2de0cf314b52cbfe"},"schema_version":"1.0"},"canonical_sha256":"3488e96a25b3838f26431446a63f940fb1035bf92b7f4b88d04ac1067f62b0ad","source":{"kind":"arxiv","id":"1711.04614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04614","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04614v1","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04614","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"GSEOS2RFWOBY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSEOS2RFWOBY6JSD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSEOS2RF","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GSEOS2RFWOBY6JSDCRDKMP4UB6","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T15:04:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"336e36c0aa9e60b41580d43620b9846059e1d41b1fc3446c9bf46401521c3fbf","abstract_canon_sha256":"82a6c012cce8aef4ac8509ffd75cebebb5b2982cb28e919c2de0cf314b52cbfe"},"schema_version":"1.0"},"canonical_sha256":"3488e96a25b3838f26431446a63f940fb1035bf92b7f4b88d04ac1067f62b0ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:36.134236Z","signature_b64":"xTVoIHvaFPk5JVWj53EpxUupPqvzo5U/shEhXwbjNso3YFAOQMV8/tMUBz4URLd9cRiEn9DYBgJfpAfGwPWRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3488e96a25b3838f26431446a63f940fb1035bf92b7f4b88d04ac1067f62b0ad","last_reissued_at":"2026-05-18T00:30:36.133484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:36.133484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04614","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:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5997eLsgkT1Ewv7beSG71/ITCLW4MmS2FrN6m9BiGX9DM+5BCDnJKOw6+2dJ3LzfatMLRmInT8EYOmWrwEMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:38:37.587661Z"},"content_sha256":"254c925f0a860175d260ecb26c49370b3ca893306a85908e448480fa9e76dc9b","schema_version":"1.0","event_id":"sha256:254c925f0a860175d260ecb26c49370b3ca893306a85908e448480fa9e76dc9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GSEOS2RFWOBY6JSDCRDKMP4UB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Preserving Reliability to Heterogeneous Ultra-Dense Distributed Networks in Unlicensed Spectrum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ping Zhang, Qimei Cui, Ren Ping Liu, Wei Ni, Xiaofeng Tao, Xuefei Zhang, Yu Gu","submitted_at":"2017-11-13T15:04:15Z","abstract_excerpt":"This article investigates the prominent dilemma between capacity and reliability in heterogeneous ultra-dense distributed networks, and advocates a new measure of effective capacity to quantify the maximum sustainable data rate of a link while preserving the quality-of-service (QoS) of the link in such networks. Recent breakthroughs are brought forth in developing the theory of the effective capacity in heterogeneous ultra-dense distributed networks. Potential applications of the effective capacity are demonstrated on the admission control, power control and resource allocation of such network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04614","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:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8t0e6ARpq/oPgxS+PdzVNemBIrxxLTin4/VhHtRhZoTiw6WwoySY8X7X+hDX8aNiMwGSsrS+9UayV87JXl5HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:38:37.588415Z"},"content_sha256":"2a07c25b23d9c265a14a5a69abc34411b2dc95c1b621d25a095a02bdbf659fb9","schema_version":"1.0","event_id":"sha256:2a07c25b23d9c265a14a5a69abc34411b2dc95c1b621d25a095a02bdbf659fb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSEOS2RFWOBY6JSDCRDKMP4UB6/bundle.json","state_url":"https://pith.science/pith/GSEOS2RFWOBY6JSDCRDKMP4UB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSEOS2RFWOBY6JSDCRDKMP4UB6/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-31T18:38:37Z","links":{"resolver":"https://pith.science/pith/GSEOS2RFWOBY6JSDCRDKMP4UB6","bundle":"https://pith.science/pith/GSEOS2RFWOBY6JSDCRDKMP4UB6/bundle.json","state":"https://pith.science/pith/GSEOS2RFWOBY6JSDCRDKMP4UB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSEOS2RFWOBY6JSDCRDKMP4UB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GSEOS2RFWOBY6JSDCRDKMP4UB6","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":"82a6c012cce8aef4ac8509ffd75cebebb5b2982cb28e919c2de0cf314b52cbfe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T15:04:15Z","title_canon_sha256":"336e36c0aa9e60b41580d43620b9846059e1d41b1fc3446c9bf46401521c3fbf"},"schema_version":"1.0","source":{"id":"1711.04614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04614","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04614v1","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04614","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"GSEOS2RFWOBY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSEOS2RFWOBY6JSD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSEOS2RF","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:2a07c25b23d9c265a14a5a69abc34411b2dc95c1b621d25a095a02bdbf659fb9","target":"graph","created_at":"2026-05-18T00:30:36Z","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":"This article investigates the prominent dilemma between capacity and reliability in heterogeneous ultra-dense distributed networks, and advocates a new measure of effective capacity to quantify the maximum sustainable data rate of a link while preserving the quality-of-service (QoS) of the link in such networks. Recent breakthroughs are brought forth in developing the theory of the effective capacity in heterogeneous ultra-dense distributed networks. Potential applications of the effective capacity are demonstrated on the admission control, power control and resource allocation of such network","authors_text":"Ping Zhang, Qimei Cui, Ren Ping Liu, Wei Ni, Xiaofeng Tao, Xuefei Zhang, Yu Gu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T15:04:15Z","title":"Preserving Reliability to Heterogeneous Ultra-Dense Distributed Networks in Unlicensed Spectrum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04614","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:254c925f0a860175d260ecb26c49370b3ca893306a85908e448480fa9e76dc9b","target":"record","created_at":"2026-05-18T00:30:36Z","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":"82a6c012cce8aef4ac8509ffd75cebebb5b2982cb28e919c2de0cf314b52cbfe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T15:04:15Z","title_canon_sha256":"336e36c0aa9e60b41580d43620b9846059e1d41b1fc3446c9bf46401521c3fbf"},"schema_version":"1.0","source":{"id":"1711.04614","kind":"arxiv","version":1}},"canonical_sha256":"3488e96a25b3838f26431446a63f940fb1035bf92b7f4b88d04ac1067f62b0ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3488e96a25b3838f26431446a63f940fb1035bf92b7f4b88d04ac1067f62b0ad","first_computed_at":"2026-05-18T00:30:36.133484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:36.133484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xTVoIHvaFPk5JVWj53EpxUupPqvzo5U/shEhXwbjNso3YFAOQMV8/tMUBz4URLd9cRiEn9DYBgJfpAfGwPWRCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:36.134236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:254c925f0a860175d260ecb26c49370b3ca893306a85908e448480fa9e76dc9b","sha256:2a07c25b23d9c265a14a5a69abc34411b2dc95c1b621d25a095a02bdbf659fb9"],"state_sha256":"6f8b359aa34abed2a0358119c123518fe59dc9675a34573c9faa150399215956"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8g5z9YM9Rp3UmLqohQuu1IQ/t0XVCzCB/8mxFW6e1tACN4nbRn+TXdjREfLQwlt5r9Sb2FU9lzzBZ77CPdxMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:38:37.592419Z","bundle_sha256":"6ce30c577c2ce96f7c312a57706dbf104937af2b3d6e737655098ffbc7849078"}}