{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M2CARORD2HNVZW5TQOGIXV32M6","short_pith_number":"pith:M2CARORD","canonical_record":{"source":{"id":"1510.09091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T13:57:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c8dcdc80ff771dab015027cf2f772873677901a4d0ea87200b94bcd4340022e0","abstract_canon_sha256":"85571015dc7aea5841ba6de07e982af039c5019b876883b4f6d774ba5509a510"},"schema_version":"1.0"},"canonical_sha256":"668408ba23d1db5cdbb3838c8bd77a679b8d77015970401d4761f4a012964a33","source":{"kind":"arxiv","id":"1510.09091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09091","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09091v2","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09091","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"M2CARORD2HNV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M2CARORD2HNVZW5T","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M2CARORD","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M2CARORD2HNVZW5TQOGIXV32M6","target":"record","payload":{"canonical_record":{"source":{"id":"1510.09091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T13:57:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c8dcdc80ff771dab015027cf2f772873677901a4d0ea87200b94bcd4340022e0","abstract_canon_sha256":"85571015dc7aea5841ba6de07e982af039c5019b876883b4f6d774ba5509a510"},"schema_version":"1.0"},"canonical_sha256":"668408ba23d1db5cdbb3838c8bd77a679b8d77015970401d4761f4a012964a33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:36.839996Z","signature_b64":"e+nBeBQWFCQ7Vyr7uGDC5XxHVyn/eMaeF2tpZ+lxkwjMAW/u0e0Cd2CEymXY8pRg+m8zHYlMEX7Asoxwg6jXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"668408ba23d1db5cdbb3838c8bd77a679b8d77015970401d4761f4a012964a33","last_reissued_at":"2026-05-18T01:21:36.839289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:36.839289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.09091","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-05-18T01:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39iqa29XWTqMs1jBu4+HQag3IpWKJKGR/Lh+0l25rD31ACcwKTRFOBUBDLyxKQzrm6aWJie9LGt7g4xP7fsBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:15:09.542804Z"},"content_sha256":"4ec655830930ebd6c4bafe6a8a986dca9da65839d3798a7543221aa28431f178","schema_version":"1.0","event_id":"sha256:4ec655830930ebd6c4bafe6a8a986dca9da65839d3798a7543221aa28431f178"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M2CARORD2HNVZW5TQOGIXV32M6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Secrecy and Stealth for Broadcast Channels with Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Igor Bjelakovic, Jafar Mohammadi, S{\\l}awomir Sta\\'nczak","submitted_at":"2015-10-30T13:57:34Z","abstract_excerpt":"We consider a discrete memoryless broadcast channel consists of two users and a sender. The sender has two independent confidential messages for each user. We extend the work of Liu et al.\\ on broadcast channels with two confidential messages with weak secrecy criterion to strong secrecy. Our results are based on an extension of the techniques developed by Hou and Kramer on bounding Kullback-Leibler divergence in context of \\textit{resolvability} and \\textit{effective secrecy}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09091","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":""},"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-18T01:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtIx7pM/yzOtpcYW/MFBMiXPiW/lExM/0rkogtWN7bKWWyxAJG+Daj24N9f1kaWtcgfdstcaNQoVGYjUMvebAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:15:09.543140Z"},"content_sha256":"f7ce83f12c91218ebff1a969f8ec8869bcbea17d150b19f1426526443b3ff9ca","schema_version":"1.0","event_id":"sha256:f7ce83f12c91218ebff1a969f8ec8869bcbea17d150b19f1426526443b3ff9ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2CARORD2HNVZW5TQOGIXV32M6/bundle.json","state_url":"https://pith.science/pith/M2CARORD2HNVZW5TQOGIXV32M6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2CARORD2HNVZW5TQOGIXV32M6/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-22T11:15:09Z","links":{"resolver":"https://pith.science/pith/M2CARORD2HNVZW5TQOGIXV32M6","bundle":"https://pith.science/pith/M2CARORD2HNVZW5TQOGIXV32M6/bundle.json","state":"https://pith.science/pith/M2CARORD2HNVZW5TQOGIXV32M6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2CARORD2HNVZW5TQOGIXV32M6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M2CARORD2HNVZW5TQOGIXV32M6","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":"85571015dc7aea5841ba6de07e982af039c5019b876883b4f6d774ba5509a510","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T13:57:34Z","title_canon_sha256":"c8dcdc80ff771dab015027cf2f772873677901a4d0ea87200b94bcd4340022e0"},"schema_version":"1.0","source":{"id":"1510.09091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09091","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09091v2","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09091","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"M2CARORD2HNV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M2CARORD2HNVZW5T","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M2CARORD","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:f7ce83f12c91218ebff1a969f8ec8869bcbea17d150b19f1426526443b3ff9ca","target":"graph","created_at":"2026-05-18T01:21: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":"We consider a discrete memoryless broadcast channel consists of two users and a sender. The sender has two independent confidential messages for each user. We extend the work of Liu et al.\\ on broadcast channels with two confidential messages with weak secrecy criterion to strong secrecy. Our results are based on an extension of the techniques developed by Hou and Kramer on bounding Kullback-Leibler divergence in context of \\textit{resolvability} and \\textit{effective secrecy}.","authors_text":"Igor Bjelakovic, Jafar Mohammadi, S{\\l}awomir Sta\\'nczak","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T13:57:34Z","title":"Strong Secrecy and Stealth for Broadcast Channels with Confidential Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09091","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:4ec655830930ebd6c4bafe6a8a986dca9da65839d3798a7543221aa28431f178","target":"record","created_at":"2026-05-18T01:21: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":"85571015dc7aea5841ba6de07e982af039c5019b876883b4f6d774ba5509a510","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T13:57:34Z","title_canon_sha256":"c8dcdc80ff771dab015027cf2f772873677901a4d0ea87200b94bcd4340022e0"},"schema_version":"1.0","source":{"id":"1510.09091","kind":"arxiv","version":2}},"canonical_sha256":"668408ba23d1db5cdbb3838c8bd77a679b8d77015970401d4761f4a012964a33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"668408ba23d1db5cdbb3838c8bd77a679b8d77015970401d4761f4a012964a33","first_computed_at":"2026-05-18T01:21:36.839289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:36.839289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e+nBeBQWFCQ7Vyr7uGDC5XxHVyn/eMaeF2tpZ+lxkwjMAW/u0e0Cd2CEymXY8pRg+m8zHYlMEX7Asoxwg6jXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:36.839996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.09091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ec655830930ebd6c4bafe6a8a986dca9da65839d3798a7543221aa28431f178","sha256:f7ce83f12c91218ebff1a969f8ec8869bcbea17d150b19f1426526443b3ff9ca"],"state_sha256":"dbe413494f0c880ba7a0b23eb9b689a84ebc4f916b54a87b9983451325d24c5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsNqCPqK2fhlIDINoRXtcLOymITxU2VcIfbv/bpA8U6OpUeNy1P22fV0KwvfANj2SZzQ0MhobGlytl3FuqRDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:15:09.545267Z","bundle_sha256":"ba88308c373c49fae4c6955564d0c0751c3623e681171df33fb0cad1c2693580"}}