{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NA4YGGS77WKCHPD46ZBWEI6CXP","short_pith_number":"pith:NA4YGGS7","canonical_record":{"source":{"id":"1702.04525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T10:00:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3fd4d743cd19a1f16420d79c48e99f8bfb624ef4bf458e09aa7a5c8987ac5376","abstract_canon_sha256":"a0258aaa9cc3ae78f1129a5c3c1d3b8a35271d4b5d517e8b554a8879e9484b4f"},"schema_version":"1.0"},"canonical_sha256":"6839831a5ffd9423bc7cf6436223c2bbce86bba4bfc34e3d67db7ac58ef440bd","source":{"kind":"arxiv","id":"1702.04525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04525","created_at":"2026-05-18T00:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04525v1","created_at":"2026-05-18T00:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04525","created_at":"2026-05-18T00:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"NA4YGGS77WKC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NA4YGGS77WKCHPD4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NA4YGGS7","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NA4YGGS77WKCHPD46ZBWEI6CXP","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T10:00:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3fd4d743cd19a1f16420d79c48e99f8bfb624ef4bf458e09aa7a5c8987ac5376","abstract_canon_sha256":"a0258aaa9cc3ae78f1129a5c3c1d3b8a35271d4b5d517e8b554a8879e9484b4f"},"schema_version":"1.0"},"canonical_sha256":"6839831a5ffd9423bc7cf6436223c2bbce86bba4bfc34e3d67db7ac58ef440bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:41.388736Z","signature_b64":"TUZ5jpM6/CCTfGkdFbVjOCYqGO2YMZhMFeaQCQJAMlYaCXwCU2EhYmdk27s2Bj7JLBCT0XEMN0rfnIVs0RUqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6839831a5ffd9423bc7cf6436223c2bbce86bba4bfc34e3d67db7ac58ef440bd","last_reissued_at":"2026-05-18T00:50:41.388012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:41.388012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04525","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:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/B0ziUUh2nbJwOCUfm373fWMj2FbZHadoGDR3kXnHzTU7UcE7Kd08vVyGFPV2D9jXQ1FcPdhqxU7Zy8b8KOGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:23:15.745093Z"},"content_sha256":"6859882a20a7948cb6e0ad184c7419e0c2b3f4ec60cebf5724149e710364cfe9","schema_version":"1.0","event_id":"sha256:6859882a20a7948cb6e0ad184c7419e0c2b3f4ec60cebf5724149e710364cfe9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NA4YGGS77WKCHPD46ZBWEI6CXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GDSP: A Graphical Perspective on the Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Gastpar, Saeid Sahraei","submitted_at":"2017-02-15T10:00:28Z","abstract_excerpt":"The classical distributed storage problem can be modeled by a k-uniform {\\it complete} hyper-graph where vertices represent servers and hyper-edges represent users. Hence each hyper-edge should be able to recover the full file using only the memories of the vertices associated with it. This paper considers the generalization of this problem to {\\it arbitrary} hyper-graphs and to the case of multiple files, where each user is only interested in one, a problem we will refer to as the graphical distributed storage problem (GDSP). Specifically, we make progress in the analysis of minimum-storage c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04525","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:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9q21TENWBdPuYX9PpuPXcFv1thS4YLf7OOGoWOYetTw1rhtmA6CI+fWqT6yGUL59QfTP1wddKbc9rdQVbiiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:23:15.745783Z"},"content_sha256":"37331a783aeb62b9e3e07d75837d4286f5e63f94fb084cb1b41c9d627aea9536","schema_version":"1.0","event_id":"sha256:37331a783aeb62b9e3e07d75837d4286f5e63f94fb084cb1b41c9d627aea9536"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NA4YGGS77WKCHPD46ZBWEI6CXP/bundle.json","state_url":"https://pith.science/pith/NA4YGGS77WKCHPD46ZBWEI6CXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NA4YGGS77WKCHPD46ZBWEI6CXP/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-08T01:23:15Z","links":{"resolver":"https://pith.science/pith/NA4YGGS77WKCHPD46ZBWEI6CXP","bundle":"https://pith.science/pith/NA4YGGS77WKCHPD46ZBWEI6CXP/bundle.json","state":"https://pith.science/pith/NA4YGGS77WKCHPD46ZBWEI6CXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NA4YGGS77WKCHPD46ZBWEI6CXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NA4YGGS77WKCHPD46ZBWEI6CXP","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":"a0258aaa9cc3ae78f1129a5c3c1d3b8a35271d4b5d517e8b554a8879e9484b4f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T10:00:28Z","title_canon_sha256":"3fd4d743cd19a1f16420d79c48e99f8bfb624ef4bf458e09aa7a5c8987ac5376"},"schema_version":"1.0","source":{"id":"1702.04525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04525","created_at":"2026-05-18T00:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04525v1","created_at":"2026-05-18T00:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04525","created_at":"2026-05-18T00:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"NA4YGGS77WKC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NA4YGGS77WKCHPD4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NA4YGGS7","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:37331a783aeb62b9e3e07d75837d4286f5e63f94fb084cb1b41c9d627aea9536","target":"graph","created_at":"2026-05-18T00:50: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":"The classical distributed storage problem can be modeled by a k-uniform {\\it complete} hyper-graph where vertices represent servers and hyper-edges represent users. Hence each hyper-edge should be able to recover the full file using only the memories of the vertices associated with it. This paper considers the generalization of this problem to {\\it arbitrary} hyper-graphs and to the case of multiple files, where each user is only interested in one, a problem we will refer to as the graphical distributed storage problem (GDSP). Specifically, we make progress in the analysis of minimum-storage c","authors_text":"Michael Gastpar, Saeid Sahraei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T10:00:28Z","title":"GDSP: A Graphical Perspective on the Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04525","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:6859882a20a7948cb6e0ad184c7419e0c2b3f4ec60cebf5724149e710364cfe9","target":"record","created_at":"2026-05-18T00:50: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":"a0258aaa9cc3ae78f1129a5c3c1d3b8a35271d4b5d517e8b554a8879e9484b4f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-15T10:00:28Z","title_canon_sha256":"3fd4d743cd19a1f16420d79c48e99f8bfb624ef4bf458e09aa7a5c8987ac5376"},"schema_version":"1.0","source":{"id":"1702.04525","kind":"arxiv","version":1}},"canonical_sha256":"6839831a5ffd9423bc7cf6436223c2bbce86bba4bfc34e3d67db7ac58ef440bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6839831a5ffd9423bc7cf6436223c2bbce86bba4bfc34e3d67db7ac58ef440bd","first_computed_at":"2026-05-18T00:50:41.388012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:41.388012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TUZ5jpM6/CCTfGkdFbVjOCYqGO2YMZhMFeaQCQJAMlYaCXwCU2EhYmdk27s2Bj7JLBCT0XEMN0rfnIVs0RUqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:41.388736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6859882a20a7948cb6e0ad184c7419e0c2b3f4ec60cebf5724149e710364cfe9","sha256:37331a783aeb62b9e3e07d75837d4286f5e63f94fb084cb1b41c9d627aea9536"],"state_sha256":"d7f0fd1c63b878954d1ff6f270a52bf65857f28070b519bbbece0c7f492e6438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfuaxGDd4oCcBr0b24naPPY/pMGPEnW+AbSmbVDoCgGS3iP5o8OZ4E/dFE4SmZCS1i4zqzdlbk3+CINdybAOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:23:15.749615Z","bundle_sha256":"fefed7c14051bbcd4c5070f62abd60cc6a27019732d47b7c8ceb311a4db394b4"}}