{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NRP6GLT7KVXCGC74CARBGWOXRE","short_pith_number":"pith:NRP6GLT7","schema_version":"1.0","canonical_sha256":"6c5fe32e7f556e230bfc10221359d78909cfcfd1d1526a6f048efd575ea0f7bf","source":{"kind":"arxiv","id":"1410.2862","version":1},"attestation_state":"computed","paper":{"title":"On the Oblivious Transfer Capacity of Generalized Erasure Channels against Malicious Adversaries","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, Rafael Dowsley","submitted_at":"2014-10-10T18:35:57Z","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"},"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":"1410.2862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-10T18:35:57Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"99d076deb2a19856eff9d5807dbace0cb9330167bb115b386f966e83226ab6f9","abstract_canon_sha256":"db200cd7773604011e203f9bfe875fe99172ed266064ef9fcd37ea6398e3e830"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:36.959003Z","signature_b64":"/xtoeBENL7nWFzKVerfA5MBOp/+7SQfiODiUgKv5vEwoXduAWQoBo7IfRUjNeZgLtlXfIQKpMqBQZWQf+FR/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c5fe32e7f556e230bfc10221359d78909cfcfd1d1526a6f048efd575ea0f7bf","last_reissued_at":"2026-05-18T02:40:36.958264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:36.958264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Oblivious Transfer Capacity of Generalized Erasure Channels against Malicious Adversaries","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, Rafael Dowsley","submitted_at":"2014-10-10T18:35:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2862","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.2862","created_at":"2026-05-18T02:40:36.958388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2862v1","created_at":"2026-05-18T02:40:36.958388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2862","created_at":"2026-05-18T02:40:36.958388+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRP6GLT7KVXC","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRP6GLT7KVXCGC74","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRP6GLT7","created_at":"2026-05-18T12:28:41.024544+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/NRP6GLT7KVXCGC74CARBGWOXRE","json":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE.json","graph_json":"https://pith.science/api/pith-number/NRP6GLT7KVXCGC74CARBGWOXRE/graph.json","events_json":"https://pith.science/api/pith-number/NRP6GLT7KVXCGC74CARBGWOXRE/events.json","paper":"https://pith.science/paper/NRP6GLT7"},"agent_actions":{"view_html":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE","download_json":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE.json","view_paper":"https://pith.science/paper/NRP6GLT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2862&json=true","fetch_graph":"https://pith.science/api/pith-number/NRP6GLT7KVXCGC74CARBGWOXRE/graph.json","fetch_events":"https://pith.science/api/pith-number/NRP6GLT7KVXCGC74CARBGWOXRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/action/storage_attestation","attest_author":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/action/author_attestation","sign_citation":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/action/citation_signature","submit_replication":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/action/replication_record"}},"created_at":"2026-05-18T02:40:36.958388+00:00","updated_at":"2026-05-18T02:40:36.958388+00:00"}