{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XUD3F3WXETUF6ZD6BZNGLGTATH","short_pith_number":"pith:XUD3F3WX","schema_version":"1.0","canonical_sha256":"bd07b2eed724e85f647e0e5a659a6099c40db4bcfc360b27dfef4e5fae4e17bf","source":{"kind":"arxiv","id":"1401.2672","version":2},"attestation_state":"computed","paper":{"title":"On a Duality Between Recoverable Distributed Storage and Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar","submitted_at":"2014-01-12T21:00:50Z","abstract_excerpt":"In this paper, we introduce a model of a single-failure locally recoverable distributed storage system. This model appears to give rise to a problem seemingly dual of the well-studied index coding problem. The relation between the dimensions of an optimal index code and optimal distributed storage code of our model has been established in this paper. We also show some extensions to vector codes."},"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":"1401.2672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-12T21:00:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bfd7271cb2424342bc169f0df2b900e8dc802233eaf00f105b9424c564a112af","abstract_canon_sha256":"aaba3a52a7f1b43a7cc9a4742f590b854620bc262fc6a2e31a259c3d91ce0e17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:43.545362Z","signature_b64":"KWwmiDIzptNinYrvuYpv2TQwaIhKkCOnyEoAAu7J6FtOqmqxRtGReE0jAvXRlqAGf5rQ05Tu3N4P00aBqsBRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd07b2eed724e85f647e0e5a659a6099c40db4bcfc360b27dfef4e5fae4e17bf","last_reissued_at":"2026-05-18T02:56:43.544913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:43.544913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Duality Between Recoverable Distributed Storage and Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar","submitted_at":"2014-01-12T21:00:50Z","abstract_excerpt":"In this paper, we introduce a model of a single-failure locally recoverable distributed storage system. This model appears to give rise to a problem seemingly dual of the well-studied index coding problem. The relation between the dimensions of an optimal index code and optimal distributed storage code of our model has been established in this paper. We also show some extensions to vector codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2672","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":"1401.2672","created_at":"2026-05-18T02:56:43.544976+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2672v2","created_at":"2026-05-18T02:56:43.544976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2672","created_at":"2026-05-18T02:56:43.544976+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUD3F3WXETUF","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUD3F3WXETUF6ZD6","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUD3F3WX","created_at":"2026-05-18T12:28:57.508820+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/XUD3F3WXETUF6ZD6BZNGLGTATH","json":"https://pith.science/pith/XUD3F3WXETUF6ZD6BZNGLGTATH.json","graph_json":"https://pith.science/api/pith-number/XUD3F3WXETUF6ZD6BZNGLGTATH/graph.json","events_json":"https://pith.science/api/pith-number/XUD3F3WXETUF6ZD6BZNGLGTATH/events.json","paper":"https://pith.science/paper/XUD3F3WX"},"agent_actions":{"view_html":"https://pith.science/pith/XUD3F3WXETUF6ZD6BZNGLGTATH","download_json":"https://pith.science/pith/XUD3F3WXETUF6ZD6BZNGLGTATH.json","view_paper":"https://pith.science/paper/XUD3F3WX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2672&json=true","fetch_graph":"https://pith.science/api/pith-number/XUD3F3WXETUF6ZD6BZNGLGTATH/graph.json","fetch_events":"https://pith.science/api/pith-number/XUD3F3WXETUF6ZD6BZNGLGTATH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUD3F3WXETUF6ZD6BZNGLGTATH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUD3F3WXETUF6ZD6BZNGLGTATH/action/storage_attestation","attest_author":"https://pith.science/pith/XUD3F3WXETUF6ZD6BZNGLGTATH/action/author_attestation","sign_citation":"https://pith.science/pith/XUD3F3WXETUF6ZD6BZNGLGTATH/action/citation_signature","submit_replication":"https://pith.science/pith/XUD3F3WXETUF6ZD6BZNGLGTATH/action/replication_record"}},"created_at":"2026-05-18T02:56:43.544976+00:00","updated_at":"2026-05-18T02:56:43.544976+00:00"}