{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YPLQGQHBRIO34RIFN36TJY2T3M","short_pith_number":"pith:YPLQGQHB","schema_version":"1.0","canonical_sha256":"c3d70340e18a1dbe45056efd34e353db0939c268928e576a4b25823744698c94","source":{"kind":"arxiv","id":"1811.11649","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria Nosratinia, Matthieu Bloch, Noha Helal","submitted_at":"2018-11-28T16:15:06Z","abstract_excerpt":"We study channel resolvability for the discrete memoryless multiple-access channel with cribbing, i.e., the characterization of the amount of randomness required at the inputs to approximately produce a chosen i.i.d. output distribution according to KL divergence. We analyze resolvability rates when one encoder cribs (i) the input of the other encoder; or the output of the other encoder, (ii) non-causally, (iii) causally, or (iv) strictly-causally. For scenarios (i)-(iii), we exactly characterize the channel resolvability region. For (iv), we provide inner and outer bounds for the channel reso"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.11649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-28T16:15:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2021adaf6946baf2245fefe535fdb9c5b3dfe2c59a765e3075e05a5cb344ce2b","abstract_canon_sha256":"8f9617d12dc23d4745e2bdcdb3944c5f4da14e2fbb65ef821f421b557397a9a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:40.420642Z","signature_b64":"AwrnqQobOL6N014/mImzZXgu+bk7EIMIOTGG9LTUbEWMm1/FwJ2gVnS2mvVbAdARCmuvKFvgE/G4+3VSdOngAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3d70340e18a1dbe45056efd34e353db0939c268928e576a4b25823744698c94","last_reissued_at":"2026-05-17T23:59:40.419947Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:40.419947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria Nosratinia, Matthieu Bloch, Noha Helal","submitted_at":"2018-11-28T16:15:06Z","abstract_excerpt":"We study channel resolvability for the discrete memoryless multiple-access channel with cribbing, i.e., the characterization of the amount of randomness required at the inputs to approximately produce a chosen i.i.d. output distribution according to KL divergence. We analyze resolvability rates when one encoder cribs (i) the input of the other encoder; or the output of the other encoder, (ii) non-causally, (iii) causally, or (iv) strictly-causally. For scenarios (i)-(iii), we exactly characterize the channel resolvability region. For (iv), we provide inner and outer bounds for the channel reso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11649","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.11649","created_at":"2026-05-17T23:59:40.420060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11649v1","created_at":"2026-05-17T23:59:40.420060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11649","created_at":"2026-05-17T23:59:40.420060+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPLQGQHBRIO3","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPLQGQHBRIO34RIF","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPLQGQHB","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M","json":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M.json","graph_json":"https://pith.science/api/pith-number/YPLQGQHBRIO34RIFN36TJY2T3M/graph.json","events_json":"https://pith.science/api/pith-number/YPLQGQHBRIO34RIFN36TJY2T3M/events.json","paper":"https://pith.science/paper/YPLQGQHB"},"agent_actions":{"view_html":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M","download_json":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M.json","view_paper":"https://pith.science/paper/YPLQGQHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11649&json=true","fetch_graph":"https://pith.science/api/pith-number/YPLQGQHBRIO34RIFN36TJY2T3M/graph.json","fetch_events":"https://pith.science/api/pith-number/YPLQGQHBRIO34RIFN36TJY2T3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/action/storage_attestation","attest_author":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/action/author_attestation","sign_citation":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/action/citation_signature","submit_replication":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/action/replication_record"}},"created_at":"2026-05-17T23:59:40.420060+00:00","updated_at":"2026-05-17T23:59:40.420060+00:00"}