{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GFZ6ZFZZ2N3VL55J5RM37AJTNW","short_pith_number":"pith:GFZ6ZFZZ","canonical_record":{"source":{"id":"1801.01752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-05T13:39:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a36e00caa055f300314d840e6009e8f3d50a0ec0eaed3f1c12c39c700c66b9cc","abstract_canon_sha256":"4edb8a2f64e5f3f2904699fc499ccb8516ece40db04a95f9ac4a55957db43dce"},"schema_version":"1.0"},"canonical_sha256":"3173ec9739d37755f7a9ec59bf81336d92915e69c4d30457d171ac49d94afe01","source":{"kind":"arxiv","id":"1801.01752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01752","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01752v1","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01752","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"GFZ6ZFZZ2N3V","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GFZ6ZFZZ2N3VL55J","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GFZ6ZFZZ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GFZ6ZFZZ2N3VL55J5RM37AJTNW","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-05T13:39:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a36e00caa055f300314d840e6009e8f3d50a0ec0eaed3f1c12c39c700c66b9cc","abstract_canon_sha256":"4edb8a2f64e5f3f2904699fc499ccb8516ece40db04a95f9ac4a55957db43dce"},"schema_version":"1.0"},"canonical_sha256":"3173ec9739d37755f7a9ec59bf81336d92915e69c4d30457d171ac49d94afe01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:41.117228Z","signature_b64":"GxwUiHUhIQmZpKNy1HQj7OQ2HC3SJ81VyCP9b+LHvfRql8uxl45YCEsZn5cGMAtZ5mxCDz5fap8gV6u0m8yBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3173ec9739d37755f7a9ec59bf81336d92915e69c4d30457d171ac49d94afe01","last_reissued_at":"2026-05-18T00:26:41.116589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:41.116589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01752","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-18T00:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qz+yM/T7PNcfBYnEPNWYbqI2eeCvhJWEg4JReEh4JvOOztYyEbg1qKxnYO6Ejf3V1ofoIwwDoxrH4cGKdyVaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:05:22.143555Z"},"content_sha256":"0a007d0ae9c2ff49c4ba0586801c4bcdd0e8c974cdfdde62f6b0bf6ddbf26abc","schema_version":"1.0","event_id":"sha256:0a007d0ae9c2ff49c4ba0586801c4bcdd0e8c974cdfdde62f6b0bf6ddbf26abc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GFZ6ZFZZ2N3VL55J5RM37AJTNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the Secrecy of Distributed Storage Systems using Interference Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Natasa Paunkoska, Ninoslav Marina, Venceslav Kafedziski","submitted_at":"2018-01-05T13:39:22Z","abstract_excerpt":"Regenerating codes based on the approach of interference alignment for wireless interference channel achieve the cut-set bound for distributed storage systems. These codes provide data reliability, and perform efficient exact node repair when some node fails. Interference alignment as a concept is especially important to improve the repair efficiency of a failed node in a minimum storage regenerating (MSR) code. In addition it can improve the stored data security in presence of passive intruders. In this paper we construct a new code resilient against a threat model where a passive eavesdroppe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01752","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-18T00:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VygjVM1atP/D9kuYZQ5uheHP0iCHOGd2kJIJ91iJNdwK5iYACOHJQ8Np77zW909NlUn9ycp37bbtbZEWiQf3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:05:22.143896Z"},"content_sha256":"37b552382329a28adf5e5b525d92e5b6bc4a1b478c720f159ce848bcb1c1b032","schema_version":"1.0","event_id":"sha256:37b552382329a28adf5e5b525d92e5b6bc4a1b478c720f159ce848bcb1c1b032"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/bundle.json","state_url":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/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-07-03T15:05:22Z","links":{"resolver":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW","bundle":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/bundle.json","state":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GFZ6ZFZZ2N3VL55J5RM37AJTNW","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":"4edb8a2f64e5f3f2904699fc499ccb8516ece40db04a95f9ac4a55957db43dce","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-05T13:39:22Z","title_canon_sha256":"a36e00caa055f300314d840e6009e8f3d50a0ec0eaed3f1c12c39c700c66b9cc"},"schema_version":"1.0","source":{"id":"1801.01752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01752","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01752v1","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01752","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"GFZ6ZFZZ2N3V","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GFZ6ZFZZ2N3VL55J","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GFZ6ZFZZ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:37b552382329a28adf5e5b525d92e5b6bc4a1b478c720f159ce848bcb1c1b032","target":"graph","created_at":"2026-05-18T00:26:41Z","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":"Regenerating codes based on the approach of interference alignment for wireless interference channel achieve the cut-set bound for distributed storage systems. These codes provide data reliability, and perform efficient exact node repair when some node fails. Interference alignment as a concept is especially important to improve the repair efficiency of a failed node in a minimum storage regenerating (MSR) code. In addition it can improve the stored data security in presence of passive intruders. In this paper we construct a new code resilient against a threat model where a passive eavesdroppe","authors_text":"Natasa Paunkoska, Ninoslav Marina, Venceslav Kafedziski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-05T13:39:22Z","title":"Improving the Secrecy of Distributed Storage Systems using Interference Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01752","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:0a007d0ae9c2ff49c4ba0586801c4bcdd0e8c974cdfdde62f6b0bf6ddbf26abc","target":"record","created_at":"2026-05-18T00:26:41Z","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":"4edb8a2f64e5f3f2904699fc499ccb8516ece40db04a95f9ac4a55957db43dce","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-05T13:39:22Z","title_canon_sha256":"a36e00caa055f300314d840e6009e8f3d50a0ec0eaed3f1c12c39c700c66b9cc"},"schema_version":"1.0","source":{"id":"1801.01752","kind":"arxiv","version":1}},"canonical_sha256":"3173ec9739d37755f7a9ec59bf81336d92915e69c4d30457d171ac49d94afe01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3173ec9739d37755f7a9ec59bf81336d92915e69c4d30457d171ac49d94afe01","first_computed_at":"2026-05-18T00:26:41.116589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:41.116589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GxwUiHUhIQmZpKNy1HQj7OQ2HC3SJ81VyCP9b+LHvfRql8uxl45YCEsZn5cGMAtZ5mxCDz5fap8gV6u0m8yBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:41.117228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a007d0ae9c2ff49c4ba0586801c4bcdd0e8c974cdfdde62f6b0bf6ddbf26abc","sha256:37b552382329a28adf5e5b525d92e5b6bc4a1b478c720f159ce848bcb1c1b032"],"state_sha256":"eef4aed1df1f644d80a98f505517276c7c08e6bbbb0ff3baa3fe8fcb4079f92b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6d/zef2ziRSWZVgVeEi6uCVTJqkKF3mn4SbenEZYGvlAX6veTBq0BdDx8+IvAEXmLdoPkSTecaZwO6FW5BfgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T15:05:22.145684Z","bundle_sha256":"93b85a3954650391dfaa0e2a0aee75ef8bcfba81c65a3b152fa90a420d3a50e2"}}