{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2QAUXIS6KXKF5LZZNLPJTNALKS","short_pith_number":"pith:2QAUXIS6","canonical_record":{"source":{"id":"1107.3129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T18:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"e0e69392cfe1d08b3addca81b857fbee29f649f18e52661518009e3ec38f51ff","abstract_canon_sha256":"0ac1d10733e118d66505ee9ff9a77cebf27b22a469c6cc83972d0b7dae6256f0"},"schema_version":"1.0"},"canonical_sha256":"d4014ba25e55d45eaf396ade99b40b54873a16b863ad70663149c5b4b461ca3f","source":{"kind":"arxiv","id":"1107.3129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3129","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3129v1","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3129","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"2QAUXIS6KXKF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2QAUXIS6KXKF5LZZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2QAUXIS6","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2QAUXIS6KXKF5LZZNLPJTNALKS","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T18:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"e0e69392cfe1d08b3addca81b857fbee29f649f18e52661518009e3ec38f51ff","abstract_canon_sha256":"0ac1d10733e118d66505ee9ff9a77cebf27b22a469c6cc83972d0b7dae6256f0"},"schema_version":"1.0"},"canonical_sha256":"d4014ba25e55d45eaf396ade99b40b54873a16b863ad70663149c5b4b461ca3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:47.214835Z","signature_b64":"YmIkfDHC1AH4nbvGUsKHcQgjXH6DlvkXNeY5Bh5/kdl4yNii0sS/m4eqsXP50ZfED9qS68NBatd2X/eqfe8jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4014ba25e55d45eaf396ade99b40b54873a16b863ad70663149c5b4b461ca3f","last_reissued_at":"2026-05-18T04:05:47.214447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:47.214447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3129","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-18T04:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yn+ojjuvQnFhqVGDY+ytP5JW1iXVUthz1NL6WshDio6XXyjE/B8TDiP+8y8hdKN8WbNV3tKf5bo1KOj22bUQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:35:02.862208Z"},"content_sha256":"bdd3f872cf5b26f95cd85a3a69901d6d616a4faae286c081abd7f61b6b37ca12","schema_version":"1.0","event_id":"sha256:bdd3f872cf5b26f95cd85a3a69901d6d616a4faae286c081abd7f61b6b37ca12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2QAUXIS6KXKF5LZZNLPJTNALKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Frederique Oggier","submitted_at":"2011-07-15T18:46:33Z","abstract_excerpt":"Distributed data storage systems are essential to deal with the need to store massive volumes of data. In order to make such a system fault-tolerant, some form of redundancy becomes crucial, incurring various overheads - most prominently in terms of storage space and maintenance bandwidth requirements. Erasure codes, originally designed for communication over lossy channels, provide a storage efficient alternative to replication based redundancy, however entailing high communication overhead for maintenance, when some of the encoded fragments need to be replenished in news ones after failure o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3129","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-18T04:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8jfzOW/QX08iu5vl7Q37tPvDszCpOE/XsNWXvp90UwhP3ehEwiUcpBQog6z4giYpBzU294F/A7kAnxWPc5LCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:35:02.862568Z"},"content_sha256":"0a2474b77b0bbeef694cbe4d5bef43cab640b95cb9b74a4ada23f537d9b8577f","schema_version":"1.0","event_id":"sha256:0a2474b77b0bbeef694cbe4d5bef43cab640b95cb9b74a4ada23f537d9b8577f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/bundle.json","state_url":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/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-28T00:35:02Z","links":{"resolver":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS","bundle":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/bundle.json","state":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2QAUXIS6KXKF5LZZNLPJTNALKS","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":"0ac1d10733e118d66505ee9ff9a77cebf27b22a469c6cc83972d0b7dae6256f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T18:46:33Z","title_canon_sha256":"e0e69392cfe1d08b3addca81b857fbee29f649f18e52661518009e3ec38f51ff"},"schema_version":"1.0","source":{"id":"1107.3129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3129","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3129v1","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3129","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"2QAUXIS6KXKF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2QAUXIS6KXKF5LZZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2QAUXIS6","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:0a2474b77b0bbeef694cbe4d5bef43cab640b95cb9b74a4ada23f537d9b8577f","target":"graph","created_at":"2026-05-18T04:05:47Z","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 data storage systems are essential to deal with the need to store massive volumes of data. In order to make such a system fault-tolerant, some form of redundancy becomes crucial, incurring various overheads - most prominently in terms of storage space and maintenance bandwidth requirements. Erasure codes, originally designed for communication over lossy channels, provide a storage efficient alternative to replication based redundancy, however entailing high communication overhead for maintenance, when some of the encoded fragments need to be replenished in news ones after failure o","authors_text":"Anwitaman Datta, Frederique Oggier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T18:46:33Z","title":"Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3129","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:bdd3f872cf5b26f95cd85a3a69901d6d616a4faae286c081abd7f61b6b37ca12","target":"record","created_at":"2026-05-18T04:05:47Z","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":"0ac1d10733e118d66505ee9ff9a77cebf27b22a469c6cc83972d0b7dae6256f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T18:46:33Z","title_canon_sha256":"e0e69392cfe1d08b3addca81b857fbee29f649f18e52661518009e3ec38f51ff"},"schema_version":"1.0","source":{"id":"1107.3129","kind":"arxiv","version":1}},"canonical_sha256":"d4014ba25e55d45eaf396ade99b40b54873a16b863ad70663149c5b4b461ca3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4014ba25e55d45eaf396ade99b40b54873a16b863ad70663149c5b4b461ca3f","first_computed_at":"2026-05-18T04:05:47.214447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:47.214447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YmIkfDHC1AH4nbvGUsKHcQgjXH6DlvkXNeY5Bh5/kdl4yNii0sS/m4eqsXP50ZfED9qS68NBatd2X/eqfe8jCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:47.214835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdd3f872cf5b26f95cd85a3a69901d6d616a4faae286c081abd7f61b6b37ca12","sha256:0a2474b77b0bbeef694cbe4d5bef43cab640b95cb9b74a4ada23f537d9b8577f"],"state_sha256":"0a4049174f93c17e74a10ef1d66993829c7f620f8c741dd2b83f8c801bc8de0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2YoILmC7tJAHHqyVpsnITL/+edkNvGyBAXkn3ITZyh91WLCcj2Q06OZV/srOgCE2oGogscaiLfGxUG0DbmzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:35:02.864475Z","bundle_sha256":"8994c987e7586be87ff4db33252890b33b20a3f34c71ce5cabec05ae6931be95"}}