{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:T4CD3S72PQOVKNGNP26BFOJN4M","short_pith_number":"pith:T4CD3S72","canonical_record":{"source":{"id":"2510.25343","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-29T09:58:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f671b84610ab198537ea42082e30a2ef5d81dd3222e51c9485dde46bbbf5343","abstract_canon_sha256":"18c37607c13daaa711e902b55ac2b0f501bbeda0c9bcf646e7ce78d3def258c4"},"schema_version":"1.0"},"canonical_sha256":"9f043dcbfa7c1d5534cd7ebc12b92de310f08a08e12de54cffdad12d40831078","source":{"kind":"arxiv","id":"2510.25343","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.25343","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"arxiv_version","alias_value":"2510.25343v2","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.25343","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"pith_short_12","alias_value":"T4CD3S72PQOV","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"pith_short_16","alias_value":"T4CD3S72PQOVKNGN","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"pith_short_8","alias_value":"T4CD3S72","created_at":"2026-08-05T01:34:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:T4CD3S72PQOVKNGNP26BFOJN4M","target":"record","payload":{"canonical_record":{"source":{"id":"2510.25343","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-29T09:58:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f671b84610ab198537ea42082e30a2ef5d81dd3222e51c9485dde46bbbf5343","abstract_canon_sha256":"18c37607c13daaa711e902b55ac2b0f501bbeda0c9bcf646e7ce78d3def258c4"},"schema_version":"1.0"},"canonical_sha256":"9f043dcbfa7c1d5534cd7ebc12b92de310f08a08e12de54cffdad12d40831078","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T01:34:09.988629Z","signature_b64":"xe/Am89EQI4EDTzQPdBKogk8NYVcnecOC0Of5dU26SHhLRZ8Fcu5j0JAPk7hvTL0nj6LZl0S4zVoLKmYpy+NBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f043dcbfa7c1d5534cd7ebc12b92de310f08a08e12de54cffdad12d40831078","last_reissued_at":"2026-08-05T01:34:09.987149Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T01:34:09.987149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.25343","source_version":2,"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-08-05T01:34:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKMn/qiWuJ6tQSGlzDGagt7Qh3qyxiXV8SI8/i6hwn2+K7+Ldl+5EIXCm+goSYD/iLHMElZeIBqakFvYXGJlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:48:03.946362Z"},"content_sha256":"c11deeeb1c0e2225be29ec8cec48f52bd5aa171adff54f19596aa00327e4f4d2","schema_version":"1.0","event_id":"sha256:c11deeeb1c0e2225be29ec8cec48f52bd5aa171adff54f19596aa00327e4f4d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:T4CD3S72PQOVKNGNP26BFOJN4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Oblivious Transfer via Noisy Broadcast Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Hadi Aghaee, Holger Boche","submitted_at":"2025-10-29T09:58:36Z","abstract_excerpt":"This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general upper bounds on the achievable oblivious transfer capacity region for each case. Two explicit oblivious transfer protocols are proposed. The first ensures correctness and privacy for independent, non-colluding receivers by leveraging the structure of binary erasure broadcast channels. The second protocol, secure even under receiver collusion, introduces add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.25343","kind":"arxiv","version":2},"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/2510.25343/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"},"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-08-05T01:34:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xS5SqgEvuds67B3/stJxErBG3pDwcZXyL62caoLltFIkBcMK/a+4P5TynsrYoYJHtd3G7gNVIk2FrUbJf3PZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:48:03.946930Z"},"content_sha256":"1207045bb41a6624f1b84ce78e1a0f55b58e80d7e57df1e6d2ac5c264f615185","schema_version":"1.0","event_id":"sha256:1207045bb41a6624f1b84ce78e1a0f55b58e80d7e57df1e6d2ac5c264f615185"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4CD3S72PQOVKNGNP26BFOJN4M/bundle.json","state_url":"https://pith.science/pith/T4CD3S72PQOVKNGNP26BFOJN4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4CD3S72PQOVKNGNP26BFOJN4M/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-08-07T05:48:03Z","links":{"resolver":"https://pith.science/pith/T4CD3S72PQOVKNGNP26BFOJN4M","bundle":"https://pith.science/pith/T4CD3S72PQOVKNGNP26BFOJN4M/bundle.json","state":"https://pith.science/pith/T4CD3S72PQOVKNGNP26BFOJN4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4CD3S72PQOVKNGNP26BFOJN4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:T4CD3S72PQOVKNGNP26BFOJN4M","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":"18c37607c13daaa711e902b55ac2b0f501bbeda0c9bcf646e7ce78d3def258c4","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-29T09:58:36Z","title_canon_sha256":"2f671b84610ab198537ea42082e30a2ef5d81dd3222e51c9485dde46bbbf5343"},"schema_version":"1.0","source":{"id":"2510.25343","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.25343","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"arxiv_version","alias_value":"2510.25343v2","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.25343","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"pith_short_12","alias_value":"T4CD3S72PQOV","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"pith_short_16","alias_value":"T4CD3S72PQOVKNGN","created_at":"2026-08-05T01:34:09Z"},{"alias_kind":"pith_short_8","alias_value":"T4CD3S72","created_at":"2026-08-05T01:34:09Z"}],"graph_snapshots":[{"event_id":"sha256:1207045bb41a6624f1b84ce78e1a0f55b58e80d7e57df1e6d2ac5c264f615185","target":"graph","created_at":"2026-08-05T01:34:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.25343/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general upper bounds on the achievable oblivious transfer capacity region for each case. Two explicit oblivious transfer protocols are proposed. The first ensures correctness and privacy for independent, non-colluding receivers by leveraging the structure of binary erasure broadcast channels. The second protocol, secure even under receiver collusion, introduces add","authors_text":"Christian Deppe, Hadi Aghaee, Holger Boche","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-29T09:58:36Z","title":"Network Oblivious Transfer via Noisy Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.25343","kind":"arxiv","version":2},"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:c11deeeb1c0e2225be29ec8cec48f52bd5aa171adff54f19596aa00327e4f4d2","target":"record","created_at":"2026-08-05T01:34:09Z","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":"18c37607c13daaa711e902b55ac2b0f501bbeda0c9bcf646e7ce78d3def258c4","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-29T09:58:36Z","title_canon_sha256":"2f671b84610ab198537ea42082e30a2ef5d81dd3222e51c9485dde46bbbf5343"},"schema_version":"1.0","source":{"id":"2510.25343","kind":"arxiv","version":2}},"canonical_sha256":"9f043dcbfa7c1d5534cd7ebc12b92de310f08a08e12de54cffdad12d40831078","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f043dcbfa7c1d5534cd7ebc12b92de310f08a08e12de54cffdad12d40831078","first_computed_at":"2026-08-05T01:34:09.987149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-05T01:34:09.987149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xe/Am89EQI4EDTzQPdBKogk8NYVcnecOC0Of5dU26SHhLRZ8Fcu5j0JAPk7hvTL0nj6LZl0S4zVoLKmYpy+NBw==","signature_status":"signed_v1","signed_at":"2026-08-05T01:34:09.988629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.25343","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c11deeeb1c0e2225be29ec8cec48f52bd5aa171adff54f19596aa00327e4f4d2","sha256:1207045bb41a6624f1b84ce78e1a0f55b58e80d7e57df1e6d2ac5c264f615185"],"state_sha256":"d2f0923d1bb6b198217141908def23e754618e9a71823019936b5da8829b0095"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0b2DlfKKnQYyfrwI+rTW8QX2Zv64cuHBWaiu9Z8tINZHQCHsr+rzWl1r9uICtm5oB1nvzR3FeDqHobPGo9BBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:48:03.950557Z","bundle_sha256":"001907707cfd89610afb616c8e96de3264f25259ad6fa4d39d8c4b73db277243"}}