{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YPLQGQHBRIO34RIFN36TJY2T3M","short_pith_number":"pith:YPLQGQHB","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"},"canonical_sha256":"c3d70340e18a1dbe45056efd34e353db0939c268928e576a4b25823744698c94","source":{"kind":"arxiv","id":"1811.11649","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11649","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11649v1","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11649","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"YPLQGQHBRIO3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YPLQGQHBRIO34RIF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YPLQGQHB","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YPLQGQHBRIO34RIFN36TJY2T3M","target":"record","payload":{"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"},"canonical_sha256":"c3d70340e18a1dbe45056efd34e353db0939c268928e576a4b25823744698c94","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"},"source_kind":"arxiv","source_id":"1811.11649","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-17T23:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDtsmwQjng/dvWL8Rb1K+hviBqZ6Ifv0VSsPnZb8Bji+iHBpuojzfgZFLQiE4hOPxBXkcWf92AnGAhrDeTquBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:46:01.968371Z"},"content_sha256":"408834f0ff1f946ae166c02d9725a1ddd07e65b49dfd5d1642d78860dc4f9808","schema_version":"1.0","event_id":"sha256:408834f0ff1f946ae166c02d9725a1ddd07e65b49dfd5d1642d78860dc4f9808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YPLQGQHBRIO34RIFN36TJY2T3M","target":"graph","payload":{"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"},"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-17T23:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WNrPuFcF7+UA/RpMb4bcBfuvJfO9+4hqFiH9yycfNlYVbTc1I+wK84NF0cJ2wwb5x/aGLfNMYW30VyAxobPTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:46:01.968772Z"},"content_sha256":"e74c6cbe594c20f89263608e7d388135194068b8ffca586d66ef8ca360107f0c","schema_version":"1.0","event_id":"sha256:e74c6cbe594c20f89263608e7d388135194068b8ffca586d66ef8ca360107f0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/bundle.json","state_url":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPLQGQHBRIO34RIFN36TJY2T3M/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-27T00:46:01Z","links":{"resolver":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M","bundle":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/bundle.json","state":"https://pith.science/pith/YPLQGQHBRIO34RIFN36TJY2T3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPLQGQHBRIO34RIFN36TJY2T3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YPLQGQHBRIO34RIFN36TJY2T3M","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":"8f9617d12dc23d4745e2bdcdb3944c5f4da14e2fbb65ef821f421b557397a9a8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-28T16:15:06Z","title_canon_sha256":"2021adaf6946baf2245fefe535fdb9c5b3dfe2c59a765e3075e05a5cb344ce2b"},"schema_version":"1.0","source":{"id":"1811.11649","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11649","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11649v1","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11649","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"YPLQGQHBRIO3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YPLQGQHBRIO34RIF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YPLQGQHB","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:e74c6cbe594c20f89263608e7d388135194068b8ffca586d66ef8ca360107f0c","target":"graph","created_at":"2026-05-17T23:59:40Z","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":"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","authors_text":"Aria Nosratinia, Matthieu Bloch, Noha Helal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-28T16:15:06Z","title":"Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11649","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:408834f0ff1f946ae166c02d9725a1ddd07e65b49dfd5d1642d78860dc4f9808","target":"record","created_at":"2026-05-17T23:59:40Z","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":"8f9617d12dc23d4745e2bdcdb3944c5f4da14e2fbb65ef821f421b557397a9a8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-28T16:15:06Z","title_canon_sha256":"2021adaf6946baf2245fefe535fdb9c5b3dfe2c59a765e3075e05a5cb344ce2b"},"schema_version":"1.0","source":{"id":"1811.11649","kind":"arxiv","version":1}},"canonical_sha256":"c3d70340e18a1dbe45056efd34e353db0939c268928e576a4b25823744698c94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3d70340e18a1dbe45056efd34e353db0939c268928e576a4b25823744698c94","first_computed_at":"2026-05-17T23:59:40.419947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:40.419947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AwrnqQobOL6N014/mImzZXgu+bk7EIMIOTGG9LTUbEWMm1/FwJ2gVnS2mvVbAdARCmuvKFvgE/G4+3VSdOngAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:40.420642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11649","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:408834f0ff1f946ae166c02d9725a1ddd07e65b49dfd5d1642d78860dc4f9808","sha256:e74c6cbe594c20f89263608e7d388135194068b8ffca586d66ef8ca360107f0c"],"state_sha256":"bd52ee760c4ddffb0e3d14c2a1ef54e95b8eb02ac23eda7699ab8b3b48558d01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHVHYMPhzqXoDI0SxB4dTATpmQDWYSmIs2A2R2bhBw30/9yBfT7FRX0MP6RyTXAUh4+bVltdlDYEAOoQ3gDcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T00:46:01.970561Z","bundle_sha256":"957324e0f4f7c8953f3c0d785356db7917f34dded9ad2584442bf24e420d5cd8"}}