{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TIALSUJUPNBNQHGV2MX36GRTNL","short_pith_number":"pith:TIALSUJU","canonical_record":{"source":{"id":"1603.04822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-15T19:09:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"717ed71a916b4ad93cbefdf0f1b490a96bca8538a8ee89fe6614b9d837b116d3","abstract_canon_sha256":"45b149281a9fc0e2c5e6471929567334d15077c5efc908e16d0291f357a45a7b"},"schema_version":"1.0"},"canonical_sha256":"9a00b951347b42d81cd5d32fbf1a336addd7c27564c9275e0c12d965f15d4f28","source":{"kind":"arxiv","id":"1603.04822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04822","created_at":"2026-05-18T01:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04822v1","created_at":"2026-05-18T01:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04822","created_at":"2026-05-18T01:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"TIALSUJUPNBN","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TIALSUJUPNBNQHGV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TIALSUJU","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TIALSUJUPNBNQHGV2MX36GRTNL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-15T19:09:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"717ed71a916b4ad93cbefdf0f1b490a96bca8538a8ee89fe6614b9d837b116d3","abstract_canon_sha256":"45b149281a9fc0e2c5e6471929567334d15077c5efc908e16d0291f357a45a7b"},"schema_version":"1.0"},"canonical_sha256":"9a00b951347b42d81cd5d32fbf1a336addd7c27564c9275e0c12d965f15d4f28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:03.922227Z","signature_b64":"KyG+tA5xc71Ucb3hVAUvu0EM8B4BtXoyeQl0JzOXmZ7QRyB+4eVaY0syuxtGuJ8dSLhV0yvY3eNk3Vh1GISlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a00b951347b42d81cd5d32fbf1a336addd7c27564c9275e0c12d965f15d4f28","last_reissued_at":"2026-05-18T01:19:03.921602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:03.921602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04822","source_version":1,"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-18T01:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JIDmiJEoThrewbpXju3CI+PMIkbzxiwX+GRHrOARd4QCL/XVopP+joDxDkbzNDJg8GQnpGVKX/QfOzVe7kbvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:29:55.347540Z"},"content_sha256":"41fa6974f36632d1bf463644044361e628ebd07d49bc6deb886beca835ca7e32","schema_version":"1.0","event_id":"sha256:41fa6974f36632d1bf463644044361e628ebd07d49bc6deb886beca835ca7e32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TIALSUJUPNBNQHGV2MX36GRTNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Centralized Repair of Multiple Node Failures with Applications to Communication Efficient Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat, O. Ozan Koyluoglu, Sriram Vishwanath","submitted_at":"2016-03-15T19:09:45Z","abstract_excerpt":"This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth-efficient repair of a single failed node. This work focuses on the trade-off between the amount of data stored and repair bandwidth in this CMR model. In particular, repair bandwidth bounds are derived for the minimum storage multi-node repair (MSMR) and the minimum bandwidth multi-node repair (MBMR) operating points. The tightness of these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04822","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"},"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-18T01:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKDA8NgfejUuPxzUo6FJNg+szYslxoVnOeikHjF3icNtdQ20M1I4lrxfC1e6LHjs81QjSHbqVM+quEt1vnwMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:29:55.347910Z"},"content_sha256":"2749ef7154f8006ac45357b5bcda074740a72a5290e88b4cc7b2a951a725569e","schema_version":"1.0","event_id":"sha256:2749ef7154f8006ac45357b5bcda074740a72a5290e88b4cc7b2a951a725569e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIALSUJUPNBNQHGV2MX36GRTNL/bundle.json","state_url":"https://pith.science/pith/TIALSUJUPNBNQHGV2MX36GRTNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIALSUJUPNBNQHGV2MX36GRTNL/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-05-30T14:29:55Z","links":{"resolver":"https://pith.science/pith/TIALSUJUPNBNQHGV2MX36GRTNL","bundle":"https://pith.science/pith/TIALSUJUPNBNQHGV2MX36GRTNL/bundle.json","state":"https://pith.science/pith/TIALSUJUPNBNQHGV2MX36GRTNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIALSUJUPNBNQHGV2MX36GRTNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TIALSUJUPNBNQHGV2MX36GRTNL","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":"45b149281a9fc0e2c5e6471929567334d15077c5efc908e16d0291f357a45a7b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-15T19:09:45Z","title_canon_sha256":"717ed71a916b4ad93cbefdf0f1b490a96bca8538a8ee89fe6614b9d837b116d3"},"schema_version":"1.0","source":{"id":"1603.04822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04822","created_at":"2026-05-18T01:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04822v1","created_at":"2026-05-18T01:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04822","created_at":"2026-05-18T01:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"TIALSUJUPNBN","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TIALSUJUPNBNQHGV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TIALSUJU","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:2749ef7154f8006ac45357b5bcda074740a72a5290e88b4cc7b2a951a725569e","target":"graph","created_at":"2026-05-18T01:19:03Z","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":"This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth-efficient repair of a single failed node. This work focuses on the trade-off between the amount of data stored and repair bandwidth in this CMR model. In particular, repair bandwidth bounds are derived for the minimum storage multi-node repair (MSMR) and the minimum bandwidth multi-node repair (MBMR) operating points. The tightness of these ","authors_text":"Ankit Singh Rawat, O. Ozan Koyluoglu, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-15T19:09:45Z","title":"Centralized Repair of Multiple Node Failures with Applications to Communication Efficient Secret Sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04822","kind":"arxiv","version":1},"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:41fa6974f36632d1bf463644044361e628ebd07d49bc6deb886beca835ca7e32","target":"record","created_at":"2026-05-18T01:19:03Z","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":"45b149281a9fc0e2c5e6471929567334d15077c5efc908e16d0291f357a45a7b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-15T19:09:45Z","title_canon_sha256":"717ed71a916b4ad93cbefdf0f1b490a96bca8538a8ee89fe6614b9d837b116d3"},"schema_version":"1.0","source":{"id":"1603.04822","kind":"arxiv","version":1}},"canonical_sha256":"9a00b951347b42d81cd5d32fbf1a336addd7c27564c9275e0c12d965f15d4f28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a00b951347b42d81cd5d32fbf1a336addd7c27564c9275e0c12d965f15d4f28","first_computed_at":"2026-05-18T01:19:03.921602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:03.921602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KyG+tA5xc71Ucb3hVAUvu0EM8B4BtXoyeQl0JzOXmZ7QRyB+4eVaY0syuxtGuJ8dSLhV0yvY3eNk3Vh1GISlCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:03.922227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41fa6974f36632d1bf463644044361e628ebd07d49bc6deb886beca835ca7e32","sha256:2749ef7154f8006ac45357b5bcda074740a72a5290e88b4cc7b2a951a725569e"],"state_sha256":"3eb1de076a0614b9a607fbd939157f08c139581603ceed9870e0ab9cd89015eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPckJ8XIVOHXtcJG2QwVGxo2UTS7VzIlrhu9u8LLUM73rdb/6lPfuuMD6drMWTbjxeywJ0Eh/JLWjNZEYclUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:29:55.349944Z","bundle_sha256":"bfeeda4337f3c1007d62c056a01e160797bd73e9abfaa010b5488665e1ac74cf"}}