{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3GZFRA3Q36AYHQ65RSCTFL6RXJ","short_pith_number":"pith:3GZFRA3Q","canonical_record":{"source":{"id":"1212.0101","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-12-01T11:47:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6613a792acae441e890b48536b4d2a3f74a88f900ac8bb9312499ed57bf2a418","abstract_canon_sha256":"947a9eff7fdb058a29146414f6d812e6e62d1fa79b2efb5446a249632fa12650"},"schema_version":"1.0"},"canonical_sha256":"d9b2588370df8183c3dd8c8532afd1ba4f404f88cca081a2aff78468200c5870","source":{"kind":"arxiv","id":"1212.0101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0101","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0101v2","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0101","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"3GZFRA3Q36AY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GZFRA3Q36AYHQ65","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GZFRA3Q","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3GZFRA3Q36AYHQ65RSCTFL6RXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1212.0101","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-12-01T11:47:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6613a792acae441e890b48536b4d2a3f74a88f900ac8bb9312499ed57bf2a418","abstract_canon_sha256":"947a9eff7fdb058a29146414f6d812e6e62d1fa79b2efb5446a249632fa12650"},"schema_version":"1.0"},"canonical_sha256":"d9b2588370df8183c3dd8c8532afd1ba4f404f88cca081a2aff78468200c5870","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:18.893200Z","signature_b64":"fbiOe4Hl8nHDO49Il5YVqTwoh8YuWeuTnoqNSj6W+VXB8OD9wiY1YJO7SxwO05n8XN0PD6bbHymd09nKVBcoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9b2588370df8183c3dd8c8532afd1ba4f404f88cca081a2aff78468200c5870","last_reissued_at":"2026-05-18T02:40:18.892774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:18.892774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.0101","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-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KsVkhBcY9vfGGYKnhceFwd/uDKSx/MGyUJisqojs5dy15Ep149Gu8T+qGGy35CnLKoV5jKYqUv25bg7qn2iCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:39:14.532564Z"},"content_sha256":"5a272150d01f357dae9d33b95a7e5ef8399b06e9bcfa97cb62098986706f50e2","schema_version":"1.0","event_id":"sha256:5a272150d01f357dae9d33b95a7e5ef8399b06e9bcfa97cb62098986706f50e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3GZFRA3Q36AYHQ65RSCTFL6RXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Bounds on a Wiretap Network with Arbitrary Wiretap Sets","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fan Cheng, Raymond W. Yeung","submitted_at":"2012-12-01T11:47:23Z","abstract_excerpt":"Consider a communication network represented by a directed graph $\\mathcal{G}=(\\mathcal{V},\\mathcal{E})$, where $\\mathcal{V}$ is the set of nodes and $\\mathcal{E}$ is the set of point-to-point channels in the network. On the network a secure message $M$ is transmitted, and there may exist wiretappers who want to obtain information about the message. In secure network coding, we aim to find a network code which can protect the message against the wiretapper whose power is constrained. Cai and Yeung \\cite{cai2002secure} studied the model in which the wiretapper can access any one but not more th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0101","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-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKoIi/mHIngnUa9bouvVwiDOQY1odpHvzFQ+Pt5M/0dLTiZB+KqZm9iKJwXdg4RheusRrumNbfuw2rPdXFTcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:39:14.533271Z"},"content_sha256":"42dbc055d98643132a308d6c4b03f7f7f023e31dc78162c15b4ca081564d1468","schema_version":"1.0","event_id":"sha256:42dbc055d98643132a308d6c4b03f7f7f023e31dc78162c15b4ca081564d1468"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/bundle.json","state_url":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/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-05-31T03:39:14Z","links":{"resolver":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ","bundle":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/bundle.json","state":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3GZFRA3Q36AYHQ65RSCTFL6RXJ","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":"947a9eff7fdb058a29146414f6d812e6e62d1fa79b2efb5446a249632fa12650","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-12-01T11:47:23Z","title_canon_sha256":"6613a792acae441e890b48536b4d2a3f74a88f900ac8bb9312499ed57bf2a418"},"schema_version":"1.0","source":{"id":"1212.0101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0101","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0101v2","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0101","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"3GZFRA3Q36AY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GZFRA3Q36AYHQ65","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GZFRA3Q","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:42dbc055d98643132a308d6c4b03f7f7f023e31dc78162c15b4ca081564d1468","target":"graph","created_at":"2026-05-18T02:40:18Z","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":"Consider a communication network represented by a directed graph $\\mathcal{G}=(\\mathcal{V},\\mathcal{E})$, where $\\mathcal{V}$ is the set of nodes and $\\mathcal{E}$ is the set of point-to-point channels in the network. On the network a secure message $M$ is transmitted, and there may exist wiretappers who want to obtain information about the message. In secure network coding, we aim to find a network code which can protect the message against the wiretapper whose power is constrained. Cai and Yeung \\cite{cai2002secure} studied the model in which the wiretapper can access any one but not more th","authors_text":"Fan Cheng, Raymond W. Yeung","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-12-01T11:47:23Z","title":"Performance Bounds on a Wiretap Network with Arbitrary Wiretap Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0101","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:5a272150d01f357dae9d33b95a7e5ef8399b06e9bcfa97cb62098986706f50e2","target":"record","created_at":"2026-05-18T02:40:18Z","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":"947a9eff7fdb058a29146414f6d812e6e62d1fa79b2efb5446a249632fa12650","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-12-01T11:47:23Z","title_canon_sha256":"6613a792acae441e890b48536b4d2a3f74a88f900ac8bb9312499ed57bf2a418"},"schema_version":"1.0","source":{"id":"1212.0101","kind":"arxiv","version":2}},"canonical_sha256":"d9b2588370df8183c3dd8c8532afd1ba4f404f88cca081a2aff78468200c5870","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9b2588370df8183c3dd8c8532afd1ba4f404f88cca081a2aff78468200c5870","first_computed_at":"2026-05-18T02:40:18.892774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:18.892774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fbiOe4Hl8nHDO49Il5YVqTwoh8YuWeuTnoqNSj6W+VXB8OD9wiY1YJO7SxwO05n8XN0PD6bbHymd09nKVBcoDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:18.893200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a272150d01f357dae9d33b95a7e5ef8399b06e9bcfa97cb62098986706f50e2","sha256:42dbc055d98643132a308d6c4b03f7f7f023e31dc78162c15b4ca081564d1468"],"state_sha256":"b0532c2c065294bec40bb6a57927aee74f1edd4449003ab5369a13f8ddd06ffd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXUe2QtHHrXannooLEYIYRISfW/vN7Dls619xPyTT4rZYgbq83QIDNRhSLiUbobDB1ITDfhzE2QMak+qdnHIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:39:14.537512Z","bundle_sha256":"ea2daa17e4d4ae12f9ca3938f1a983531f60b3316d4fdecf2b868d3780d26d78"}}