{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7CS4DCTZJ3SI6DUH4WFTYJFEZC","short_pith_number":"pith:7CS4DCTZ","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"},"canonical_sha256":"f8a5c18a794ee48f0e87e58b3c24a4c8b16659fc100d14c229d1936760bf8473","source":{"kind":"arxiv","id":"1706.09197","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09197","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09197v3","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09197","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"7CS4DCTZJ3SI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7CS4DCTZJ3SI6DUH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7CS4DCTZ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7CS4DCTZJ3SI6DUH4WFTYJFEZC","target":"record","payload":{"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"},"canonical_sha256":"f8a5c18a794ee48f0e87e58b3c24a4c8b16659fc100d14c229d1936760bf8473","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"},"source_kind":"arxiv","source_id":"1706.09197","source_version":3,"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-17T23:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1U1X/EpJbf1T/dYwMI+CFMY20Ho/OtL0NLDiGEvzBUW1aqJidOuhBoEx/WT5K/U+gfATJ/3YIHAXltq1FugcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:45:15.676067Z"},"content_sha256":"4a24da5af6eb9c920ccd1e164d83cf0397793f33989234890f3d7e752c5454e8","schema_version":"1.0","event_id":"sha256:4a24da5af6eb9c920ccd1e164d83cf0397793f33989234890f3d7e752c5454e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7CS4DCTZJ3SI6DUH4WFTYJFEZC","target":"graph","payload":{"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"},"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-17T23:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0umPIBJ+9TSx0tmKpGkCUvpsj/ouxErlXDZtJZaLwrnDfR5QVyzY8Kf4DyAcaCXnysAkEcIF1ETyjkvpWlJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:45:15.676811Z"},"content_sha256":"a2868c0184699ebafc0d0d7ec525d78c73f8b470ac7bf98f070760b7719be097","schema_version":"1.0","event_id":"sha256:a2868c0184699ebafc0d0d7ec525d78c73f8b470ac7bf98f070760b7719be097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/bundle.json","state_url":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/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-11T01:45:15Z","links":{"resolver":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC","bundle":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/bundle.json","state":"https://pith.science/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7CS4DCTZJ3SI6DUH4WFTYJFEZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7CS4DCTZJ3SI6DUH4WFTYJFEZC","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":"422f66c34d97d4013a68990618cf48b6fd731ffdfdbfd67f55ca3661fb33c472","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T10:05:04Z","title_canon_sha256":"170556678127a1eee4f3f977135d37c628265ba9ccc93bd9d35fe503a8b2b750"},"schema_version":"1.0","source":{"id":"1706.09197","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09197","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09197v3","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09197","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"7CS4DCTZJ3SI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7CS4DCTZJ3SI6DUH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7CS4DCTZ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:a2868c0184699ebafc0d0d7ec525d78c73f8b470ac7bf98f070760b7719be097","target":"graph","created_at":"2026-05-17T23:58:08Z","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":"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","authors_text":"Andrew McGregor, Arya Mazumdar, Sofya Vorotnikova","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T10:05:04Z","title":"Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09197","kind":"arxiv","version":3},"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:4a24da5af6eb9c920ccd1e164d83cf0397793f33989234890f3d7e752c5454e8","target":"record","created_at":"2026-05-17T23:58:08Z","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":"422f66c34d97d4013a68990618cf48b6fd731ffdfdbfd67f55ca3661fb33c472","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T10:05:04Z","title_canon_sha256":"170556678127a1eee4f3f977135d37c628265ba9ccc93bd9d35fe503a8b2b750"},"schema_version":"1.0","source":{"id":"1706.09197","kind":"arxiv","version":3}},"canonical_sha256":"f8a5c18a794ee48f0e87e58b3c24a4c8b16659fc100d14c229d1936760bf8473","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8a5c18a794ee48f0e87e58b3c24a4c8b16659fc100d14c229d1936760bf8473","first_computed_at":"2026-05-17T23:58:08.813047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:08.813047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e5HOI40dLAyYYSScv1C6cpNgpzi3U5er0CiE38HeOy8cwixFkC2uslOi4oKpHmGk1MDBaK/r+o17yGGnE8NMCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:08.813571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09197","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a24da5af6eb9c920ccd1e164d83cf0397793f33989234890f3d7e752c5454e8","sha256:a2868c0184699ebafc0d0d7ec525d78c73f8b470ac7bf98f070760b7719be097"],"state_sha256":"23aac0de8ca29f6e653ee6b10ca91e152d38152c50cf4e50bd3c6c64a1cdcd91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPkkzsrvHS0wXj2WcRPuxWeGT8W0VSdVlsHsuZiNbdp/rK9tuZyXvQjxktWutK09bP9FFEV/k5Y03SL8KqDyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:45:15.681213Z","bundle_sha256":"873b520c5aaea58bc595134a4b4d35b52a64ed22694575ccd84abc627aa9ba6d"}}