{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4PSDBXUTDYHQICAPNJ3W7LKMBJ","short_pith_number":"pith:4PSDBXUT","canonical_record":{"source":{"id":"1203.0730","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-04T11:12:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"416479d5c3d4facaf8e47b633bf674b4d001f1f8ab528351d5fff98f6f8dfa76","abstract_canon_sha256":"becfae27bd765074d571afa2b2d502a6f0fd5fd0893c948c24024306dee46817"},"schema_version":"1.0"},"canonical_sha256":"e3e430de931e0f04080f6a776fad4c0a7c15711af61ba4bcf59fc35a5878ce66","source":{"kind":"arxiv","id":"1203.0730","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0730","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0730v3","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0730","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"4PSDBXUTDYHQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4PSDBXUTDYHQICAP","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4PSDBXUT","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4PSDBXUTDYHQICAPNJ3W7LKMBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0730","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-04T11:12:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"416479d5c3d4facaf8e47b633bf674b4d001f1f8ab528351d5fff98f6f8dfa76","abstract_canon_sha256":"becfae27bd765074d571afa2b2d502a6f0fd5fd0893c948c24024306dee46817"},"schema_version":"1.0"},"canonical_sha256":"e3e430de931e0f04080f6a776fad4c0a7c15711af61ba4bcf59fc35a5878ce66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:40.590178Z","signature_b64":"FQkQSuLGOOvxyEhrcdw16naen0f2OsTg33gvVbs46NnbbZK7UtHqC9XCuPexJD6YvOB3hp2UvfLAAP1PsEclCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3e430de931e0f04080f6a776fad4c0a7c15711af61ba4bcf59fc35a5878ce66","last_reissued_at":"2026-05-18T02:44:40.589487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:40.589487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0730","source_version":3,"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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioGmZkiFysS0gSxSO6kOx5CgDAAL20yLR88nwBQbfQLP6o3ilRCVTS2k3VDtFgKZGQhzhzGDDrNy1ciQNA2uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:25:08.453445Z"},"content_sha256":"eb06934850a6e6b379d9dd84a21a69b658e3fa41c6fb46b8b2af8c4ddf4be194","schema_version":"1.0","event_id":"sha256:eb06934850a6e6b379d9dd84a21a69b658e3fa41c6fb46b8b2af8c4ddf4be194"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4PSDBXUTDYHQICAPNJ3W7LKMBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievability proof via output statistics of random binning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Gohari, Mohammad Hossein Yassaee, Mohammad Reza Aref","submitted_at":"2012-03-04T11:12:48Z","abstract_excerpt":"This paper introduces a new and ubiquitous framework for establishing achievability results in \\emph{network information theory} (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. {Further,} the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and \\emph{strong} secrecy problems where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eaves"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0730","kind":"arxiv","version":3},"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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aawi7JY9m8HPQpat+SpRTWxTAiLSygvH1bYoxw/wipbIavHYIrgBlCvOmrog++7cpfb8r5dwIDrorGdsoTsXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:25:08.453773Z"},"content_sha256":"e5093e3219e56d48a03645a61992d92b8c94a84a5fda0689b91ad35e6ee968a6","schema_version":"1.0","event_id":"sha256:e5093e3219e56d48a03645a61992d92b8c94a84a5fda0689b91ad35e6ee968a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PSDBXUTDYHQICAPNJ3W7LKMBJ/bundle.json","state_url":"https://pith.science/pith/4PSDBXUTDYHQICAPNJ3W7LKMBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PSDBXUTDYHQICAPNJ3W7LKMBJ/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-03T11:25:08Z","links":{"resolver":"https://pith.science/pith/4PSDBXUTDYHQICAPNJ3W7LKMBJ","bundle":"https://pith.science/pith/4PSDBXUTDYHQICAPNJ3W7LKMBJ/bundle.json","state":"https://pith.science/pith/4PSDBXUTDYHQICAPNJ3W7LKMBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PSDBXUTDYHQICAPNJ3W7LKMBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4PSDBXUTDYHQICAPNJ3W7LKMBJ","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":"becfae27bd765074d571afa2b2d502a6f0fd5fd0893c948c24024306dee46817","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-04T11:12:48Z","title_canon_sha256":"416479d5c3d4facaf8e47b633bf674b4d001f1f8ab528351d5fff98f6f8dfa76"},"schema_version":"1.0","source":{"id":"1203.0730","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0730","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0730v3","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0730","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"4PSDBXUTDYHQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4PSDBXUTDYHQICAP","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4PSDBXUT","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:e5093e3219e56d48a03645a61992d92b8c94a84a5fda0689b91ad35e6ee968a6","target":"graph","created_at":"2026-05-18T02:44: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":"This paper introduces a new and ubiquitous framework for establishing achievability results in \\emph{network information theory} (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. {Further,} the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and \\emph{strong} secrecy problems where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eaves","authors_text":"Amin Gohari, Mohammad Hossein Yassaee, Mohammad Reza Aref","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-04T11:12:48Z","title":"Achievability proof via output statistics of random binning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0730","kind":"arxiv","version":3},"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:eb06934850a6e6b379d9dd84a21a69b658e3fa41c6fb46b8b2af8c4ddf4be194","target":"record","created_at":"2026-05-18T02:44: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":"becfae27bd765074d571afa2b2d502a6f0fd5fd0893c948c24024306dee46817","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-04T11:12:48Z","title_canon_sha256":"416479d5c3d4facaf8e47b633bf674b4d001f1f8ab528351d5fff98f6f8dfa76"},"schema_version":"1.0","source":{"id":"1203.0730","kind":"arxiv","version":3}},"canonical_sha256":"e3e430de931e0f04080f6a776fad4c0a7c15711af61ba4bcf59fc35a5878ce66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3e430de931e0f04080f6a776fad4c0a7c15711af61ba4bcf59fc35a5878ce66","first_computed_at":"2026-05-18T02:44:40.589487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:40.589487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FQkQSuLGOOvxyEhrcdw16naen0f2OsTg33gvVbs46NnbbZK7UtHqC9XCuPexJD6YvOB3hp2UvfLAAP1PsEclCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:40.590178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0730","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb06934850a6e6b379d9dd84a21a69b658e3fa41c6fb46b8b2af8c4ddf4be194","sha256:e5093e3219e56d48a03645a61992d92b8c94a84a5fda0689b91ad35e6ee968a6"],"state_sha256":"9e6c30c8ba135eacbe7251c5a21cfc5ea344d0258770ec94b069b0da80caf320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y724I+e8dCYR0bQPwKBwwEDYmCSvwktD34pEzCRVT8D4oJx9JSVnQ3ZdJ+P7NhEV92v5Ap3F6eRasP0HE7GCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:25:08.455568Z","bundle_sha256":"735ab7dbf7274944b1f095c6435980d6df0b06249f81b57574b67c2024c9c7ae"}}