{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:X5KZEZA466LMC4HYYYHDPGVISJ","short_pith_number":"pith:X5KZEZA4","canonical_record":{"source":{"id":"1510.03505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T01:49:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"29006514780af6e8e11330a55a991eb7ad30fdb3a94b31dda68a425127d6123f","abstract_canon_sha256":"80f925c26ff15baba0c23b7d1f41aa33f7047b72a380b630724239d2f3bd7ae8"},"schema_version":"1.0"},"canonical_sha256":"bf5592641cf796c170f8c60e379aa8926a453846ad7cb780e0906b56ce0bd620","source":{"kind":"arxiv","id":"1510.03505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03505","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03505v1","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03505","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"X5KZEZA466LM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X5KZEZA466LMC4HY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X5KZEZA4","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:X5KZEZA466LMC4HYYYHDPGVISJ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T01:49:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"29006514780af6e8e11330a55a991eb7ad30fdb3a94b31dda68a425127d6123f","abstract_canon_sha256":"80f925c26ff15baba0c23b7d1f41aa33f7047b72a380b630724239d2f3bd7ae8"},"schema_version":"1.0"},"canonical_sha256":"bf5592641cf796c170f8c60e379aa8926a453846ad7cb780e0906b56ce0bd620","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:16.994116Z","signature_b64":"EvrcS/qC5JI/wzPcIATSCvwfA2kxXFacsKUIcANYw3VVywr2qUfzF+WUZtqtlw3mbcL8WAaEhuODcf+EU2UuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf5592641cf796c170f8c60e379aa8926a453846ad7cb780e0906b56ce0bd620","last_reissued_at":"2026-05-18T01:30:16.993545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:16.993545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03505","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-18T01:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iTcsqGhc21iAW2BgbVoIqsuu/WtbfdkjPhw4Y6yffatIdcPajZaiWrsYjP7FST/RW/v8zn8+SYWmiClzUeBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:04:44.785604Z"},"content_sha256":"c2089cde636c7f003de79e05c7fcebaf7b89b721f5a38925bd343b43f1387ec2","schema_version":"1.0","event_id":"sha256:c2089cde636c7f003de79e05c7fcebaf7b89b721f5a38925bd343b43f1387ec2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:X5KZEZA466LMC4HYYYHDPGVISJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Capacity of Buffer-Aided Full-Duplex Relay Systems with Selection Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Deli Qiao","submitted_at":"2015-10-13T01:49:10Z","abstract_excerpt":"In this work, the achievable rate of three-node relay systems with selection relaying under statistical delay constraints, imposed on the limitations of the maximum end-to-end delay violation probabilities, is investigated. It is assumed that there are queues of infinite size at both the source and relay node, and the source can select the relay or destination for data reception. Given selection relaying policy, the effective bandwidth of the arrival processes of the queue at the relay is derived. Then, the maximum constant arrival rate can be identified as the maximum effective capacity as a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03505","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-18T01:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdoL5vkpBYq6hg+h25Zu8eATTnRnk+ULj5hbZVZk6KNdUkJwaCGWjt94+cgjb1G87YV0gBosAGq7vlLEDTNmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:04:44.785952Z"},"content_sha256":"9722d8eac5d68c8b0347ad89a6c91c9d813a68c7abaa906f3584283a94a6a2a6","schema_version":"1.0","event_id":"sha256:9722d8eac5d68c8b0347ad89a6c91c9d813a68c7abaa906f3584283a94a6a2a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5KZEZA466LMC4HYYYHDPGVISJ/bundle.json","state_url":"https://pith.science/pith/X5KZEZA466LMC4HYYYHDPGVISJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5KZEZA466LMC4HYYYHDPGVISJ/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-22T11:04:44Z","links":{"resolver":"https://pith.science/pith/X5KZEZA466LMC4HYYYHDPGVISJ","bundle":"https://pith.science/pith/X5KZEZA466LMC4HYYYHDPGVISJ/bundle.json","state":"https://pith.science/pith/X5KZEZA466LMC4HYYYHDPGVISJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5KZEZA466LMC4HYYYHDPGVISJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:X5KZEZA466LMC4HYYYHDPGVISJ","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":"80f925c26ff15baba0c23b7d1f41aa33f7047b72a380b630724239d2f3bd7ae8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T01:49:10Z","title_canon_sha256":"29006514780af6e8e11330a55a991eb7ad30fdb3a94b31dda68a425127d6123f"},"schema_version":"1.0","source":{"id":"1510.03505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03505","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03505v1","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03505","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"X5KZEZA466LM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X5KZEZA466LMC4HY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X5KZEZA4","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:9722d8eac5d68c8b0347ad89a6c91c9d813a68c7abaa906f3584283a94a6a2a6","target":"graph","created_at":"2026-05-18T01:30:16Z","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":"In this work, the achievable rate of three-node relay systems with selection relaying under statistical delay constraints, imposed on the limitations of the maximum end-to-end delay violation probabilities, is investigated. It is assumed that there are queues of infinite size at both the source and relay node, and the source can select the relay or destination for data reception. Given selection relaying policy, the effective bandwidth of the arrival processes of the queue at the relay is derived. Then, the maximum constant arrival rate can be identified as the maximum effective capacity as a ","authors_text":"Deli Qiao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T01:49:10Z","title":"Effective Capacity of Buffer-Aided Full-Duplex Relay Systems with Selection Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03505","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:c2089cde636c7f003de79e05c7fcebaf7b89b721f5a38925bd343b43f1387ec2","target":"record","created_at":"2026-05-18T01:30:16Z","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":"80f925c26ff15baba0c23b7d1f41aa33f7047b72a380b630724239d2f3bd7ae8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T01:49:10Z","title_canon_sha256":"29006514780af6e8e11330a55a991eb7ad30fdb3a94b31dda68a425127d6123f"},"schema_version":"1.0","source":{"id":"1510.03505","kind":"arxiv","version":1}},"canonical_sha256":"bf5592641cf796c170f8c60e379aa8926a453846ad7cb780e0906b56ce0bd620","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf5592641cf796c170f8c60e379aa8926a453846ad7cb780e0906b56ce0bd620","first_computed_at":"2026-05-18T01:30:16.993545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:16.993545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EvrcS/qC5JI/wzPcIATSCvwfA2kxXFacsKUIcANYw3VVywr2qUfzF+WUZtqtlw3mbcL8WAaEhuODcf+EU2UuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:16.994116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2089cde636c7f003de79e05c7fcebaf7b89b721f5a38925bd343b43f1387ec2","sha256:9722d8eac5d68c8b0347ad89a6c91c9d813a68c7abaa906f3584283a94a6a2a6"],"state_sha256":"1a810874a343005fc354ccbd3f48cc880a9549e0d7f33bcf30c8caa4a6d66742"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GuMEXTk3xoBzBEhh5FNKe4hWhePD3BLavSfRf19uKP0r4V7o9AHFBGCANEF6QKOUkbOe6d2PtZ50O/OizOfXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:04:44.787915Z","bundle_sha256":"d21f3ea0a6e8b1307cc23ceda603c75dda7d744d4cd471639ae03dc183934dab"}}