{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:PDWEQG3M2TRXEN2V6JWLI47ERC","short_pith_number":"pith:PDWEQG3M","schema_version":"1.0","canonical_sha256":"78ec481b6cd4e3723755f26cb473e488a38182f78048e0daf0c4bd728f458e8e","source":{"kind":"arxiv","id":"0807.0610","version":1},"attestation_state":"computed","paper":{"title":"Lightweight Security for Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CR","authors_text":"Joao Barros, Joao P. Vilela, Luisa Lima","submitted_at":"2008-07-03T18:21:29Z","abstract_excerpt":"Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits the inherent security provided by random linear network coding and offers the advantage of reduced overhead in comparison to traditional end-to-end encryption of the entire data. Confidentiality is achieved by protecting (or \"locking\") the source coefficients required to decode the encoded data, without preventing intermediate nodes from running their stand"},"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":"0807.0610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2008-07-03T18:21:29Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"9ed71e4c95d9a47cba3aa2d0341433a6f04ebca1e5d85df4374acd6fcce66cf0","abstract_canon_sha256":"7a00ce3846eb18ae81d5df90316c1136760186029c372ce527f8ff353f070372"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.522654Z","signature_b64":"Gqkb6azGj6kBNnCMlhOOJPZXfIcc4nYP4UeWDeGCRK5Rq4/L34NL/1XQkYjgWacf9wl388TcdGN1mJHykf4zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78ec481b6cd4e3723755f26cb473e488a38182f78048e0daf0c4bd728f458e8e","last_reissued_at":"2026-05-18T00:58:25.522041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.522041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lightweight Security for Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CR","authors_text":"Joao Barros, Joao P. Vilela, Luisa Lima","submitted_at":"2008-07-03T18:21:29Z","abstract_excerpt":"Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits the inherent security provided by random linear network coding and offers the advantage of reduced overhead in comparison to traditional end-to-end encryption of the entire data. Confidentiality is achieved by protecting (or \"locking\") the source coefficients required to decode the encoded data, without preventing intermediate nodes from running their stand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.0610","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":"0807.0610","created_at":"2026-05-18T00:58:25.522132+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.0610v1","created_at":"2026-05-18T00:58:25.522132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.0610","created_at":"2026-05-18T00:58:25.522132+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDWEQG3M2TRX","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDWEQG3M2TRXEN2V","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDWEQG3M","created_at":"2026-05-18T12:25:57.157939+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/PDWEQG3M2TRXEN2V6JWLI47ERC","json":"https://pith.science/pith/PDWEQG3M2TRXEN2V6JWLI47ERC.json","graph_json":"https://pith.science/api/pith-number/PDWEQG3M2TRXEN2V6JWLI47ERC/graph.json","events_json":"https://pith.science/api/pith-number/PDWEQG3M2TRXEN2V6JWLI47ERC/events.json","paper":"https://pith.science/paper/PDWEQG3M"},"agent_actions":{"view_html":"https://pith.science/pith/PDWEQG3M2TRXEN2V6JWLI47ERC","download_json":"https://pith.science/pith/PDWEQG3M2TRXEN2V6JWLI47ERC.json","view_paper":"https://pith.science/paper/PDWEQG3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.0610&json=true","fetch_graph":"https://pith.science/api/pith-number/PDWEQG3M2TRXEN2V6JWLI47ERC/graph.json","fetch_events":"https://pith.science/api/pith-number/PDWEQG3M2TRXEN2V6JWLI47ERC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDWEQG3M2TRXEN2V6JWLI47ERC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDWEQG3M2TRXEN2V6JWLI47ERC/action/storage_attestation","attest_author":"https://pith.science/pith/PDWEQG3M2TRXEN2V6JWLI47ERC/action/author_attestation","sign_citation":"https://pith.science/pith/PDWEQG3M2TRXEN2V6JWLI47ERC/action/citation_signature","submit_replication":"https://pith.science/pith/PDWEQG3M2TRXEN2V6JWLI47ERC/action/replication_record"}},"created_at":"2026-05-18T00:58:25.522132+00:00","updated_at":"2026-05-18T00:58:25.522132+00:00"}