{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FBRZKNZBGHA3YNOJOCHB32WTLE","short_pith_number":"pith:FBRZKNZB","canonical_record":{"source":{"id":"1410.3214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-13T08:16:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e716e36b898e2d60c5c1323d5fcc51d9b5393c348975eeda49b0e5860a35801","abstract_canon_sha256":"c672bbe9a7247c87c532e834da1042bc85839aa72e149613933f5bca90fe4fa0"},"schema_version":"1.0"},"canonical_sha256":"286395372131c1bc35c9708e1dead35925436f37cc89b16b878019a8710c5656","source":{"kind":"arxiv","id":"1410.3214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3214","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3214v1","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3214","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"FBRZKNZBGHA3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FBRZKNZBGHA3YNOJ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FBRZKNZB","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FBRZKNZBGHA3YNOJOCHB32WTLE","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-13T08:16:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e716e36b898e2d60c5c1323d5fcc51d9b5393c348975eeda49b0e5860a35801","abstract_canon_sha256":"c672bbe9a7247c87c532e834da1042bc85839aa72e149613933f5bca90fe4fa0"},"schema_version":"1.0"},"canonical_sha256":"286395372131c1bc35c9708e1dead35925436f37cc89b16b878019a8710c5656","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:11.828748Z","signature_b64":"kpclDeY+R7yAC4AQfWaawiH0ejBJmY8aZoGGvMmxGoSVpN9BE47NN/8/GEc4jK+AGzjglJxzdNnjLscI5UnRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"286395372131c1bc35c9708e1dead35925436f37cc89b16b878019a8710c5656","last_reissued_at":"2026-05-18T02:40:11.828172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:11.828172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3214","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TVd9lSZQ+WBG+7M7RfeVFaBacwr/sXo28+LwIwU8kH2paa6fxI3GAB8gTI3PHi9/WYg7A27ko4nZy6ZBsrpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:42:31.679886Z"},"content_sha256":"68255df2b9e0b2d5d3d16fd3944db979867f37ff95a349ae4591b45011aafa1c","schema_version":"1.0","event_id":"sha256:68255df2b9e0b2d5d3d16fd3944db979867f37ff95a349ae4591b45011aafa1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FBRZKNZBGHA3YNOJOCHB32WTLE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Erasure Codes With Partial Decodability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2014-10-13T08:16:00Z","abstract_excerpt":"The MDS property (aka the $k$-out-of-$n$ property) requires that if a file is split into several symbols and subsequently encoded into $n$ coded symbols, each being stored in one storage node of a distributed storage system (DSS), then an user can recover the file by accessing any $k$ nodes. We study the so-called $p$-decodable $\\mu$-secure erasure coding scheme $(1 \\leq p \\leq k - \\mu, 0 \\leq \\mu < k, p | (k-\\mu))$, which satisfies the MDS property and the following additional properties:\n  (P1) strongly secure up to a threshold: an adversary which eavesdrops at most $\\mu$ storage nodes gains"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3214","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xqkOrBXEUj8x0JSVBw5rDktvbvk+nBTon5jFrAhRkpDVkzxSE1XklsaLoXS5GY2YfVr0JkhbKwu24idzxZ+3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:42:31.680245Z"},"content_sha256":"ce21efc8101daad04c4ef118f2cfea6f5a4dc8de48c3f7c5199bfc017a77233a","schema_version":"1.0","event_id":"sha256:ce21efc8101daad04c4ef118f2cfea6f5a4dc8de48c3f7c5199bfc017a77233a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/bundle.json","state_url":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/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-03T22:42:31Z","links":{"resolver":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE","bundle":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/bundle.json","state":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FBRZKNZBGHA3YNOJOCHB32WTLE","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":"c672bbe9a7247c87c532e834da1042bc85839aa72e149613933f5bca90fe4fa0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-13T08:16:00Z","title_canon_sha256":"0e716e36b898e2d60c5c1323d5fcc51d9b5393c348975eeda49b0e5860a35801"},"schema_version":"1.0","source":{"id":"1410.3214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3214","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3214v1","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3214","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"FBRZKNZBGHA3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FBRZKNZBGHA3YNOJ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FBRZKNZB","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:ce21efc8101daad04c4ef118f2cfea6f5a4dc8de48c3f7c5199bfc017a77233a","target":"graph","created_at":"2026-05-18T02:40:11Z","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":"The MDS property (aka the $k$-out-of-$n$ property) requires that if a file is split into several symbols and subsequently encoded into $n$ coded symbols, each being stored in one storage node of a distributed storage system (DSS), then an user can recover the file by accessing any $k$ nodes. We study the so-called $p$-decodable $\\mu$-secure erasure coding scheme $(1 \\leq p \\leq k - \\mu, 0 \\leq \\mu < k, p | (k-\\mu))$, which satisfies the MDS property and the following additional properties:\n  (P1) strongly secure up to a threshold: an adversary which eavesdrops at most $\\mu$ storage nodes gains","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-13T08:16:00Z","title":"Secure Erasure Codes With Partial Decodability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3214","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:68255df2b9e0b2d5d3d16fd3944db979867f37ff95a349ae4591b45011aafa1c","target":"record","created_at":"2026-05-18T02:40:11Z","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":"c672bbe9a7247c87c532e834da1042bc85839aa72e149613933f5bca90fe4fa0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-13T08:16:00Z","title_canon_sha256":"0e716e36b898e2d60c5c1323d5fcc51d9b5393c348975eeda49b0e5860a35801"},"schema_version":"1.0","source":{"id":"1410.3214","kind":"arxiv","version":1}},"canonical_sha256":"286395372131c1bc35c9708e1dead35925436f37cc89b16b878019a8710c5656","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"286395372131c1bc35c9708e1dead35925436f37cc89b16b878019a8710c5656","first_computed_at":"2026-05-18T02:40:11.828172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:11.828172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kpclDeY+R7yAC4AQfWaawiH0ejBJmY8aZoGGvMmxGoSVpN9BE47NN/8/GEc4jK+AGzjglJxzdNnjLscI5UnRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:11.828748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68255df2b9e0b2d5d3d16fd3944db979867f37ff95a349ae4591b45011aafa1c","sha256:ce21efc8101daad04c4ef118f2cfea6f5a4dc8de48c3f7c5199bfc017a77233a"],"state_sha256":"0540b96439fceacad3805226e88aba5a180aee62203fb882b752d59f6c5ef418"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnkUGaXmqxez8tB5IZYfXutqvZEfQLPxKOHT57OTUnm4Ph7wxYuefe0TLTYG7mnyp/Fcxrqe+G7kfP6LzfFNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:42:31.682212Z","bundle_sha256":"990b907932d6cb251c6c33a19eced62f87ace42b033cc0bf27049d153eb7d4b4"}}