{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M276UJGWDYIY3HA6P4FEXZIZNQ","short_pith_number":"pith:M276UJGW","canonical_record":{"source":{"id":"1510.02032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-07T17:23:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae936fc62a78704d697dc3a37bd31a3968c4110a9a318e1c01670ea38405f3da","abstract_canon_sha256":"18c26e3cb04e0cdbb56dd9c933e493c8634133834b4de42bcf1cd5b602c1d09c"},"schema_version":"1.0"},"canonical_sha256":"66bfea24d61e118d9c1e7f0a4be5196c0e10fee5310a7a15622361b433c25884","source":{"kind":"arxiv","id":"1510.02032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02032","created_at":"2026-05-18T01:30:49Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02032v1","created_at":"2026-05-18T01:30:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02032","created_at":"2026-05-18T01:30:49Z"},{"alias_kind":"pith_short_12","alias_value":"M276UJGWDYIY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M276UJGWDYIY3HA6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M276UJGW","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M276UJGWDYIY3HA6P4FEXZIZNQ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-07T17:23:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae936fc62a78704d697dc3a37bd31a3968c4110a9a318e1c01670ea38405f3da","abstract_canon_sha256":"18c26e3cb04e0cdbb56dd9c933e493c8634133834b4de42bcf1cd5b602c1d09c"},"schema_version":"1.0"},"canonical_sha256":"66bfea24d61e118d9c1e7f0a4be5196c0e10fee5310a7a15622361b433c25884","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:49.846915Z","signature_b64":"X9Z/ucNrrLZCf6dfvYsCq/+U2c+h1PsS3gB4qwdAGZOxhBJyMGIAEwECLDvWmovfrls6f3WQyNZck5WDhgrxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66bfea24d61e118d9c1e7f0a4be5196c0e10fee5310a7a15622361b433c25884","last_reissued_at":"2026-05-18T01:30:49.846397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:49.846397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02032","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:30:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CpG1R+N5PtE0MTzKBguIX0fRzQG/BFXWgjvLGfgrdsV6tgRZeeZGj5kZEZpMw8iWPtt1tIE0B0vMmdn6RZMSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:33.539567Z"},"content_sha256":"2513209f6c49aa37129b4d3ac0f32ad12c057eb777e96e2402b138115e7d27fb","schema_version":"1.0","event_id":"sha256:2513209f6c49aa37129b4d3ac0f32ad12c057eb777e96e2402b138115e7d27fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M276UJGWDYIY3HA6P4FEXZIZNQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Probabilistic Approach Towards Exact-Repair Regeneration Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mehran Elyasi, Soheil Mohajer","submitted_at":"2015-10-07T17:23:41Z","abstract_excerpt":"Regeneration codes with exact-repair property for distributed storage systems is studied in this paper. For exact- repair problem, the achievable points of ({\\alpha},{\\beta}) tradeoff match with the outer bound only for minimum storage regenerating (MSR), minimum bandwidth regenerating (MBR), and some specific values of n, k, and d. Such tradeoff is characterized in this work for general (n, k, k), (i.e., k = d) for some range of per-node storage ({\\alpha}) and repair-bandwidth ({\\beta}). Rather than explicit code construction, achievability of these tradeoff points is shown by proving existen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02032","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:30:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SzPqw6MglqyiWpy8jV4GYSVF7VFwhPLTeIKquwJ8yB+ydIUUdxulRmSNL6yjcBKEzqmb04ByT+GwpkDWIm1CCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:33.540232Z"},"content_sha256":"dff5f8b81ce3afc221a135abda776bf3f9aecd775895d8935f5e864caf7f40c6","schema_version":"1.0","event_id":"sha256:dff5f8b81ce3afc221a135abda776bf3f9aecd775895d8935f5e864caf7f40c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M276UJGWDYIY3HA6P4FEXZIZNQ/bundle.json","state_url":"https://pith.science/pith/M276UJGWDYIY3HA6P4FEXZIZNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M276UJGWDYIY3HA6P4FEXZIZNQ/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-11T23:33:33Z","links":{"resolver":"https://pith.science/pith/M276UJGWDYIY3HA6P4FEXZIZNQ","bundle":"https://pith.science/pith/M276UJGWDYIY3HA6P4FEXZIZNQ/bundle.json","state":"https://pith.science/pith/M276UJGWDYIY3HA6P4FEXZIZNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M276UJGWDYIY3HA6P4FEXZIZNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M276UJGWDYIY3HA6P4FEXZIZNQ","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":"18c26e3cb04e0cdbb56dd9c933e493c8634133834b4de42bcf1cd5b602c1d09c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-07T17:23:41Z","title_canon_sha256":"ae936fc62a78704d697dc3a37bd31a3968c4110a9a318e1c01670ea38405f3da"},"schema_version":"1.0","source":{"id":"1510.02032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02032","created_at":"2026-05-18T01:30:49Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02032v1","created_at":"2026-05-18T01:30:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02032","created_at":"2026-05-18T01:30:49Z"},{"alias_kind":"pith_short_12","alias_value":"M276UJGWDYIY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M276UJGWDYIY3HA6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M276UJGW","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:dff5f8b81ce3afc221a135abda776bf3f9aecd775895d8935f5e864caf7f40c6","target":"graph","created_at":"2026-05-18T01:30:49Z","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":"Regeneration codes with exact-repair property for distributed storage systems is studied in this paper. For exact- repair problem, the achievable points of ({\\alpha},{\\beta}) tradeoff match with the outer bound only for minimum storage regenerating (MSR), minimum bandwidth regenerating (MBR), and some specific values of n, k, and d. Such tradeoff is characterized in this work for general (n, k, k), (i.e., k = d) for some range of per-node storage ({\\alpha}) and repair-bandwidth ({\\beta}). Rather than explicit code construction, achievability of these tradeoff points is shown by proving existen","authors_text":"Mehran Elyasi, Soheil Mohajer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-07T17:23:41Z","title":"A Probabilistic Approach Towards Exact-Repair Regeneration Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02032","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:2513209f6c49aa37129b4d3ac0f32ad12c057eb777e96e2402b138115e7d27fb","target":"record","created_at":"2026-05-18T01:30:49Z","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":"18c26e3cb04e0cdbb56dd9c933e493c8634133834b4de42bcf1cd5b602c1d09c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-07T17:23:41Z","title_canon_sha256":"ae936fc62a78704d697dc3a37bd31a3968c4110a9a318e1c01670ea38405f3da"},"schema_version":"1.0","source":{"id":"1510.02032","kind":"arxiv","version":1}},"canonical_sha256":"66bfea24d61e118d9c1e7f0a4be5196c0e10fee5310a7a15622361b433c25884","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66bfea24d61e118d9c1e7f0a4be5196c0e10fee5310a7a15622361b433c25884","first_computed_at":"2026-05-18T01:30:49.846397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:49.846397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X9Z/ucNrrLZCf6dfvYsCq/+U2c+h1PsS3gB4qwdAGZOxhBJyMGIAEwECLDvWmovfrls6f3WQyNZck5WDhgrxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:49.846915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2513209f6c49aa37129b4d3ac0f32ad12c057eb777e96e2402b138115e7d27fb","sha256:dff5f8b81ce3afc221a135abda776bf3f9aecd775895d8935f5e864caf7f40c6"],"state_sha256":"629ee4515161a01a54a330cde220485398426fae0536f195d1d7372ca722765c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+mGZ1W488ED0pSkDRnSAcvbsLD/Wrw6FqIEZJJ0cZPyoWNF5Wkcv/5zaqiAaDbj6vvap4LTKF0GgxP3B/ViCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:33:33.544620Z","bundle_sha256":"a98a4a8ac1f4e6d870b6d669e9b75342425330bf9dcb89650dd0a0183607e5b6"}}