{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:75BKUP7NFADXK62DYYV4UOIVOH","short_pith_number":"pith:75BKUP7N","canonical_record":{"source":{"id":"1905.10921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-27T01:26:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"08776927daef94ca41f0b9f1e273acc040e536ef620bd339da5afcfd9dc010bf","abstract_canon_sha256":"1bc4dcf528da2438c9077e180daac2ae43a6d840b044d8d2826733a3ac4b3383"},"schema_version":"1.0"},"canonical_sha256":"ff42aa3fed2807757b43c62bca391571e7857443562e8db8c1f1e6c1428c9788","source":{"kind":"arxiv","id":"1905.10921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10921","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10921v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10921","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"75BKUP7NFADX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"75BKUP7NFADXK62D","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"75BKUP7N","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:75BKUP7NFADXK62DYYV4UOIVOH","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-27T01:26:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"08776927daef94ca41f0b9f1e273acc040e536ef620bd339da5afcfd9dc010bf","abstract_canon_sha256":"1bc4dcf528da2438c9077e180daac2ae43a6d840b044d8d2826733a3ac4b3383"},"schema_version":"1.0"},"canonical_sha256":"ff42aa3fed2807757b43c62bca391571e7857443562e8db8c1f1e6c1428c9788","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.398219Z","signature_b64":"dQg6xZcj6V431xpmXhKoqzbnnWCJwLPVXLy7QUgyP5JT3IS8wpCsv3JK8V+qM2mYMMgVPo9pg54WYoF5PTxXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff42aa3fed2807757b43c62bca391571e7857443562e8db8c1f1e6c1428c9788","last_reissued_at":"2026-05-17T23:45:03.397670Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.397670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10921","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:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fL+HLwPtwh5yolaTcwxckMC8DbzQ8NI+4WAmuFMBnRkthanhEINoxr6aR5Dw9ZpHxClSKCUHqpxN2HbpCd5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:19:54.397843Z"},"content_sha256":"4a76680aba0ceca52074cd9cbe099b714f543b3129113ae6b08f2ef47a655c89","schema_version":"1.0","event_id":"sha256:4a76680aba0ceca52074cd9cbe099b714f543b3129113ae6b08f2ef47a655c89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:75BKUP7NFADXK62DYYV4UOIVOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Commitment Capacity of Unfair Noisy Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Anderson C. A. Nascimento, Claude Cr\\'epeau, Rafael Dowsley","submitted_at":"2019-05-27T01:26:23Z","abstract_excerpt":"Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be consider in the scenario where a cheating party has some degree of control over the channel characteristics. Damg\\r{a}rd et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permitted to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10921","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:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XjrgAOGUM1wHdTM3prVAOv3wBCOEYogoaTciW1lT6qj7wwQkvXLvQVVlwJqKsNodxLNxPXxSDfa0Nkj7lRbFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:19:54.398543Z"},"content_sha256":"9d8367da2a15625365fcbe4ca977071151cc49940720a2875972c3048a754ec1","schema_version":"1.0","event_id":"sha256:9d8367da2a15625365fcbe4ca977071151cc49940720a2875972c3048a754ec1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/bundle.json","state_url":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75BKUP7NFADXK62DYYV4UOIVOH/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-08T01:19:54Z","links":{"resolver":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH","bundle":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/bundle.json","state":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75BKUP7NFADXK62DYYV4UOIVOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:75BKUP7NFADXK62DYYV4UOIVOH","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":"1bc4dcf528da2438c9077e180daac2ae43a6d840b044d8d2826733a3ac4b3383","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-27T01:26:23Z","title_canon_sha256":"08776927daef94ca41f0b9f1e273acc040e536ef620bd339da5afcfd9dc010bf"},"schema_version":"1.0","source":{"id":"1905.10921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10921","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10921v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10921","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"75BKUP7NFADX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"75BKUP7NFADXK62D","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"75BKUP7N","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:9d8367da2a15625365fcbe4ca977071151cc49940720a2875972c3048a754ec1","target":"graph","created_at":"2026-05-17T23:45:03Z","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":"Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be consider in the scenario where a cheating party has some degree of control over the channel characteristics. Damg\\r{a}rd et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permitted to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious","authors_text":"Anderson C. A. Nascimento, Claude Cr\\'epeau, Rafael Dowsley","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-27T01:26:23Z","title":"On the Commitment Capacity of Unfair Noisy Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10921","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:4a76680aba0ceca52074cd9cbe099b714f543b3129113ae6b08f2ef47a655c89","target":"record","created_at":"2026-05-17T23:45:03Z","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":"1bc4dcf528da2438c9077e180daac2ae43a6d840b044d8d2826733a3ac4b3383","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-27T01:26:23Z","title_canon_sha256":"08776927daef94ca41f0b9f1e273acc040e536ef620bd339da5afcfd9dc010bf"},"schema_version":"1.0","source":{"id":"1905.10921","kind":"arxiv","version":1}},"canonical_sha256":"ff42aa3fed2807757b43c62bca391571e7857443562e8db8c1f1e6c1428c9788","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff42aa3fed2807757b43c62bca391571e7857443562e8db8c1f1e6c1428c9788","first_computed_at":"2026-05-17T23:45:03.397670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.397670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dQg6xZcj6V431xpmXhKoqzbnnWCJwLPVXLy7QUgyP5JT3IS8wpCsv3JK8V+qM2mYMMgVPo9pg54WYoF5PTxXCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.398219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a76680aba0ceca52074cd9cbe099b714f543b3129113ae6b08f2ef47a655c89","sha256:9d8367da2a15625365fcbe4ca977071151cc49940720a2875972c3048a754ec1"],"state_sha256":"977dc6b3946f28b93b0115a8c822b776adf2997b363f48fd9af9d9653c041a92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AoFt7dikBkDoGC6jo/jhrj0OhXWrzOcmscIJuGSJLw/1TmP/E4Qz3zOaFKdGrF9KpSWPt1vmnMnZ4UQtnteCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:19:54.402074Z","bundle_sha256":"94d60431073b5d6ca0dc50d4695dccc8d4ffede879bfba8231a72d591fff0b9c"}}