{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V76APVBDU6EIUPGK4YVA5FMPKP","short_pith_number":"pith:V76APVBD","canonical_record":{"source":{"id":"1711.07771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T13:25:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a0ca742f109295ab63ac2f903270c30d4649b5fc5c800c83807e395e1a525ed","abstract_canon_sha256":"e5abd029536ea0824eae28e8fefd215f0a61e22e9dbb16faca0ee1f5e21eadb8"},"schema_version":"1.0"},"canonical_sha256":"affc07d423a7888a3ccae62a0e958f53f716f0d4a5c5f55445844242af5871ba","source":{"kind":"arxiv","id":"1711.07771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07771","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07771v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07771","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"V76APVBDU6EI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V76APVBDU6EIUPGK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V76APVBD","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V76APVBDU6EIUPGK4YVA5FMPKP","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T13:25:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a0ca742f109295ab63ac2f903270c30d4649b5fc5c800c83807e395e1a525ed","abstract_canon_sha256":"e5abd029536ea0824eae28e8fefd215f0a61e22e9dbb16faca0ee1f5e21eadb8"},"schema_version":"1.0"},"canonical_sha256":"affc07d423a7888a3ccae62a0e958f53f716f0d4a5c5f55445844242af5871ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.539643Z","signature_b64":"5oqYE+qjvKVZQdNdyctDGsp0Tyy57/lOMHfZ+NfBLCgXRg3ynTa76EeWXViaTmzgoZK4B/uXbUOw4ry78BLpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"affc07d423a7888a3ccae62a0e958f53f716f0d4a5c5f55445844242af5871ba","last_reissued_at":"2026-05-18T00:29:56.539266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.539266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07771","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:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gb5XTf0RBjtfGbXvW2XxwhhlRW/H4M2ZRl8Dz1Olcln7cy22BESKnGOKVW/k4dI09QdMgmR56o6VlhCdc+rmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:48:08.962184Z"},"content_sha256":"a09bec017be160a54835a89d4fe5b872794a78f454cae05352ec561bff559611","schema_version":"1.0","event_id":"sha256:a09bec017be160a54835a89d4fe5b872794a78f454cae05352ec561bff559611"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V76APVBDU6EIUPGK4YVA5FMPKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ultra-Reliable Low Latency Communication (URLLC) using Interface Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jimmy J. Nielsen, Petar Popovski, Rongkuan Liu","submitted_at":"2017-11-21T13:25:56Z","abstract_excerpt":"An important ingredient of the future 5G systems will be Ultra-Reliable Low-Latency Communication (URLLC). A way to offer URLLC without intervention in the baseband/PHY layer design is to use interface diversity and integrate multiple communication interfaces, each interface based on a different technology. In this work, we propose to use coding to seamlessly distribute coded payload and redundancy data across multiple available communication interfaces. We formulate an optimization problem to find the payload allocation weights that maximize the reliability at specific target latency values. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07771","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:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OKACS2wI9q4ssby1KnnrtIKX1ZplSoXoGBu+o5IIWQuCfi9nbbcwaoGBUN+xKf1kgRYeEzNTtNdNQsNPPt2iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:48:08.962930Z"},"content_sha256":"0b1f0b8cd09e69a7b93643c4c90ee90e01b5b4372af8a8f656a35ae0c90c3c2c","schema_version":"1.0","event_id":"sha256:0b1f0b8cd09e69a7b93643c4c90ee90e01b5b4372af8a8f656a35ae0c90c3c2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V76APVBDU6EIUPGK4YVA5FMPKP/bundle.json","state_url":"https://pith.science/pith/V76APVBDU6EIUPGK4YVA5FMPKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V76APVBDU6EIUPGK4YVA5FMPKP/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-25T18:48:08Z","links":{"resolver":"https://pith.science/pith/V76APVBDU6EIUPGK4YVA5FMPKP","bundle":"https://pith.science/pith/V76APVBDU6EIUPGK4YVA5FMPKP/bundle.json","state":"https://pith.science/pith/V76APVBDU6EIUPGK4YVA5FMPKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V76APVBDU6EIUPGK4YVA5FMPKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V76APVBDU6EIUPGK4YVA5FMPKP","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":"e5abd029536ea0824eae28e8fefd215f0a61e22e9dbb16faca0ee1f5e21eadb8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T13:25:56Z","title_canon_sha256":"1a0ca742f109295ab63ac2f903270c30d4649b5fc5c800c83807e395e1a525ed"},"schema_version":"1.0","source":{"id":"1711.07771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07771","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07771v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07771","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"V76APVBDU6EI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V76APVBDU6EIUPGK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V76APVBD","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:0b1f0b8cd09e69a7b93643c4c90ee90e01b5b4372af8a8f656a35ae0c90c3c2c","target":"graph","created_at":"2026-05-18T00:29:56Z","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":"An important ingredient of the future 5G systems will be Ultra-Reliable Low-Latency Communication (URLLC). A way to offer URLLC without intervention in the baseband/PHY layer design is to use interface diversity and integrate multiple communication interfaces, each interface based on a different technology. In this work, we propose to use coding to seamlessly distribute coded payload and redundancy data across multiple available communication interfaces. We formulate an optimization problem to find the payload allocation weights that maximize the reliability at specific target latency values. ","authors_text":"Jimmy J. Nielsen, Petar Popovski, Rongkuan Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T13:25:56Z","title":"Ultra-Reliable Low Latency Communication (URLLC) using Interface Diversity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07771","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:a09bec017be160a54835a89d4fe5b872794a78f454cae05352ec561bff559611","target":"record","created_at":"2026-05-18T00:29:56Z","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":"e5abd029536ea0824eae28e8fefd215f0a61e22e9dbb16faca0ee1f5e21eadb8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T13:25:56Z","title_canon_sha256":"1a0ca742f109295ab63ac2f903270c30d4649b5fc5c800c83807e395e1a525ed"},"schema_version":"1.0","source":{"id":"1711.07771","kind":"arxiv","version":1}},"canonical_sha256":"affc07d423a7888a3ccae62a0e958f53f716f0d4a5c5f55445844242af5871ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"affc07d423a7888a3ccae62a0e958f53f716f0d4a5c5f55445844242af5871ba","first_computed_at":"2026-05-18T00:29:56.539266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:56.539266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5oqYE+qjvKVZQdNdyctDGsp0Tyy57/lOMHfZ+NfBLCgXRg3ynTa76EeWXViaTmzgoZK4B/uXbUOw4ry78BLpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:56.539643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a09bec017be160a54835a89d4fe5b872794a78f454cae05352ec561bff559611","sha256:0b1f0b8cd09e69a7b93643c4c90ee90e01b5b4372af8a8f656a35ae0c90c3c2c"],"state_sha256":"a9326bdd6833b668384de213b524877738d807cf5a4009e9fc6cf3c0076f078e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWa3J/o8y4yg6Aqebb+puBkg6rmH347dMgCeapccTc83jNOd4juQPOnhLr9KOKA5adYZ1sSjy71OhpvTd02/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:48:08.966420Z","bundle_sha256":"fbd4c43af93d389a537c58db09d7adc3492b39330c3b028d2631d3629a4beba2"}}