{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IXOLDQNLTKBMR46FVSF5RVTEJ5","short_pith_number":"pith:IXOLDQNL","schema_version":"1.0","canonical_sha256":"45dcb1c1ab9a82c8f3c5ac8bd8d6644f4537e8929c10a74ce7009d94ea091c2f","source":{"kind":"arxiv","id":"2201.11078","version":1},"attestation_state":"computed","paper":{"title":"Common Randomness Generation from Gaussian Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Holger Boche, Rami Ezzine, Wafa Labidi","submitted_at":"2022-01-26T17:36:41Z","abstract_excerpt":"We study the problem of common randomness (CR) generation in the basic two-party communication setting in which the sender and the receiver aim to agree on a common random variable with high probability by observing independent and identically distributed (i.i.d.) samples of correlated Gaussian sources and while communicating as little as possible over a noisy memoryless channel. We completely solve the problem by giving a single-letter characterization of the CR capacity for the proposed model and by providing a rigorous proof of it. Interestingly, we prove that the CR capacity is infinite wh"},"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":"2201.11078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-26T17:36:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"292c040a5fdfd891a9a24b19006967d0f4f75ab0a4ccd6243592341563e6c4ab","abstract_canon_sha256":"9fdec8fae7d4ec15d697bf7fa853271d57388c13926ed061a0c3db02f6975506"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:52.003420Z","signature_b64":"CxJehNJPKMN1N12smPKOfk/TUTu10tSLmAsOg8FMUqTLmiXcC9hVMKZqNKiF9yiJtCVIEVycrd7SU2kYxsl5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45dcb1c1ab9a82c8f3c5ac8bd8d6644f4537e8929c10a74ce7009d94ea091c2f","last_reissued_at":"2026-07-05T03:51:52.002986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:52.002986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Common Randomness Generation from Gaussian Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Holger Boche, Rami Ezzine, Wafa Labidi","submitted_at":"2022-01-26T17:36:41Z","abstract_excerpt":"We study the problem of common randomness (CR) generation in the basic two-party communication setting in which the sender and the receiver aim to agree on a common random variable with high probability by observing independent and identically distributed (i.i.d.) samples of correlated Gaussian sources and while communicating as little as possible over a noisy memoryless channel. We completely solve the problem by giving a single-letter characterization of the CR capacity for the proposed model and by providing a rigorous proof of it. Interestingly, we prove that the CR capacity is infinite wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.11078","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.11078/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2201.11078","created_at":"2026-07-05T03:51:52.003046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.11078v1","created_at":"2026-07-05T03:51:52.003046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.11078","created_at":"2026-07-05T03:51:52.003046+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXOLDQNLTKBM","created_at":"2026-07-05T03:51:52.003046+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXOLDQNLTKBMR46F","created_at":"2026-07-05T03:51:52.003046+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXOLDQNL","created_at":"2026-07-05T03:51:52.003046+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/IXOLDQNLTKBMR46FVSF5RVTEJ5","json":"https://pith.science/pith/IXOLDQNLTKBMR46FVSF5RVTEJ5.json","graph_json":"https://pith.science/api/pith-number/IXOLDQNLTKBMR46FVSF5RVTEJ5/graph.json","events_json":"https://pith.science/api/pith-number/IXOLDQNLTKBMR46FVSF5RVTEJ5/events.json","paper":"https://pith.science/paper/IXOLDQNL"},"agent_actions":{"view_html":"https://pith.science/pith/IXOLDQNLTKBMR46FVSF5RVTEJ5","download_json":"https://pith.science/pith/IXOLDQNLTKBMR46FVSF5RVTEJ5.json","view_paper":"https://pith.science/paper/IXOLDQNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.11078&json=true","fetch_graph":"https://pith.science/api/pith-number/IXOLDQNLTKBMR46FVSF5RVTEJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/IXOLDQNLTKBMR46FVSF5RVTEJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXOLDQNLTKBMR46FVSF5RVTEJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXOLDQNLTKBMR46FVSF5RVTEJ5/action/storage_attestation","attest_author":"https://pith.science/pith/IXOLDQNLTKBMR46FVSF5RVTEJ5/action/author_attestation","sign_citation":"https://pith.science/pith/IXOLDQNLTKBMR46FVSF5RVTEJ5/action/citation_signature","submit_replication":"https://pith.science/pith/IXOLDQNLTKBMR46FVSF5RVTEJ5/action/replication_record"}},"created_at":"2026-07-05T03:51:52.003046+00:00","updated_at":"2026-07-05T03:51:52.003046+00:00"}