{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WAQQBP6YRY223VVVXVYK23SAJS","short_pith_number":"pith:WAQQBP6Y","canonical_record":{"source":{"id":"1610.08223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-26T08:03:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11906c41d098a5cb7350a022f348a20e7dc4107bbc7eabbd7fdbc1827559ec7a","abstract_canon_sha256":"0b5a33943ce50c76b5bd98c68f8cfcfe33fc5d38f6c0fef23b3694c960f263ac"},"schema_version":"1.0"},"canonical_sha256":"b02100bfd88e35add6b5bd70ad6e404cb9ad2bed9ebbebe3b39041b019682b68","source":{"kind":"arxiv","id":"1610.08223","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08223","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08223v1","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08223","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"WAQQBP6YRY22","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WAQQBP6YRY223VVV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WAQQBP6Y","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WAQQBP6YRY223VVVXVYK23SAJS","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-26T08:03:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11906c41d098a5cb7350a022f348a20e7dc4107bbc7eabbd7fdbc1827559ec7a","abstract_canon_sha256":"0b5a33943ce50c76b5bd98c68f8cfcfe33fc5d38f6c0fef23b3694c960f263ac"},"schema_version":"1.0"},"canonical_sha256":"b02100bfd88e35add6b5bd70ad6e404cb9ad2bed9ebbebe3b39041b019682b68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:14.669802Z","signature_b64":"LwFHc8+35t8BZ44dEFDsr0BnZelZ9kgX8R6l8WMkUx94mokFoQ+ma5d9ehDRmBP0OL9uFSfxrxrlij5r6cRUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b02100bfd88e35add6b5bd70ad6e404cb9ad2bed9ebbebe3b39041b019682b68","last_reissued_at":"2026-05-18T01:01:14.669144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:14.669144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08223","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-18T01:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HU2RH+vU5DROE4lHVu9RJpy36E8UkC88KxGG4Ud0rLzozjKbV5CT6IsKJSq2ra7z0hLGzSwig06Ly2v1AstgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:19:31.414327Z"},"content_sha256":"48a2dbae180a13fc2dd8fc41df308940bd38d20eb0a16d63422ad327bb12dcbe","schema_version":"1.0","event_id":"sha256:48a2dbae180a13fc2dd8fc41df308940bd38d20eb0a16d63422ad327bb12dcbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WAQQBP6YRY223VVVXVYK23SAJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Piggybacking Design for Systematic MDS Storage Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chong Shangguan, Gennian Ge","submitted_at":"2016-10-26T08:03:07Z","abstract_excerpt":"Distributed storage codes have important applications in the design of modern storage systems. In a distributed storage system, every storage node has a probability to fail and once an individual storage node fails, it must be reconstructed using data stored in the surviving nodes. Computation load and network bandwidth are two important issues we need to concern when repairing a failed node. The traditional maximal distance separable (MDS) storage codes have low repair complexity but high repair bandwidth. On the contrary, minimal storage regenerating (MSR) codes have low repair bandwidth but"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08223","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-18T01:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbXL7dyfTsLlKAJFcWWtCjFJ/9H1y7boPmUUGB1gpO15I4M1YFnljKpwH3FXL9ZIuhURy/lzuHpIVOkVECHrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:19:31.414680Z"},"content_sha256":"5e7e8cd567bab22bc0b3fe61730993c1888cf0b5a4e10dc7e074e08712ef4c6f","schema_version":"1.0","event_id":"sha256:5e7e8cd567bab22bc0b3fe61730993c1888cf0b5a4e10dc7e074e08712ef4c6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAQQBP6YRY223VVVXVYK23SAJS/bundle.json","state_url":"https://pith.science/pith/WAQQBP6YRY223VVVXVYK23SAJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAQQBP6YRY223VVVXVYK23SAJS/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-02T04:19:31Z","links":{"resolver":"https://pith.science/pith/WAQQBP6YRY223VVVXVYK23SAJS","bundle":"https://pith.science/pith/WAQQBP6YRY223VVVXVYK23SAJS/bundle.json","state":"https://pith.science/pith/WAQQBP6YRY223VVVXVYK23SAJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAQQBP6YRY223VVVXVYK23SAJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WAQQBP6YRY223VVVXVYK23SAJS","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":"0b5a33943ce50c76b5bd98c68f8cfcfe33fc5d38f6c0fef23b3694c960f263ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-26T08:03:07Z","title_canon_sha256":"11906c41d098a5cb7350a022f348a20e7dc4107bbc7eabbd7fdbc1827559ec7a"},"schema_version":"1.0","source":{"id":"1610.08223","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08223","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08223v1","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08223","created_at":"2026-05-18T01:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"WAQQBP6YRY22","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WAQQBP6YRY223VVV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WAQQBP6Y","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:5e7e8cd567bab22bc0b3fe61730993c1888cf0b5a4e10dc7e074e08712ef4c6f","target":"graph","created_at":"2026-05-18T01:01:14Z","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":"Distributed storage codes have important applications in the design of modern storage systems. In a distributed storage system, every storage node has a probability to fail and once an individual storage node fails, it must be reconstructed using data stored in the surviving nodes. Computation load and network bandwidth are two important issues we need to concern when repairing a failed node. The traditional maximal distance separable (MDS) storage codes have low repair complexity but high repair bandwidth. On the contrary, minimal storage regenerating (MSR) codes have low repair bandwidth but","authors_text":"Chong Shangguan, Gennian Ge","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-26T08:03:07Z","title":"A New Piggybacking Design for Systematic MDS Storage Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08223","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:48a2dbae180a13fc2dd8fc41df308940bd38d20eb0a16d63422ad327bb12dcbe","target":"record","created_at":"2026-05-18T01:01:14Z","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":"0b5a33943ce50c76b5bd98c68f8cfcfe33fc5d38f6c0fef23b3694c960f263ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-26T08:03:07Z","title_canon_sha256":"11906c41d098a5cb7350a022f348a20e7dc4107bbc7eabbd7fdbc1827559ec7a"},"schema_version":"1.0","source":{"id":"1610.08223","kind":"arxiv","version":1}},"canonical_sha256":"b02100bfd88e35add6b5bd70ad6e404cb9ad2bed9ebbebe3b39041b019682b68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b02100bfd88e35add6b5bd70ad6e404cb9ad2bed9ebbebe3b39041b019682b68","first_computed_at":"2026-05-18T01:01:14.669144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:14.669144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LwFHc8+35t8BZ44dEFDsr0BnZelZ9kgX8R6l8WMkUx94mokFoQ+ma5d9ehDRmBP0OL9uFSfxrxrlij5r6cRUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:14.669802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08223","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a2dbae180a13fc2dd8fc41df308940bd38d20eb0a16d63422ad327bb12dcbe","sha256:5e7e8cd567bab22bc0b3fe61730993c1888cf0b5a4e10dc7e074e08712ef4c6f"],"state_sha256":"1bed2735ab690c105110272cdaf74b6ed7b6e12cdc194e70b4b7500c05920e5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/gQKyGU0kJxaEqCHY52BqM1az4mrDVDkPg9+5O4GtIQTLpWV88H5+p1OyTL9GqKwQo86w319b/FABm12luADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:19:31.416746Z","bundle_sha256":"ed8af7be8be2d494a3ff5b5f9b5b33e5b5d6901408e39388b1737954bc8f9e01"}}