{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3GZFRA3Q36AYHQ65RSCTFL6RXJ","short_pith_number":"pith:3GZFRA3Q","schema_version":"1.0","canonical_sha256":"d9b2588370df8183c3dd8c8532afd1ba4f404f88cca081a2aff78468200c5870","source":{"kind":"arxiv","id":"1212.0101","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.0101","created_at":"2026-05-18T02:40:18.892839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0101v2","created_at":"2026-05-18T02:40:18.892839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0101","created_at":"2026-05-18T02:40:18.892839+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GZFRA3Q36AY","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GZFRA3Q36AYHQ65","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GZFRA3Q","created_at":"2026-05-18T12:26:50.516681+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/3GZFRA3Q36AYHQ65RSCTFL6RXJ","json":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ.json","graph_json":"https://pith.science/api/pith-number/3GZFRA3Q36AYHQ65RSCTFL6RXJ/graph.json","events_json":"https://pith.science/api/pith-number/3GZFRA3Q36AYHQ65RSCTFL6RXJ/events.json","paper":"https://pith.science/paper/3GZFRA3Q"},"agent_actions":{"view_html":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ","download_json":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ.json","view_paper":"https://pith.science/paper/3GZFRA3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0101&json=true","fetch_graph":"https://pith.science/api/pith-number/3GZFRA3Q36AYHQ65RSCTFL6RXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3GZFRA3Q36AYHQ65RSCTFL6RXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/action/storage_attestation","attest_author":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/action/author_attestation","sign_citation":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/action/citation_signature","submit_replication":"https://pith.science/pith/3GZFRA3Q36AYHQ65RSCTFL6RXJ/action/replication_record"}},"created_at":"2026-05-18T02:40:18.892839+00:00","updated_at":"2026-05-18T02:40:18.892839+00:00"}