{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CSGPHWJBMNTXLA5RTBFUNLP6HB","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":"66090929bf15f38471c50587b980a55a1aee9ab0edeb900dcc3d27063a750f56","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-14T17:30:29Z","title_canon_sha256":"b2eaf562e21fbc78047466754e97bfa9050d3cfb7f353285e711c15be21b8132"},"schema_version":"1.0","source":{"id":"1901.04419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04419","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04419v1","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04419","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"CSGPHWJBMNTX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CSGPHWJBMNTXLA5R","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CSGPHWJB","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:25c7dcd050251f26d329fec51ac2d7b4f74e3c523c79a4eaa865abce63b8719f","target":"graph","created_at":"2026-05-17T23:56:25Z","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":"The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate freely without taxing the system bandwidth, and that the only information transmission that counts is the one between the racks. This assumption implies that the nodes within each of the racks can collaborate before providing information to the failed node. The main emphasis of the paper is on code construction for this storage model. We present an explicit fam","authors_text":"Alexander Barg, Zitan Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-14T17:30:29Z","title":"Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04419","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:1bb8b9f6c894348dfb3f764785c76fd4dac661f111c1ede0cac1830a7a51c7d7","target":"record","created_at":"2026-05-17T23:56:25Z","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":"66090929bf15f38471c50587b980a55a1aee9ab0edeb900dcc3d27063a750f56","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-14T17:30:29Z","title_canon_sha256":"b2eaf562e21fbc78047466754e97bfa9050d3cfb7f353285e711c15be21b8132"},"schema_version":"1.0","source":{"id":"1901.04419","kind":"arxiv","version":1}},"canonical_sha256":"148cf3d92163677583b1984b46adfe387a26bc2dcb861688331cf99a4fcb926c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"148cf3d92163677583b1984b46adfe387a26bc2dcb861688331cf99a4fcb926c","first_computed_at":"2026-05-17T23:56:25.622401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:25.622401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kkB3t1Fj5cGX5+hS2C6Y/H/0JsRj6XGIT4Y3v8+0Y94lxOLe60i4caBF3PqqsXq8vgVefT7l4DOqQ7vzG/KxBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:25.622809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bb8b9f6c894348dfb3f764785c76fd4dac661f111c1ede0cac1830a7a51c7d7","sha256:25c7dcd050251f26d329fec51ac2d7b4f74e3c523c79a4eaa865abce63b8719f"],"state_sha256":"908346e18b7a48c1372ae37cc4d025a1ebffe5f005349e5d9c6109e7886808ee"}