{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FL3PZQCLVHUBEB3QKM4A6HR2F6","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":"b08e58fd1aa39f89fec2d27abb357912f6cffdbeeb66e89d3e789f2938a60c1b","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-09T08:30:29Z","title_canon_sha256":"4c4a7fbff6ac0e69d9d7aaf1f2164c46cd71e1cfd1fc6504893e9910a7124c55"},"schema_version":"1.0","source":{"id":"2310.05515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.05515","created_at":"2026-07-05T09:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"2310.05515v2","created_at":"2026-07-05T09:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.05515","created_at":"2026-07-05T09:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"FL3PZQCLVHUB","created_at":"2026-07-05T09:45:41Z"},{"alias_kind":"pith_short_16","alias_value":"FL3PZQCLVHUBEB3Q","created_at":"2026-07-05T09:45:41Z"},{"alias_kind":"pith_short_8","alias_value":"FL3PZQCL","created_at":"2026-07-05T09:45:41Z"}],"graph_snapshots":[{"event_id":"sha256:64bb90c0e8fdc29716a198e7f65fdd10eb5c3804af7da3f3ffb05e1933a617f1","target":"graph","created_at":"2026-07-05T09:45:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.05515/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the problem of coding for classical broadcast channels, which entails maximizing the success probability that can be achieved by sending a fixed number of messages over a broadcast channel. For point-to-point channels, Barman and Fawzi found in~\\cite{BF18} a $(1-e^{-1})$-approximation algorithm running in polynomial time, and showed that it is \\textrm{NP}-hard to achieve a strictly better approximation ratio. Furthermore, these algorithmic results were at the core of the limitations they established on the power of non-signaling assistance for point-to-point channels. It is natural ","authors_text":"Omar Fawzi, Paul Ferm\\'e","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-09T08:30:29Z","title":"Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.05515","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:65d86ff20f7b1e66ac2d2c0ef37d649e8d47fdac493ab68938b75534642f05ae","target":"record","created_at":"2026-07-05T09:45:41Z","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":"b08e58fd1aa39f89fec2d27abb357912f6cffdbeeb66e89d3e789f2938a60c1b","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-09T08:30:29Z","title_canon_sha256":"4c4a7fbff6ac0e69d9d7aaf1f2164c46cd71e1cfd1fc6504893e9910a7124c55"},"schema_version":"1.0","source":{"id":"2310.05515","kind":"arxiv","version":2}},"canonical_sha256":"2af6fcc04ba9e812077053380f1e3a2fa90ed2581a5cdd4fab0a0ee78b95303b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2af6fcc04ba9e812077053380f1e3a2fa90ed2581a5cdd4fab0a0ee78b95303b","first_computed_at":"2026-07-05T09:45:41.397384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:45:41.397384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p20BGRUo9R+cugwcaN1va0fQorfLIqliZenI0Xipe/fb9M4YdswHOPLRqBGee7GSTNTkJ0MZVD9Z/t+JjavACQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:45:41.397795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.05515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65d86ff20f7b1e66ac2d2c0ef37d649e8d47fdac493ab68938b75534642f05ae","sha256:64bb90c0e8fdc29716a198e7f65fdd10eb5c3804af7da3f3ffb05e1933a617f1"],"state_sha256":"b2d7bf4e22d221619478a2fdacce75c87eaa98376a91d7a76742ceb3f463f862"}