{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HAJUNOGHLHF7PSVY7ZKS7U6C7R","short_pith_number":"pith:HAJUNOGH","schema_version":"1.0","canonical_sha256":"381346b8c759cbf7cab8fe552fd3c2fc672681ebab7bc90e2c507efecce5b06d","source":{"kind":"arxiv","id":"1901.06336","version":2},"attestation_state":"computed","paper":{"title":"On Epsilon-MSCR Codes for Two Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bh. Rekha Devi, V. Lalitha","submitted_at":"2019-01-18T16:49:00Z","abstract_excerpt":"Cooperative regenerating codes are regenerating codes designed to tradeoff storage for repair bandwidth in case of multiple node failures. Minimum storage cooperative regenerating (MSCR) codes are a class of cooperative regenerating codes which achieve the minimum storage point of the tradeoff. Recently, these codes have been constructed for all possible parameters $(n,k,d,h)$, where $h$ erasures are repaired by contacting any $d$ surviving nodes. However, these constructions have very large sub-packetization. $\\epsilon$-MSR codes are a class of codes introduced to tradeoff subpacketization le"},"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":"1901.06336","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-18T16:49:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20d2c1c36696ffd3fb9671bd97d07571e33050038f1e22c25ce033f1277afe81","abstract_canon_sha256":"d56c6076f685e5a050058b514862ae6e2c63a20f6fe46f06defa749b2ca9b739"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:26.796500Z","signature_b64":"5UEv9ftbaN6dtq+oSyLJvVPS5t20N+NG0qhy0PVCEhCDKDK69ntRVpZLbHIYsI50Xn+ptkMyEKxjgaJzAjb3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"381346b8c759cbf7cab8fe552fd3c2fc672681ebab7bc90e2c507efecce5b06d","last_reissued_at":"2026-05-17T23:55:26.796042Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:26.796042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Epsilon-MSCR Codes for Two Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bh. Rekha Devi, V. Lalitha","submitted_at":"2019-01-18T16:49:00Z","abstract_excerpt":"Cooperative regenerating codes are regenerating codes designed to tradeoff storage for repair bandwidth in case of multiple node failures. Minimum storage cooperative regenerating (MSCR) codes are a class of cooperative regenerating codes which achieve the minimum storage point of the tradeoff. Recently, these codes have been constructed for all possible parameters $(n,k,d,h)$, where $h$ erasures are repaired by contacting any $d$ surviving nodes. However, these constructions have very large sub-packetization. $\\epsilon$-MSR codes are a class of codes introduced to tradeoff subpacketization le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06336","kind":"arxiv","version":2},"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":"1901.06336","created_at":"2026-05-17T23:55:26.796134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06336v2","created_at":"2026-05-17T23:55:26.796134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06336","created_at":"2026-05-17T23:55:26.796134+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAJUNOGHLHF7","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAJUNOGHLHF7PSVY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAJUNOGH","created_at":"2026-05-18T12:33:18.533446+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/HAJUNOGHLHF7PSVY7ZKS7U6C7R","json":"https://pith.science/pith/HAJUNOGHLHF7PSVY7ZKS7U6C7R.json","graph_json":"https://pith.science/api/pith-number/HAJUNOGHLHF7PSVY7ZKS7U6C7R/graph.json","events_json":"https://pith.science/api/pith-number/HAJUNOGHLHF7PSVY7ZKS7U6C7R/events.json","paper":"https://pith.science/paper/HAJUNOGH"},"agent_actions":{"view_html":"https://pith.science/pith/HAJUNOGHLHF7PSVY7ZKS7U6C7R","download_json":"https://pith.science/pith/HAJUNOGHLHF7PSVY7ZKS7U6C7R.json","view_paper":"https://pith.science/paper/HAJUNOGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06336&json=true","fetch_graph":"https://pith.science/api/pith-number/HAJUNOGHLHF7PSVY7ZKS7U6C7R/graph.json","fetch_events":"https://pith.science/api/pith-number/HAJUNOGHLHF7PSVY7ZKS7U6C7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAJUNOGHLHF7PSVY7ZKS7U6C7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAJUNOGHLHF7PSVY7ZKS7U6C7R/action/storage_attestation","attest_author":"https://pith.science/pith/HAJUNOGHLHF7PSVY7ZKS7U6C7R/action/author_attestation","sign_citation":"https://pith.science/pith/HAJUNOGHLHF7PSVY7ZKS7U6C7R/action/citation_signature","submit_replication":"https://pith.science/pith/HAJUNOGHLHF7PSVY7ZKS7U6C7R/action/replication_record"}},"created_at":"2026-05-17T23:55:26.796134+00:00","updated_at":"2026-05-17T23:55:26.796134+00:00"}