{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NRP6GLT7KVXCGC74CARBGWOXRE","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":"db200cd7773604011e203f9bfe875fe99172ed266064ef9fcd37ea6398e3e830","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-10T18:35:57Z","title_canon_sha256":"99d076deb2a19856eff9d5807dbace0cb9330167bb115b386f966e83226ab6f9"},"schema_version":"1.0","source":{"id":"1410.2862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2862","created_at":"2026-05-18T02:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2862v1","created_at":"2026-05-18T02:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2862","created_at":"2026-05-18T02:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"NRP6GLT7KVXC","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NRP6GLT7KVXCGC74","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NRP6GLT7","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:84f1e6b746b27cc5801e23735f065e02517dc422097c31e38993a25b062abb3d","target":"graph","created_at":"2026-05-18T02:40:36Z","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 powerful resource for cryptography as they can be used to obtain information-theoretically secure key agreement, commitment and oblivious transfer protocols, among others. Oblivious transfer (OT) is a fundamental primitive since it is complete for secure multi-party computation, and the OT capacity characterizes how efficiently a channel can be used for obtaining string oblivious transfer. Ahlswede and Csisz\\'{a}r (\\emph{ISIT'07}) presented upper and lower bounds on the OT capacity of generalized erasure channels (GEC) against passive adversaries. In the case of GEC with e","authors_text":"Anderson C. A. Nascimento, Rafael Dowsley","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-10T18:35:57Z","title":"On the Oblivious Transfer Capacity of Generalized Erasure Channels against Malicious Adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2862","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:80d8db20303f0a473d3b08de514498ed1f77fce1016131d5b767aac41a0a91be","target":"record","created_at":"2026-05-18T02:40:36Z","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":"db200cd7773604011e203f9bfe875fe99172ed266064ef9fcd37ea6398e3e830","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-10T18:35:57Z","title_canon_sha256":"99d076deb2a19856eff9d5807dbace0cb9330167bb115b386f966e83226ab6f9"},"schema_version":"1.0","source":{"id":"1410.2862","kind":"arxiv","version":1}},"canonical_sha256":"6c5fe32e7f556e230bfc10221359d78909cfcfd1d1526a6f048efd575ea0f7bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c5fe32e7f556e230bfc10221359d78909cfcfd1d1526a6f048efd575ea0f7bf","first_computed_at":"2026-05-18T02:40:36.958264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:36.958264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/xtoeBENL7nWFzKVerfA5MBOp/+7SQfiODiUgKv5vEwoXduAWQoBo7IfRUjNeZgLtlXfIQKpMqBQZWQf+FR/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:36.959003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80d8db20303f0a473d3b08de514498ed1f77fce1016131d5b767aac41a0a91be","sha256:84f1e6b746b27cc5801e23735f065e02517dc422097c31e38993a25b062abb3d"],"state_sha256":"8486f9b208681dc89bb9a57f2a3d595bfe673023aee7bba66b0435b9a4c042bb"}