{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:K5UC6HNCNMXDXJYX5YOCNLEAMV","short_pith_number":"pith:K5UC6HNC","schema_version":"1.0","canonical_sha256":"57682f1da26b2e3ba717ee1c26ac80655508ab6a34af3e0218d8f9744c5efefe","source":{"kind":"arxiv","id":"1208.4390","version":1},"attestation_state":"computed","paper":{"title":"On secure network coding with uniform wiretap sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joerg Kliewer, Michael Langberg, Tracey Ho, Wentao Huang","submitted_at":"2012-08-21T21:19:35Z","abstract_excerpt":"This paper shows determining the secrecy capacity of a unicast network with uniform wiretap sets is at least as difficult as the k-unicast problem. In particular, we show that a general k-unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single unicast network with uniform link capacities and one arbitrary wiretap link."},"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":"1208.4390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-21T21:19:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aaf8a3e0442847b7b7bbc8aefe98f1d18a57e459c51af2f17418cd37f92dcaf9","abstract_canon_sha256":"34c7937defb9100d44126020e76c6b8ae2289b68cf9cd5d3f9b96bd2509f12f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.835786Z","signature_b64":"YlofvEXtlHgRRGyDOP7XmVcExOj6d39HUXIxJXVTXoEDhdsmJLJHwRhQlzdJsdes9LZMGGbi4J1n49owU4kaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57682f1da26b2e3ba717ee1c26ac80655508ab6a34af3e0218d8f9744c5efefe","last_reissued_at":"2026-05-18T02:21:00.835253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.835253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On secure network coding with uniform wiretap sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joerg Kliewer, Michael Langberg, Tracey Ho, Wentao Huang","submitted_at":"2012-08-21T21:19:35Z","abstract_excerpt":"This paper shows determining the secrecy capacity of a unicast network with uniform wiretap sets is at least as difficult as the k-unicast problem. In particular, we show that a general k-unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single unicast network with uniform link capacities and one arbitrary wiretap link."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4390","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.4390","created_at":"2026-05-18T02:21:00.835330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4390v1","created_at":"2026-05-18T02:21:00.835330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4390","created_at":"2026-05-18T02:21:00.835330+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5UC6HNCNMXD","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5UC6HNCNMXDXJYX","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5UC6HNC","created_at":"2026-05-18T12:27:11.947152+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/K5UC6HNCNMXDXJYX5YOCNLEAMV","json":"https://pith.science/pith/K5UC6HNCNMXDXJYX5YOCNLEAMV.json","graph_json":"https://pith.science/api/pith-number/K5UC6HNCNMXDXJYX5YOCNLEAMV/graph.json","events_json":"https://pith.science/api/pith-number/K5UC6HNCNMXDXJYX5YOCNLEAMV/events.json","paper":"https://pith.science/paper/K5UC6HNC"},"agent_actions":{"view_html":"https://pith.science/pith/K5UC6HNCNMXDXJYX5YOCNLEAMV","download_json":"https://pith.science/pith/K5UC6HNCNMXDXJYX5YOCNLEAMV.json","view_paper":"https://pith.science/paper/K5UC6HNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4390&json=true","fetch_graph":"https://pith.science/api/pith-number/K5UC6HNCNMXDXJYX5YOCNLEAMV/graph.json","fetch_events":"https://pith.science/api/pith-number/K5UC6HNCNMXDXJYX5YOCNLEAMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5UC6HNCNMXDXJYX5YOCNLEAMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5UC6HNCNMXDXJYX5YOCNLEAMV/action/storage_attestation","attest_author":"https://pith.science/pith/K5UC6HNCNMXDXJYX5YOCNLEAMV/action/author_attestation","sign_citation":"https://pith.science/pith/K5UC6HNCNMXDXJYX5YOCNLEAMV/action/citation_signature","submit_replication":"https://pith.science/pith/K5UC6HNCNMXDXJYX5YOCNLEAMV/action/replication_record"}},"created_at":"2026-05-18T02:21:00.835330+00:00","updated_at":"2026-05-18T02:21:00.835330+00:00"}