{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GFZ6ZFZZ2N3VL55J5RM37AJTNW","short_pith_number":"pith:GFZ6ZFZZ","schema_version":"1.0","canonical_sha256":"3173ec9739d37755f7a9ec59bf81336d92915e69c4d30457d171ac49d94afe01","source":{"kind":"arxiv","id":"1801.01752","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.01752","created_at":"2026-05-18T00:26:41.116693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01752v1","created_at":"2026-05-18T00:26:41.116693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01752","created_at":"2026-05-18T00:26:41.116693+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFZ6ZFZZ2N3V","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFZ6ZFZZ2N3VL55J","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFZ6ZFZZ","created_at":"2026-05-18T12:32:25.280505+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/GFZ6ZFZZ2N3VL55J5RM37AJTNW","json":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW.json","graph_json":"https://pith.science/api/pith-number/GFZ6ZFZZ2N3VL55J5RM37AJTNW/graph.json","events_json":"https://pith.science/api/pith-number/GFZ6ZFZZ2N3VL55J5RM37AJTNW/events.json","paper":"https://pith.science/paper/GFZ6ZFZZ"},"agent_actions":{"view_html":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW","download_json":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW.json","view_paper":"https://pith.science/paper/GFZ6ZFZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01752&json=true","fetch_graph":"https://pith.science/api/pith-number/GFZ6ZFZZ2N3VL55J5RM37AJTNW/graph.json","fetch_events":"https://pith.science/api/pith-number/GFZ6ZFZZ2N3VL55J5RM37AJTNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/action/storage_attestation","attest_author":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/action/author_attestation","sign_citation":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/action/citation_signature","submit_replication":"https://pith.science/pith/GFZ6ZFZZ2N3VL55J5RM37AJTNW/action/replication_record"}},"created_at":"2026-05-18T00:26:41.116693+00:00","updated_at":"2026-05-18T00:26:41.116693+00:00"}