{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SZTOK3TREQ6SD6TVHQCOXGWI4M","short_pith_number":"pith:SZTOK3TR","canonical_record":{"source":{"id":"1407.7011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-25T19:22:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1ee5006eec7847b4022fdb48d0ffc72b91eed803288465285764a92954fe83b5","abstract_canon_sha256":"e921586c550d487e61d5e6c3d5b471603634b6d1589f96f0bb2615f20b7018a9"},"schema_version":"1.0"},"canonical_sha256":"9666e56e71243d21fa753c04eb9ac8e33027b270a0334d3aa098b876f5c3ae43","source":{"kind":"arxiv","id":"1407.7011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7011","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7011v1","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7011","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"SZTOK3TREQ6S","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SZTOK3TREQ6SD6TV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SZTOK3TR","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SZTOK3TREQ6SD6TVHQCOXGWI4M","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-25T19:22:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1ee5006eec7847b4022fdb48d0ffc72b91eed803288465285764a92954fe83b5","abstract_canon_sha256":"e921586c550d487e61d5e6c3d5b471603634b6d1589f96f0bb2615f20b7018a9"},"schema_version":"1.0"},"canonical_sha256":"9666e56e71243d21fa753c04eb9ac8e33027b270a0334d3aa098b876f5c3ae43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:31.899665Z","signature_b64":"+0DwPA12cywYRWwBpvD26I0Ewzq+YBsI+LVMwPFPYWDy1cjeMd7dVo3FQF+E2UH7PVLweq3y8xO3Mm80GsDxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9666e56e71243d21fa753c04eb9ac8e33027b270a0334d3aa098b876f5c3ae43","last_reissued_at":"2026-05-18T02:46:31.899220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:31.899220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7011","source_version":1,"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:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUDFkzrSKjMpdvZYtkihzOonaY3fpxqtqlxden+nw0kAlxLS/VGcJ769h4SG/cay/Gd3NF3lymjJRuKQ5BurBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:34:34.319701Z"},"content_sha256":"df50a112535882b73236112beb8cd0eef354b7f0ddd51f633b2fba3b71de7716","schema_version":"1.0","event_id":"sha256:df50a112535882b73236112beb8cd0eef354b7f0ddd51f633b2fba3b71de7716"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SZTOK3TREQ6SD6TVHQCOXGWI4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Key Pre-Distribution Scheme based on Multiple Block Codes for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Farshad Lahouti, Hamidreza Arjmandi","submitted_at":"2014-07-25T19:22:36Z","abstract_excerpt":"A key pre-distribution scheme (KPS) based on multiple codewords of block codes is presented for wireless sensor networks. The connectivity and security of the proposed KPS, quantified in terms of probabilities of sharing common keys for communications of pairs of nodes and their resilience against colluding nodes, are analytically assessed. The analysis is applicable to both linear and nonlinear codes and is simplified in the case of maximum distance separable codes. It is shown that the multiplicity of codes significantly enhances the security and connectivity of KPS at the cost of a modest i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7011","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"},"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:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvcYx8tsDWVGuPszvwFxvBY/NEDqxlJxneDT3AD4EIfvaYJjqeqRUy4VaG+qXL1G0e5VYUqL+2fZyY5LVyLFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:34:34.320388Z"},"content_sha256":"72ea35d95bb8ce87deaef839ef6a0f7acd9fd72c7adb414e73a32a917c21c06c","schema_version":"1.0","event_id":"sha256:72ea35d95bb8ce87deaef839ef6a0f7acd9fd72c7adb414e73a32a917c21c06c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZTOK3TREQ6SD6TVHQCOXGWI4M/bundle.json","state_url":"https://pith.science/pith/SZTOK3TREQ6SD6TVHQCOXGWI4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZTOK3TREQ6SD6TVHQCOXGWI4M/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-06-07T20:34:34Z","links":{"resolver":"https://pith.science/pith/SZTOK3TREQ6SD6TVHQCOXGWI4M","bundle":"https://pith.science/pith/SZTOK3TREQ6SD6TVHQCOXGWI4M/bundle.json","state":"https://pith.science/pith/SZTOK3TREQ6SD6TVHQCOXGWI4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZTOK3TREQ6SD6TVHQCOXGWI4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SZTOK3TREQ6SD6TVHQCOXGWI4M","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":"e921586c550d487e61d5e6c3d5b471603634b6d1589f96f0bb2615f20b7018a9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-25T19:22:36Z","title_canon_sha256":"1ee5006eec7847b4022fdb48d0ffc72b91eed803288465285764a92954fe83b5"},"schema_version":"1.0","source":{"id":"1407.7011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7011","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7011v1","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7011","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"SZTOK3TREQ6S","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SZTOK3TREQ6SD6TV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SZTOK3TR","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:72ea35d95bb8ce87deaef839ef6a0f7acd9fd72c7adb414e73a32a917c21c06c","target":"graph","created_at":"2026-05-18T02:46:31Z","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":"A key pre-distribution scheme (KPS) based on multiple codewords of block codes is presented for wireless sensor networks. The connectivity and security of the proposed KPS, quantified in terms of probabilities of sharing common keys for communications of pairs of nodes and their resilience against colluding nodes, are analytically assessed. The analysis is applicable to both linear and nonlinear codes and is simplified in the case of maximum distance separable codes. It is shown that the multiplicity of codes significantly enhances the security and connectivity of KPS at the cost of a modest i","authors_text":"Farshad Lahouti, Hamidreza Arjmandi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-25T19:22:36Z","title":"A Key Pre-Distribution Scheme based on Multiple Block Codes for Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7011","kind":"arxiv","version":1},"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:df50a112535882b73236112beb8cd0eef354b7f0ddd51f633b2fba3b71de7716","target":"record","created_at":"2026-05-18T02:46:31Z","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":"e921586c550d487e61d5e6c3d5b471603634b6d1589f96f0bb2615f20b7018a9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-25T19:22:36Z","title_canon_sha256":"1ee5006eec7847b4022fdb48d0ffc72b91eed803288465285764a92954fe83b5"},"schema_version":"1.0","source":{"id":"1407.7011","kind":"arxiv","version":1}},"canonical_sha256":"9666e56e71243d21fa753c04eb9ac8e33027b270a0334d3aa098b876f5c3ae43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9666e56e71243d21fa753c04eb9ac8e33027b270a0334d3aa098b876f5c3ae43","first_computed_at":"2026-05-18T02:46:31.899220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:31.899220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+0DwPA12cywYRWwBpvD26I0Ewzq+YBsI+LVMwPFPYWDy1cjeMd7dVo3FQF+E2UH7PVLweq3y8xO3Mm80GsDxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:31.899665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df50a112535882b73236112beb8cd0eef354b7f0ddd51f633b2fba3b71de7716","sha256:72ea35d95bb8ce87deaef839ef6a0f7acd9fd72c7adb414e73a32a917c21c06c"],"state_sha256":"600df425a288b6cba6e28562bb3a5d6fa64f80ddb0c3f78f68c54ca18cfdd7a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ke0H0Vc0cCXOTCurPc45STFIGWOXgZ438YosTy+aPNW/0XbsIl5R1kkkUhy1gPY26Kg/GGKODO+nAEarV18Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:34:34.324046Z","bundle_sha256":"ffae6a1ab99727fd3364d80f744e0e580489adba824a0a79234dcffee094f7c9"}}