{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:672XLQSHCFH7CASM2XN5BQ45VT","short_pith_number":"pith:672XLQSH","canonical_record":{"source":{"id":"1811.08644","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-21T09:17:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cb18d799a03b42ad3ad575ceae2711ffdeaab992e2480e0474cd7c4995546f41","abstract_canon_sha256":"583161c9eec70e2cccb782e1a8bcb5840cf5ac843fe90abfc3046078b2ff85fd"},"schema_version":"1.0"},"canonical_sha256":"f7f575c247114ff1024cd5dbd0c39dacc3ce312e4af0544f3f34ef75b51f4070","source":{"kind":"arxiv","id":"1811.08644","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08644","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08644v3","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08644","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"672XLQSHCFH7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"672XLQSHCFH7CASM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"672XLQSH","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:672XLQSHCFH7CASM2XN5BQ45VT","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08644","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-21T09:17:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cb18d799a03b42ad3ad575ceae2711ffdeaab992e2480e0474cd7c4995546f41","abstract_canon_sha256":"583161c9eec70e2cccb782e1a8bcb5840cf5ac843fe90abfc3046078b2ff85fd"},"schema_version":"1.0"},"canonical_sha256":"f7f575c247114ff1024cd5dbd0c39dacc3ce312e4af0544f3f34ef75b51f4070","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:40.868332Z","signature_b64":"Sj1qts+XbprcwWsk8j6YX+ncGoiIqqUSS6km9cjFegnyRdxz5UYVbWmXROVCIq7YueK5I7pYHzs7qT7p9YkiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f575c247114ff1024cd5dbd0c39dacc3ce312e4af0544f3f34ef75b51f4070","last_reissued_at":"2026-05-17T23:50:40.867894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:40.867894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08644","source_version":3,"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-17T23:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06mFBmr/YB7jnmKMmAWIMJF7TiIqMW7FdFv72dk8Ys7DMD1jmP0v3+xq0n60v8qLvVenP7dKHvadlDDvr/p4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:58:40.275521Z"},"content_sha256":"4b2af8b73d52b5ea7a1908b9659d30070be05db462fe24b31a15c889e8eeebf1","schema_version":"1.0","event_id":"sha256:4b2af8b73d52b5ea7a1908b9659d30070be05db462fe24b31a15c889e8eeebf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:672XLQSHCFH7CASM2XN5BQ45VT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Intercept Probability Minimization under Sparse Random Linear Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Tassi, Andrew Nix, Robert J. Piechocki","submitted_at":"2018-11-21T09:17:56Z","abstract_excerpt":"This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of Random Linear Network Coding (RLNC). A tight approximation to the probability of the eavesdropper recovering the source message is provided. The proposed approximation applies to both the cases where transmissions occur without feedback or where the reliability of the feedback channel is impaired by an eavesdropper jamming the feedback channel. An optimization framework for min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08644","kind":"arxiv","version":3},"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-17T23:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMJClyaO9RxZnWXRMuwXZYAK+FHbALill0LMSrDEJ1BnUfy9M8/2LthFEJE35QX24hY/9jllc6vnVWwcGL6dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:58:40.275868Z"},"content_sha256":"e7dfb46b40d646314f676b5c15bac78bf41f1c9b598b28454cb3406a12b399b9","schema_version":"1.0","event_id":"sha256:e7dfb46b40d646314f676b5c15bac78bf41f1c9b598b28454cb3406a12b399b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/672XLQSHCFH7CASM2XN5BQ45VT/bundle.json","state_url":"https://pith.science/pith/672XLQSHCFH7CASM2XN5BQ45VT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/672XLQSHCFH7CASM2XN5BQ45VT/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-05T15:58:40Z","links":{"resolver":"https://pith.science/pith/672XLQSHCFH7CASM2XN5BQ45VT","bundle":"https://pith.science/pith/672XLQSHCFH7CASM2XN5BQ45VT/bundle.json","state":"https://pith.science/pith/672XLQSHCFH7CASM2XN5BQ45VT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/672XLQSHCFH7CASM2XN5BQ45VT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:672XLQSHCFH7CASM2XN5BQ45VT","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":"583161c9eec70e2cccb782e1a8bcb5840cf5ac843fe90abfc3046078b2ff85fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-21T09:17:56Z","title_canon_sha256":"cb18d799a03b42ad3ad575ceae2711ffdeaab992e2480e0474cd7c4995546f41"},"schema_version":"1.0","source":{"id":"1811.08644","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08644","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08644v3","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08644","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"672XLQSHCFH7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"672XLQSHCFH7CASM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"672XLQSH","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:e7dfb46b40d646314f676b5c15bac78bf41f1c9b598b28454cb3406a12b399b9","target":"graph","created_at":"2026-05-17T23:50:40Z","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":"This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of Random Linear Network Coding (RLNC). A tight approximation to the probability of the eavesdropper recovering the source message is provided. The proposed approximation applies to both the cases where transmissions occur without feedback or where the reliability of the feedback channel is impaired by an eavesdropper jamming the feedback channel. An optimization framework for min","authors_text":"Andrea Tassi, Andrew Nix, Robert J. Piechocki","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-21T09:17:56Z","title":"On Intercept Probability Minimization under Sparse Random Linear Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08644","kind":"arxiv","version":3},"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:4b2af8b73d52b5ea7a1908b9659d30070be05db462fe24b31a15c889e8eeebf1","target":"record","created_at":"2026-05-17T23:50:40Z","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":"583161c9eec70e2cccb782e1a8bcb5840cf5ac843fe90abfc3046078b2ff85fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-21T09:17:56Z","title_canon_sha256":"cb18d799a03b42ad3ad575ceae2711ffdeaab992e2480e0474cd7c4995546f41"},"schema_version":"1.0","source":{"id":"1811.08644","kind":"arxiv","version":3}},"canonical_sha256":"f7f575c247114ff1024cd5dbd0c39dacc3ce312e4af0544f3f34ef75b51f4070","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7f575c247114ff1024cd5dbd0c39dacc3ce312e4af0544f3f34ef75b51f4070","first_computed_at":"2026-05-17T23:50:40.867894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:40.867894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sj1qts+XbprcwWsk8j6YX+ncGoiIqqUSS6km9cjFegnyRdxz5UYVbWmXROVCIq7YueK5I7pYHzs7qT7p9YkiDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:40.868332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08644","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b2af8b73d52b5ea7a1908b9659d30070be05db462fe24b31a15c889e8eeebf1","sha256:e7dfb46b40d646314f676b5c15bac78bf41f1c9b598b28454cb3406a12b399b9"],"state_sha256":"92a37e91699a421980e28cf749fab871ab9a0178f010fa61eedc78e3ba51b873"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Xf6qjNYh7uQ/Ol9puerQdog5kwoAIktxom6I9gX9neoEoMFCH6QGvxvzg7TU0YJSq+Ws2ul0FAKxYHW6lUBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:58:40.277807Z","bundle_sha256":"36daff1ced4f07801110b40008d503aa2d3954bc0cbce159eed8e9c922acdf35"}}