{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XAUQOTFPTUKVSBDXFNBZDJ53SU","short_pith_number":"pith:XAUQOTFP","schema_version":"1.0","canonical_sha256":"b829074caf9d155904772b4391a7bb95197cc6dd9a7e387b2d237026e6bb9249","source":{"kind":"arxiv","id":"1601.04503","version":2},"attestation_state":"computed","paper":{"title":"Secure Network Coding over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xuan Guang","submitted_at":"2016-01-18T13:22:35Z","abstract_excerpt":"In the paradigm of network coding, the information-theoretic security problem is encountered in the presence of a wiretapper, who has capability of accessing an unknown channel-subset in communication networks. In order to combat this eavesdropping attack, secure network coding is introduced to prevent information from being leaked to adversaries. For any construction of secure linear network codes (SLNCs) over a wiretap network, the based field size is a very important index, because it largely determines the computational and space complexities, and further the efficiency of network transmis"},"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":"1601.04503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:22:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"31c13dcf5ed1a9f23ccd21ba33073a5adfa64f4c9bf92466504db7a5cb7d0efa","abstract_canon_sha256":"96d5d4261d47fa8ab6fbef0f146c36e1d6279952edb2de7087d925c8c15680e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:46.501097Z","signature_b64":"++4vNcM42F3pVoDCARhhqaIDNnbUFXoT1Ou85/tqtIZ58YK9JM9SEfDDB70ZdoYvhud9oR+NORtiIuWqWRhZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b829074caf9d155904772b4391a7bb95197cc6dd9a7e387b2d237026e6bb9249","last_reissued_at":"2026-05-18T00:56:46.500402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:46.500402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Network Coding over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xuan Guang","submitted_at":"2016-01-18T13:22:35Z","abstract_excerpt":"In the paradigm of network coding, the information-theoretic security problem is encountered in the presence of a wiretapper, who has capability of accessing an unknown channel-subset in communication networks. In order to combat this eavesdropping attack, secure network coding is introduced to prevent information from being leaked to adversaries. For any construction of secure linear network codes (SLNCs) over a wiretap network, the based field size is a very important index, because it largely determines the computational and space complexities, and further the efficiency of network transmis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04503","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":"1601.04503","created_at":"2026-05-18T00:56:46.500512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04503v2","created_at":"2026-05-18T00:56:46.500512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04503","created_at":"2026-05-18T00:56:46.500512+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAUQOTFPTUKV","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAUQOTFPTUKVSBDX","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAUQOTFP","created_at":"2026-05-18T12:30:51.357362+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/XAUQOTFPTUKVSBDXFNBZDJ53SU","json":"https://pith.science/pith/XAUQOTFPTUKVSBDXFNBZDJ53SU.json","graph_json":"https://pith.science/api/pith-number/XAUQOTFPTUKVSBDXFNBZDJ53SU/graph.json","events_json":"https://pith.science/api/pith-number/XAUQOTFPTUKVSBDXFNBZDJ53SU/events.json","paper":"https://pith.science/paper/XAUQOTFP"},"agent_actions":{"view_html":"https://pith.science/pith/XAUQOTFPTUKVSBDXFNBZDJ53SU","download_json":"https://pith.science/pith/XAUQOTFPTUKVSBDXFNBZDJ53SU.json","view_paper":"https://pith.science/paper/XAUQOTFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04503&json=true","fetch_graph":"https://pith.science/api/pith-number/XAUQOTFPTUKVSBDXFNBZDJ53SU/graph.json","fetch_events":"https://pith.science/api/pith-number/XAUQOTFPTUKVSBDXFNBZDJ53SU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAUQOTFPTUKVSBDXFNBZDJ53SU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAUQOTFPTUKVSBDXFNBZDJ53SU/action/storage_attestation","attest_author":"https://pith.science/pith/XAUQOTFPTUKVSBDXFNBZDJ53SU/action/author_attestation","sign_citation":"https://pith.science/pith/XAUQOTFPTUKVSBDXFNBZDJ53SU/action/citation_signature","submit_replication":"https://pith.science/pith/XAUQOTFPTUKVSBDXFNBZDJ53SU/action/replication_record"}},"created_at":"2026-05-18T00:56:46.500512+00:00","updated_at":"2026-05-18T00:56:46.500512+00:00"}