{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:APU6TEWPE6ZLSBEOQY6EQLVOC5","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":"f829b0b4d6f4a5082492884a5fb0f277cc11e38b9861c49c881e3dadc51f6597","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-28T05:30:49Z","title_canon_sha256":"6abafd67879469d1be8e80c0a14486777d3e0341dab18c6719e544ef23c9fb2c"},"schema_version":"1.0","source":{"id":"1309.7429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7429","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7429v1","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7429","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"APU6TEWPE6ZL","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"APU6TEWPE6ZLSBEO","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"APU6TEWP","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:41685d58f8a7315552e220697a762b217961bfa7cba0e7e6cc0d5630fbf31ed6","target":"graph","created_at":"2026-05-18T03:11:58Z","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":"Distributed storage systems with replication are well known for storing large amount of data. A large number of replication is done in order to provide reliability. This makes the system expensive. Various methods have been proposed over time to reduce the degree of replication and yet provide same level of reliability. One recently suggested scheme is of Regenerating codes, where a file is divided in to parts which are then processed by a coding mechanism and network coding to provide large number of parts. These are stored at various nodes with more than one part at each node. These codes ca","authors_text":"Krishna Gopal Benerjee, Manish K. Gupta, Mit Sheth","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-28T05:30:49Z","title":"Quorum Sensing for Regenerating Codes in Distributed Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7429","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:f59e4a1aa681e2e22af00e911ee2a5a396b15fac237c33c1da9b3a9b31a0039b","target":"record","created_at":"2026-05-18T03:11:58Z","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":"f829b0b4d6f4a5082492884a5fb0f277cc11e38b9861c49c881e3dadc51f6597","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-28T05:30:49Z","title_canon_sha256":"6abafd67879469d1be8e80c0a14486777d3e0341dab18c6719e544ef23c9fb2c"},"schema_version":"1.0","source":{"id":"1309.7429","kind":"arxiv","version":1}},"canonical_sha256":"03e9e992cf27b2b9048e863c482eae174f811a680120d1bb7e87876250ee2afb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03e9e992cf27b2b9048e863c482eae174f811a680120d1bb7e87876250ee2afb","first_computed_at":"2026-05-18T03:11:58.728116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:58.728116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bziX6So+smvzImWoiYNBg978fNXocQAErlxse5R65QeZYAJmas0R3uY+7/atBIj/rGDEU6Gln0rgsAke7pv5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:58.728953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f59e4a1aa681e2e22af00e911ee2a5a396b15fac237c33c1da9b3a9b31a0039b","sha256:41685d58f8a7315552e220697a762b217961bfa7cba0e7e6cc0d5630fbf31ed6"],"state_sha256":"f9caf55aa300ac9357f35e8a2258ec9b6ab1949a9564f6684c4b57f49145b400"}