{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NRP6GLT7KVXCGC74CARBGWOXRE","short_pith_number":"pith:NRP6GLT7","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"},"canonical_sha256":"6c5fe32e7f556e230bfc10221359d78909cfcfd1d1526a6f048efd575ea0f7bf","source":{"kind":"arxiv","id":"1410.2862","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NRP6GLT7KVXCGC74CARBGWOXRE","target":"record","payload":{"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"},"canonical_sha256":"6c5fe32e7f556e230bfc10221359d78909cfcfd1d1526a6f048efd575ea0f7bf","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"},"source_kind":"arxiv","source_id":"1410.2862","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-18T02:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2j6WRvzQd0kIRdsn1o6ie7xHSQdyhLoRVt1OywRb1nXTsioIyPBDShJyLO+KyTWDxpOcK7NwlVqnWBHAzvhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:14:43.396568Z"},"content_sha256":"80d8db20303f0a473d3b08de514498ed1f77fce1016131d5b767aac41a0a91be","schema_version":"1.0","event_id":"sha256:80d8db20303f0a473d3b08de514498ed1f77fce1016131d5b767aac41a0a91be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NRP6GLT7KVXCGC74CARBGWOXRE","target":"graph","payload":{"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"},"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-18T02:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrij0uM49Y2rESGcUQkn04NkmjJJQkFnz3k1vznix5yzDzyAvszrKTR9mOQc3gTpMzTiKBplsJKAedw1NvEPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:14:43.397257Z"},"content_sha256":"84f1e6b746b27cc5801e23735f065e02517dc422097c31e38993a25b062abb3d","schema_version":"1.0","event_id":"sha256:84f1e6b746b27cc5801e23735f065e02517dc422097c31e38993a25b062abb3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/bundle.json","state_url":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRP6GLT7KVXCGC74CARBGWOXRE/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-08T04:14:43Z","links":{"resolver":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE","bundle":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/bundle.json","state":"https://pith.science/pith/NRP6GLT7KVXCGC74CARBGWOXRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRP6GLT7KVXCGC74CARBGWOXRE/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifDZc7ITY4acU6KV98k907dgoawlDb74RoZXIAh9RPZBZ5iPK81a1Qb9bo3KupK59KnUnFekMgsaGKlawPHEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:14:43.401255Z","bundle_sha256":"3daa41ae86a4a45aa1a3eb6c120acf398d341e34313440547802ade47c980022"}}