{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7CS4DCTZJ3SI6DUH4WFTYJFEZC","short_pith_number":"pith:7CS4DCTZ","schema_version":"1.0","canonical_sha256":"f8a5c18a794ee48f0e87e58b3c24a4c8b16659fc100d14c229d1936760bf8473","source":{"kind":"arxiv","id":"1706.09197","version":3},"attestation_state":"computed","paper":{"title":"Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew McGregor, Arya Mazumdar, Sofya Vorotnikova","submitted_at":"2017-06-28T10:05:04Z","abstract_excerpt":"Motivated by applications in distributed storage, the storage capacity of a graph was recently defined to be the maximum amount of information that can be stored across the vertices of a graph such that the information at any vertex can be recovered from the information stored at the neighboring vertices. Computing the storage capacity is a fundamental problem in network coding and is related, or equivalent, to some well-studied problems such as index coding with side information and generalized guessing games. In this paper, we consider storage capacity as a natural information-theoretic anal"},"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":"1706.09197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T10:05:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"170556678127a1eee4f3f977135d37c628265ba9ccc93bd9d35fe503a8b2b750","abstract_canon_sha256":"422f66c34d97d4013a68990618cf48b6fd731ffdfdbfd67f55ca3661fb33c472"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:08.813571Z","signature_b64":"e5HOI40dLAyYYSScv1C6cpNgpzi3U5er0CiE38HeOy8cwixFkC2uslOi4oKpHmGk1MDBaK/r+o17yGGnE8NMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8a5c18a794ee48f0e87e58b3c24a4c8b16659fc100d14c229d1936760bf8473","last_reissued_at":"2026-05-17T23:58:08.813047Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:08.813047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew McGregor, Arya Mazumdar, Sofya Vorotnikova","submitted_at":"2017-06-28T10:05:04Z","abstract_excerpt":"Motivated by applications in distributed storage, the storage capacity of a graph was recently defined to be the maximum amount of information that can be stored across the vertices of a graph such that the information at any vertex can be recovered from the information stored at the neighboring vertices. Computing the storage capacity is a fundamental problem in network coding and is related, or equivalent, to some well-studied problems such as index coding with side information and generalized guessing games. In this paper, we consider storage capacity as a natural information-theoretic anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09197","kind":"arxiv","version":3},"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":"1706.09197","created_at":"2026-05-17T23:58:08.813115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09197v3","created_at":"2026-05-17T23:58:08.813115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09197","created_at":"2026-05-17T23:58:08.813115+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CS4DCTZJ3SI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CS4DCTZJ3SI6DUH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CS4DCTZ","created_at":"2026-05-18T12:31:03.183658+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/7CS4DCTZJ3SI6DUH4WFTYJFEZC","json":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC.json","graph_json":"https://pith.science/api/pith-number/7CS4DCTZJ3SI6DUH4WFTYJFEZC/graph.json","events_json":"https://pith.science/api/pith-number/7CS4DCTZJ3SI6DUH4WFTYJFEZC/events.json","paper":"https://pith.science/paper/7CS4DCTZ"},"agent_actions":{"view_html":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC","download_json":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC.json","view_paper":"https://pith.science/paper/7CS4DCTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09197&json=true","fetch_graph":"https://pith.science/api/pith-number/7CS4DCTZJ3SI6DUH4WFTYJFEZC/graph.json","fetch_events":"https://pith.science/api/pith-number/7CS4DCTZJ3SI6DUH4WFTYJFEZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/action/storage_attestation","attest_author":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/action/author_attestation","sign_citation":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/action/citation_signature","submit_replication":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/action/replication_record"}},"created_at":"2026-05-17T23:58:08.813115+00:00","updated_at":"2026-05-17T23:58:08.813115+00:00"}