{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N7Y6UGW4AUOKUNYRLN5MHIPAFR","short_pith_number":"pith:N7Y6UGW4","schema_version":"1.0","canonical_sha256":"6ff1ea1adc051caa37115b7ac3a1e02c7e8258eca4d82b5b391f931fc7a474aa","source":{"kind":"arxiv","id":"1601.08190","version":1},"attestation_state":"computed","paper":{"title":"On MBR codes with replication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Nikhil Krishnan, P. Vijay Kumar","submitted_at":"2016-01-29T16:48:58Z","abstract_excerpt":"An early paper by Rashmi et. al. presented the construction of an $(n,k,d=n-1)$ MBR regenerating code featuring the inherent double replication of all code symbols and repair-by-transfer (RBT), both of which are important in practice. We first show that no MBR code can contain even a single code symbol that is replicated more than twice. We then go on to present two new families of MBR codes which feature double replication of all systematic message symbols. The codes also possess a set of $d$ nodes whose contents include the message symbols and which can be repaired through help-by-transfer ("},"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":"1601.08190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-29T16:48:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"382124662800c407f8e522c18005305754f4346affec253fcebac85164ecd30f","abstract_canon_sha256":"1615732d27ba3795f9cdf5c69e231d7c57b4f96008fa06e02b9a87a4a917a381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:40.128673Z","signature_b64":"ymYCFWBv6WtUnoXfZLqmWu8VVVFtAt9N2xyg29l42rk88LLOhVqiKK10PNNayolPOzu06DGJnPIlf5abKc2WBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ff1ea1adc051caa37115b7ac3a1e02c7e8258eca4d82b5b391f931fc7a474aa","last_reissued_at":"2026-05-18T01:21:40.128171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:40.128171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On MBR codes with replication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Nikhil Krishnan, P. Vijay Kumar","submitted_at":"2016-01-29T16:48:58Z","abstract_excerpt":"An early paper by Rashmi et. al. presented the construction of an $(n,k,d=n-1)$ MBR regenerating code featuring the inherent double replication of all code symbols and repair-by-transfer (RBT), both of which are important in practice. We first show that no MBR code can contain even a single code symbol that is replicated more than twice. We then go on to present two new families of MBR codes which feature double replication of all systematic message symbols. The codes also possess a set of $d$ nodes whose contents include the message symbols and which can be repaired through help-by-transfer ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08190","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.08190","created_at":"2026-05-18T01:21:40.128247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.08190v1","created_at":"2026-05-18T01:21:40.128247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08190","created_at":"2026-05-18T01:21:40.128247+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7Y6UGW4AUOK","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7Y6UGW4AUOKUNYR","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7Y6UGW4","created_at":"2026-05-18T12:30:32.724797+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/N7Y6UGW4AUOKUNYRLN5MHIPAFR","json":"https://pith.science/pith/N7Y6UGW4AUOKUNYRLN5MHIPAFR.json","graph_json":"https://pith.science/api/pith-number/N7Y6UGW4AUOKUNYRLN5MHIPAFR/graph.json","events_json":"https://pith.science/api/pith-number/N7Y6UGW4AUOKUNYRLN5MHIPAFR/events.json","paper":"https://pith.science/paper/N7Y6UGW4"},"agent_actions":{"view_html":"https://pith.science/pith/N7Y6UGW4AUOKUNYRLN5MHIPAFR","download_json":"https://pith.science/pith/N7Y6UGW4AUOKUNYRLN5MHIPAFR.json","view_paper":"https://pith.science/paper/N7Y6UGW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.08190&json=true","fetch_graph":"https://pith.science/api/pith-number/N7Y6UGW4AUOKUNYRLN5MHIPAFR/graph.json","fetch_events":"https://pith.science/api/pith-number/N7Y6UGW4AUOKUNYRLN5MHIPAFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7Y6UGW4AUOKUNYRLN5MHIPAFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7Y6UGW4AUOKUNYRLN5MHIPAFR/action/storage_attestation","attest_author":"https://pith.science/pith/N7Y6UGW4AUOKUNYRLN5MHIPAFR/action/author_attestation","sign_citation":"https://pith.science/pith/N7Y6UGW4AUOKUNYRLN5MHIPAFR/action/citation_signature","submit_replication":"https://pith.science/pith/N7Y6UGW4AUOKUNYRLN5MHIPAFR/action/replication_record"}},"created_at":"2026-05-18T01:21:40.128247+00:00","updated_at":"2026-05-18T01:21:40.128247+00:00"}