{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AZKOUPQKBPI5MK5IV7XXIM6N74","short_pith_number":"pith:AZKOUPQK","schema_version":"1.0","canonical_sha256":"0654ea3e0a0bd1d62ba8afef7433cdff3767e15690dab61ab25d6d5858e8cbe8","source":{"kind":"arxiv","id":"2405.01948","version":1},"attestation_state":"computed","paper":{"title":"Common Randomness Generation from Sources with Infinite Polish Alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Holger Boche, Moritz Wiese, Rami Ezzine, Wafa Labidi","submitted_at":"2024-05-03T09:21:13Z","abstract_excerpt":"We investigate the problem of common randomness (CR) generation in the basic two-party communication setting in which a sender and a receiver aim to agree on a common random variable with high probability. The terminals observe independent and identically distributed (i.i.d.) samples of sources with an arbitrary distribution defined on a Polish alphabet and are allowed to communicate as little as possible over a noisy, memoryless channel. We establish single-letter upper and lower bounds on the CR capacity for the specified model. The derived bounds hold with equality except for at most counta"},"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":"2405.01948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-03T09:21:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8dd3e8826f1a34bba7baf8d27063d033e32cd8427610f9a6199f044e5a9b34db","abstract_canon_sha256":"58d7faa3472fa4315d1a18418b406eae56c468497544bd5f4c8878aac6b7a5fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:15:04.736021Z","signature_b64":"BXLirYNuZVkkOiQel+yVtfi8KuHJFwCNgqnb/ktmnmeB5LrgaY8i+taorkFU6P3XOpdNqI3xg6jQzLdDdf4gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0654ea3e0a0bd1d62ba8afef7433cdff3767e15690dab61ab25d6d5858e8cbe8","last_reissued_at":"2026-07-05T08:15:04.735550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:15:04.735550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Common Randomness Generation from Sources with Infinite Polish Alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Holger Boche, Moritz Wiese, Rami Ezzine, Wafa Labidi","submitted_at":"2024-05-03T09:21:13Z","abstract_excerpt":"We investigate the problem of common randomness (CR) generation in the basic two-party communication setting in which a sender and a receiver aim to agree on a common random variable with high probability. The terminals observe independent and identically distributed (i.i.d.) samples of sources with an arbitrary distribution defined on a Polish alphabet and are allowed to communicate as little as possible over a noisy, memoryless channel. We establish single-letter upper and lower bounds on the CR capacity for the specified model. The derived bounds hold with equality except for at most counta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01948","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/2405.01948/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":"2405.01948","created_at":"2026-07-05T08:15:04.735618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01948v1","created_at":"2026-07-05T08:15:04.735618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01948","created_at":"2026-07-05T08:15:04.735618+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZKOUPQKBPI5","created_at":"2026-07-05T08:15:04.735618+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZKOUPQKBPI5MK5I","created_at":"2026-07-05T08:15:04.735618+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZKOUPQK","created_at":"2026-07-05T08:15:04.735618+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/AZKOUPQKBPI5MK5IV7XXIM6N74","json":"https://pith.science/pith/AZKOUPQKBPI5MK5IV7XXIM6N74.json","graph_json":"https://pith.science/api/pith-number/AZKOUPQKBPI5MK5IV7XXIM6N74/graph.json","events_json":"https://pith.science/api/pith-number/AZKOUPQKBPI5MK5IV7XXIM6N74/events.json","paper":"https://pith.science/paper/AZKOUPQK"},"agent_actions":{"view_html":"https://pith.science/pith/AZKOUPQKBPI5MK5IV7XXIM6N74","download_json":"https://pith.science/pith/AZKOUPQKBPI5MK5IV7XXIM6N74.json","view_paper":"https://pith.science/paper/AZKOUPQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01948&json=true","fetch_graph":"https://pith.science/api/pith-number/AZKOUPQKBPI5MK5IV7XXIM6N74/graph.json","fetch_events":"https://pith.science/api/pith-number/AZKOUPQKBPI5MK5IV7XXIM6N74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZKOUPQKBPI5MK5IV7XXIM6N74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZKOUPQKBPI5MK5IV7XXIM6N74/action/storage_attestation","attest_author":"https://pith.science/pith/AZKOUPQKBPI5MK5IV7XXIM6N74/action/author_attestation","sign_citation":"https://pith.science/pith/AZKOUPQKBPI5MK5IV7XXIM6N74/action/citation_signature","submit_replication":"https://pith.science/pith/AZKOUPQKBPI5MK5IV7XXIM6N74/action/replication_record"}},"created_at":"2026-07-05T08:15:04.735618+00:00","updated_at":"2026-07-05T08:15:04.735618+00:00"}