{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IYU3WEYYLG5E3WGO5ACDQQICMZ","short_pith_number":"pith:IYU3WEYY","canonical_record":{"source":{"id":"1410.7174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-27T10:31:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"257f0a2136d4cbe5207dba07bed8a47d95bd9b85e9402f7fedc3d558d2399d1b","abstract_canon_sha256":"5f0f9563c0868e8adf27696dae11c62fe17b8d0a879057cf2c6fd38de8afb9a1"},"schema_version":"1.0"},"canonical_sha256":"4629bb131859ba4dd8cee804384102665ced38b1e06071b4976707a3fb47f1c3","source":{"kind":"arxiv","id":"1410.7174","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7174","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7174v1","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7174","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"IYU3WEYYLG5E","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IYU3WEYYLG5E3WGO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IYU3WEYY","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IYU3WEYYLG5E3WGO5ACDQQICMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-27T10:31:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"257f0a2136d4cbe5207dba07bed8a47d95bd9b85e9402f7fedc3d558d2399d1b","abstract_canon_sha256":"5f0f9563c0868e8adf27696dae11c62fe17b8d0a879057cf2c6fd38de8afb9a1"},"schema_version":"1.0"},"canonical_sha256":"4629bb131859ba4dd8cee804384102665ced38b1e06071b4976707a3fb47f1c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.524116Z","signature_b64":"sbX0uskr+k+G/EON22rklqVTrqCWPx2Ns/FkAGxGx/2Ka4LYmfS1lId2Ffana129LgbWlq1APe327ztvyovvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4629bb131859ba4dd8cee804384102665ced38b1e06071b4976707a3fb47f1c3","last_reissued_at":"2026-05-18T00:58:36.523343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.523343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7174","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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sU44p6r34rm2GOkP+bl+2mYibnD7iM6boOYYdYUUAacKIcTOxNfiJ/c/AP9L3e76HUgx392uligekWCEYUvWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:57:35.833001Z"},"content_sha256":"4f57c64eada53fb3df3f37a4190d0373a80e74ad9dff8c3638cef96da72fb57d","schema_version":"1.0","event_id":"sha256:4f57c64eada53fb3df3f37a4190d0373a80e74ad9dff8c3638cef96da72fb57d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IYU3WEYYLG5E3WGO5ACDQQICMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Approximate Optimality of Simple Schedules for Half-Duplex Multi-Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Martina Cardone, Raymond Knopp","submitted_at":"2014-10-27T10:31:26Z","abstract_excerpt":"In ISIT'12 Brahma, \\\"{O}zg\\\"{u}r and Fragouli conjectured that in a half-duplex diamond relay network (a Gaussian noise network without a direct source-destination link and with $N$ non-interfering relays) an approximately optimal relay scheduling (achieving the cut-set upper bound to within a constant gap uniformly over all channel gains) exists with at most $N+1$ active states (only $N+1$ out of the $2^N$ possible relay listen-transmit configurations have a strictly positive probability). Such relay scheduling policies are said to be simple. In ITW'13 we conjectured that simple relay policie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7174","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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VS9+Mk94TkD60l459Q/YxNZlBnFjWFh+d5yNAsO//uAEmHn9r9zOkcfH2lCpc5Ws8hW2AL32nGY611k7aepMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:57:35.833756Z"},"content_sha256":"da301e128125f2a453517b60824e084444b15391d4f54bb2524653722f7f1611","schema_version":"1.0","event_id":"sha256:da301e128125f2a453517b60824e084444b15391d4f54bb2524653722f7f1611"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/bundle.json","state_url":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/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-08T07:57:35Z","links":{"resolver":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ","bundle":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/bundle.json","state":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IYU3WEYYLG5E3WGO5ACDQQICMZ","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":"5f0f9563c0868e8adf27696dae11c62fe17b8d0a879057cf2c6fd38de8afb9a1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-27T10:31:26Z","title_canon_sha256":"257f0a2136d4cbe5207dba07bed8a47d95bd9b85e9402f7fedc3d558d2399d1b"},"schema_version":"1.0","source":{"id":"1410.7174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7174","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7174v1","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7174","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"IYU3WEYYLG5E","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IYU3WEYYLG5E3WGO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IYU3WEYY","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:da301e128125f2a453517b60824e084444b15391d4f54bb2524653722f7f1611","target":"graph","created_at":"2026-05-18T00:58: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":"In ISIT'12 Brahma, \\\"{O}zg\\\"{u}r and Fragouli conjectured that in a half-duplex diamond relay network (a Gaussian noise network without a direct source-destination link and with $N$ non-interfering relays) an approximately optimal relay scheduling (achieving the cut-set upper bound to within a constant gap uniformly over all channel gains) exists with at most $N+1$ active states (only $N+1$ out of the $2^N$ possible relay listen-transmit configurations have a strictly positive probability). Such relay scheduling policies are said to be simple. In ITW'13 we conjectured that simple relay policie","authors_text":"Daniela Tuninetti, Martina Cardone, Raymond Knopp","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-27T10:31:26Z","title":"The Approximate Optimality of Simple Schedules for Half-Duplex Multi-Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7174","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:4f57c64eada53fb3df3f37a4190d0373a80e74ad9dff8c3638cef96da72fb57d","target":"record","created_at":"2026-05-18T00:58: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":"5f0f9563c0868e8adf27696dae11c62fe17b8d0a879057cf2c6fd38de8afb9a1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-27T10:31:26Z","title_canon_sha256":"257f0a2136d4cbe5207dba07bed8a47d95bd9b85e9402f7fedc3d558d2399d1b"},"schema_version":"1.0","source":{"id":"1410.7174","kind":"arxiv","version":1}},"canonical_sha256":"4629bb131859ba4dd8cee804384102665ced38b1e06071b4976707a3fb47f1c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4629bb131859ba4dd8cee804384102665ced38b1e06071b4976707a3fb47f1c3","first_computed_at":"2026-05-18T00:58:36.523343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:36.523343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sbX0uskr+k+G/EON22rklqVTrqCWPx2Ns/FkAGxGx/2Ka4LYmfS1lId2Ffana129LgbWlq1APe327ztvyovvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:36.524116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f57c64eada53fb3df3f37a4190d0373a80e74ad9dff8c3638cef96da72fb57d","sha256:da301e128125f2a453517b60824e084444b15391d4f54bb2524653722f7f1611"],"state_sha256":"5a412030dad6eb02f1174c93aafe6f59d222777ccfa77bbe4a608e7231171d6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQmQKYVEVdyys2RC1zXfv3YSEivXXOx3fcEsD7D4mG1xd/NvNzfRxXujbZFzf047S46bi6CQ9kCp53o6vq7LBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T07:57:35.839385Z","bundle_sha256":"15e7bd4da0e7f678dfc53ee08d51ddcbabb0acfa63d2d84956534e2cc695a159"}}