{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4YSLR352VWMBYRJLTXWNMA4JAP","short_pith_number":"pith:4YSLR352","canonical_record":{"source":{"id":"1907.04599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-10T10:08:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cfaa339377106c1d16a364e7cceb3ee990459e2270be41ee22f6fae2ab18361d","abstract_canon_sha256":"30a5ec9db4f12847475fd71a98de08b171f874b3dc02199eeec0f7914db06b9c"},"schema_version":"1.0"},"canonical_sha256":"e624b8efbaad981c452b9decd6038903ce329f486f606046d818146c26398db0","source":{"kind":"arxiv","id":"1907.04599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04599","created_at":"2026-05-17T23:40:57Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04599v1","created_at":"2026-05-17T23:40:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04599","created_at":"2026-05-17T23:40:57Z"},{"alias_kind":"pith_short_12","alias_value":"4YSLR352VWMB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4YSLR352VWMBYRJL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4YSLR352","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4YSLR352VWMBYRJLTXWNMA4JAP","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-10T10:08:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cfaa339377106c1d16a364e7cceb3ee990459e2270be41ee22f6fae2ab18361d","abstract_canon_sha256":"30a5ec9db4f12847475fd71a98de08b171f874b3dc02199eeec0f7914db06b9c"},"schema_version":"1.0"},"canonical_sha256":"e624b8efbaad981c452b9decd6038903ce329f486f606046d818146c26398db0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:57.426369Z","signature_b64":"h4ixEx31Ph/ZoGIyu5Ql+2CyUVGYhTUDqqRX5D4PBSEB7OG3ENGuM1tumzCA+IAObUeDIxcySbDZGbs9W/lVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e624b8efbaad981c452b9decd6038903ce329f486f606046d818146c26398db0","last_reissued_at":"2026-05-17T23:40:57.425636Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:57.425636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04599","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:40:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RakaS5yiVTwMrnpXGeMDj0fsx+IMUHEnncZkEJQw//1T8uxt25KCaTAaUlNrwhnLYHXlJwcSRH7AG053BKB0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:32:54.240949Z"},"content_sha256":"13127bd65e8d5b051845ce62d4b44102f987b9c8577eb3cf1b6ff4a1f0484ea0","schema_version":"1.0","event_id":"sha256:13127bd65e8d5b051845ce62d4b44102f987b9c8577eb3cf1b6ff4a1f0484ea0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4YSLR352VWMBYRJLTXWNMA4JAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fan Li, Jinyuan Chen","submitted_at":"2019-07-10T10:08:24Z","abstract_excerpt":"In communication networks secrecy constraints usually incur an extra limit in capacity or generalized degrees-of-freedom (GDoF), in the sense that a penalty in capacity or GDoF is incurred due to the secrecy constraints. Over the past decades a significant amount of effort has been made by the researchers to understand the limits of secrecy constraints in communication networks. In this work, we focus on how to remove the secrecy constraints in communication networks, i.e., how to remove the GDoF penalty due to secrecy constraints. We begin with three basic settings: a two-user symmetric Gauss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04599","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:40:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ooVLoXEskHh7u3oyYIRlOVvNvijbGMJ+nsZtjnmin5tX7Jm/ZTt5aJkrbB2bcNwANeQACmu7OO2GVHeqe0IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:32:54.241439Z"},"content_sha256":"5c17479ba99379a9bcbfd26d3aa7efff805465ac48528f6f3248001b3eb23d60","schema_version":"1.0","event_id":"sha256:5c17479ba99379a9bcbfd26d3aa7efff805465ac48528f6f3248001b3eb23d60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YSLR352VWMBYRJLTXWNMA4JAP/bundle.json","state_url":"https://pith.science/pith/4YSLR352VWMBYRJLTXWNMA4JAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YSLR352VWMBYRJLTXWNMA4JAP/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-05-26T03:32:54Z","links":{"resolver":"https://pith.science/pith/4YSLR352VWMBYRJLTXWNMA4JAP","bundle":"https://pith.science/pith/4YSLR352VWMBYRJLTXWNMA4JAP/bundle.json","state":"https://pith.science/pith/4YSLR352VWMBYRJLTXWNMA4JAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YSLR352VWMBYRJLTXWNMA4JAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4YSLR352VWMBYRJLTXWNMA4JAP","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":"30a5ec9db4f12847475fd71a98de08b171f874b3dc02199eeec0f7914db06b9c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-10T10:08:24Z","title_canon_sha256":"cfaa339377106c1d16a364e7cceb3ee990459e2270be41ee22f6fae2ab18361d"},"schema_version":"1.0","source":{"id":"1907.04599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04599","created_at":"2026-05-17T23:40:57Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04599v1","created_at":"2026-05-17T23:40:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04599","created_at":"2026-05-17T23:40:57Z"},{"alias_kind":"pith_short_12","alias_value":"4YSLR352VWMB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4YSLR352VWMBYRJL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4YSLR352","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:5c17479ba99379a9bcbfd26d3aa7efff805465ac48528f6f3248001b3eb23d60","target":"graph","created_at":"2026-05-17T23:40:57Z","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 communication networks secrecy constraints usually incur an extra limit in capacity or generalized degrees-of-freedom (GDoF), in the sense that a penalty in capacity or GDoF is incurred due to the secrecy constraints. Over the past decades a significant amount of effort has been made by the researchers to understand the limits of secrecy constraints in communication networks. In this work, we focus on how to remove the secrecy constraints in communication networks, i.e., how to remove the GDoF penalty due to secrecy constraints. We begin with three basic settings: a two-user symmetric Gauss","authors_text":"Fan Li, Jinyuan Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-10T10:08:24Z","title":"Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04599","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:13127bd65e8d5b051845ce62d4b44102f987b9c8577eb3cf1b6ff4a1f0484ea0","target":"record","created_at":"2026-05-17T23:40:57Z","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":"30a5ec9db4f12847475fd71a98de08b171f874b3dc02199eeec0f7914db06b9c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-10T10:08:24Z","title_canon_sha256":"cfaa339377106c1d16a364e7cceb3ee990459e2270be41ee22f6fae2ab18361d"},"schema_version":"1.0","source":{"id":"1907.04599","kind":"arxiv","version":1}},"canonical_sha256":"e624b8efbaad981c452b9decd6038903ce329f486f606046d818146c26398db0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e624b8efbaad981c452b9decd6038903ce329f486f606046d818146c26398db0","first_computed_at":"2026-05-17T23:40:57.425636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:57.425636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4ixEx31Ph/ZoGIyu5Ql+2CyUVGYhTUDqqRX5D4PBSEB7OG3ENGuM1tumzCA+IAObUeDIxcySbDZGbs9W/lVAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:57.426369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13127bd65e8d5b051845ce62d4b44102f987b9c8577eb3cf1b6ff4a1f0484ea0","sha256:5c17479ba99379a9bcbfd26d3aa7efff805465ac48528f6f3248001b3eb23d60"],"state_sha256":"708095451c6e8acd52f60715e17ec3217e3db65a9f22b44c2d8c935dd00eee32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"enQaY0dJebhzpU6U45nJY8Qwz1u/Sl984l4cMWvvSV6CYylIy1N5TlqtL9P49QiB0doXAycL8nJ4qn7qmPQ/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:32:54.244743Z","bundle_sha256":"2f1caca3d75b7b3a1cc6146e888ecc01e0babae3d6a8b5e2acbcbfd4ec36b2cc"}}