{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:766NCCH37JMUWPJ3ASH3IA7IN4","short_pith_number":"pith:766NCCH3","canonical_record":{"source":{"id":"1111.4533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-19T04:50:34Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"1d047eee9800554a07c14ac20ee673e2278167b9dc4a798a031e6a8fcf6cc593","abstract_canon_sha256":"542d49a89251d0becfd3fd1ccf2a161c822f2c89207b84524750331c76d4f6a9"},"schema_version":"1.0"},"canonical_sha256":"ffbcd108fbfa594b3d3b048fb403e86f0f8ef828c8d8c169cd49c18a864c3e19","source":{"kind":"arxiv","id":"1111.4533","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4533","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4533v2","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4533","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"766NCCH37JMU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"766NCCH37JMUWPJ3","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"766NCCH3","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:766NCCH37JMUWPJ3ASH3IA7IN4","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-19T04:50:34Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"1d047eee9800554a07c14ac20ee673e2278167b9dc4a798a031e6a8fcf6cc593","abstract_canon_sha256":"542d49a89251d0becfd3fd1ccf2a161c822f2c89207b84524750331c76d4f6a9"},"schema_version":"1.0"},"canonical_sha256":"ffbcd108fbfa594b3d3b048fb403e86f0f8ef828c8d8c169cd49c18a864c3e19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:28.579663Z","signature_b64":"BA7zGvRknAMMG6DoY3pVRzVYZ8BnG1R9Pe7YNbGBX0I/2FcZCdn4pUB41g9JeWGq0U9Ca8oPFCDyjzOeS6gCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffbcd108fbfa594b3d3b048fb403e86f0f8ef828c8d8c169cd49c18a864c3e19","last_reissued_at":"2026-05-18T02:21:28.578987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:28.578987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4533","source_version":2,"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-18T02:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkpU0ltoLcBrgWnYlVl0TZgYAX/nU03270gS5iSaQD57zGcktfD1z/+zuzuaHPvLnOc1hF6TmeLJydolsxg8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:21:25.367908Z"},"content_sha256":"28cfbee6648e2ec4b281f08526461ba107048c6a2ffd30df0f363637715500da","schema_version":"1.0","event_id":"sha256:28cfbee6648e2ec4b281f08526461ba107048c6a2ffd30df0f363637715500da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:766NCCH37JMUWPJ3ASH3IA7IN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In-Network Redundancy Generation for Opportunistic Speedup of Backup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Fr\\'ed\\'erique Oggier, Lluis Pamies-Juarez","submitted_at":"2011-11-19T04:50:34Z","abstract_excerpt":"Erasure coding is a storage-efficient alternative to replication for achieving reliable data backup in distributed storage systems. During the storage process, traditional erasure codes require a unique source node to create and upload all the redundant data to the different storage nodes. However, such a source node may have limited communication and computation capabilities, which constrain the storage process throughput. Moreover, the source node and the different storage nodes might not be able to send and receive data simultaneously -- e.g., nodes might be busy in a datacenter setting, or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4533","kind":"arxiv","version":2},"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-18T02:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulHyPb9YKjxFO4NJ7b19I2NoyUfneq4Dho5e+IDXBw7h/OdUqjJEjScuOZLmaV9mZ/JYw1LjOeZG+YGvZeEeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:21:25.368598Z"},"content_sha256":"d3bd5dadc4e9b5da2dc6afcec96206f637f0170eb8bc3c504b5b10751f18db83","schema_version":"1.0","event_id":"sha256:d3bd5dadc4e9b5da2dc6afcec96206f637f0170eb8bc3c504b5b10751f18db83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/766NCCH37JMUWPJ3ASH3IA7IN4/bundle.json","state_url":"https://pith.science/pith/766NCCH37JMUWPJ3ASH3IA7IN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/766NCCH37JMUWPJ3ASH3IA7IN4/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-27T13:21:25Z","links":{"resolver":"https://pith.science/pith/766NCCH37JMUWPJ3ASH3IA7IN4","bundle":"https://pith.science/pith/766NCCH37JMUWPJ3ASH3IA7IN4/bundle.json","state":"https://pith.science/pith/766NCCH37JMUWPJ3ASH3IA7IN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/766NCCH37JMUWPJ3ASH3IA7IN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:766NCCH37JMUWPJ3ASH3IA7IN4","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":"542d49a89251d0becfd3fd1ccf2a161c822f2c89207b84524750331c76d4f6a9","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-19T04:50:34Z","title_canon_sha256":"1d047eee9800554a07c14ac20ee673e2278167b9dc4a798a031e6a8fcf6cc593"},"schema_version":"1.0","source":{"id":"1111.4533","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4533","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4533v2","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4533","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"766NCCH37JMU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"766NCCH37JMUWPJ3","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"766NCCH3","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:d3bd5dadc4e9b5da2dc6afcec96206f637f0170eb8bc3c504b5b10751f18db83","target":"graph","created_at":"2026-05-18T02:21:28Z","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":"Erasure coding is a storage-efficient alternative to replication for achieving reliable data backup in distributed storage systems. During the storage process, traditional erasure codes require a unique source node to create and upload all the redundant data to the different storage nodes. However, such a source node may have limited communication and computation capabilities, which constrain the storage process throughput. Moreover, the source node and the different storage nodes might not be able to send and receive data simultaneously -- e.g., nodes might be busy in a datacenter setting, or","authors_text":"Anwitaman Datta, Fr\\'ed\\'erique Oggier, Lluis Pamies-Juarez","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-19T04:50:34Z","title":"In-Network Redundancy Generation for Opportunistic Speedup of Backup"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4533","kind":"arxiv","version":2},"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:28cfbee6648e2ec4b281f08526461ba107048c6a2ffd30df0f363637715500da","target":"record","created_at":"2026-05-18T02:21:28Z","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":"542d49a89251d0becfd3fd1ccf2a161c822f2c89207b84524750331c76d4f6a9","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-19T04:50:34Z","title_canon_sha256":"1d047eee9800554a07c14ac20ee673e2278167b9dc4a798a031e6a8fcf6cc593"},"schema_version":"1.0","source":{"id":"1111.4533","kind":"arxiv","version":2}},"canonical_sha256":"ffbcd108fbfa594b3d3b048fb403e86f0f8ef828c8d8c169cd49c18a864c3e19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffbcd108fbfa594b3d3b048fb403e86f0f8ef828c8d8c169cd49c18a864c3e19","first_computed_at":"2026-05-18T02:21:28.578987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:28.578987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BA7zGvRknAMMG6DoY3pVRzVYZ8BnG1R9Pe7YNbGBX0I/2FcZCdn4pUB41g9JeWGq0U9Ca8oPFCDyjzOeS6gCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:28.579663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4533","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28cfbee6648e2ec4b281f08526461ba107048c6a2ffd30df0f363637715500da","sha256:d3bd5dadc4e9b5da2dc6afcec96206f637f0170eb8bc3c504b5b10751f18db83"],"state_sha256":"67d7558e35303719e28305ddbb05c3391903b05d21f3d2bbf0e9baf256bc38d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qcY2/f+hJprjB5vLqx6+e2szt4zgl4zVowM3TVtIWZPRs+AunzgBNKeymVpFQgMaeTlazV5nzruBNWH6mF6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:21:25.372039Z","bundle_sha256":"999ec9ac41101b72a574187fe0e650239dcd32bcb8ecc59238e7cadee48bb028"}}