{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AAPQ5IIUY3HA55DDGV4K62PAIE","short_pith_number":"pith:AAPQ5IIU","canonical_record":{"source":{"id":"1308.1887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-08T16:02:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a7b9ac076e7ea1fe24825dceb71b85e71e433b906adeb38bbe4d20dc063aa70","abstract_canon_sha256":"f508b7e6dc25f8559a54fdba7b873bdc722de828e15afc8ba247d46a192b7449"},"schema_version":"1.0"},"canonical_sha256":"001f0ea114c6ce0ef4633578af69e04104efa2dffa4bed6e95efb8eb38ceea7f","source":{"kind":"arxiv","id":"1308.1887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1887","created_at":"2026-05-18T03:16:08Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1887v2","created_at":"2026-05-18T03:16:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1887","created_at":"2026-05-18T03:16:08Z"},{"alias_kind":"pith_short_12","alias_value":"AAPQ5IIUY3HA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AAPQ5IIUY3HA55DD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AAPQ5IIU","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AAPQ5IIUY3HA55DDGV4K62PAIE","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-08T16:02:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a7b9ac076e7ea1fe24825dceb71b85e71e433b906adeb38bbe4d20dc063aa70","abstract_canon_sha256":"f508b7e6dc25f8559a54fdba7b873bdc722de828e15afc8ba247d46a192b7449"},"schema_version":"1.0"},"canonical_sha256":"001f0ea114c6ce0ef4633578af69e04104efa2dffa4bed6e95efb8eb38ceea7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:08.128895Z","signature_b64":"2y3XTdD0bJw9WGEzLDpMNHZ8GSKN7sGPEHkz6u4vLLIXCgdgxXeCUkwPBQFCMrc2LrBm8SP+SKTzqpqRX9Z4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"001f0ea114c6ce0ef4633578af69e04104efa2dffa4bed6e95efb8eb38ceea7f","last_reissued_at":"2026-05-18T03:16:08.128144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:08.128144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1887","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-18T03:16:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0Q6C7a5UgQlvlEI/mmkopUgIHkb0P51jyvMGnRq41jWhE5FOU/XSiZIGA3X9XS97PBpG7i1/+wllVVm9k64CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T10:50:34.881175Z"},"content_sha256":"264b0c617bc9a6e583f7dd51565c121c8439ef14fccabd5e84d70144f59b5b9f","schema_version":"1.0","event_id":"sha256:264b0c617bc9a6e583f7dd51565c121c8439ef14fccabd5e84d70144f59b5b9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AAPQ5IIUY3HA55DDGV4K62PAIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparing cost and performance of replication and erasure coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ab de Kwant, John Cook, Robert Primmer","submitted_at":"2013-08-08T16:02:21Z","abstract_excerpt":"Data storage systems are more reliable than their individual components. In order to build highly reliable systems out of less reliable parts, systems introduce redundancy. In replicated systems, objects are simply copied several times with each copy residing on a different physical device. While such an approach is simple and direct, more elaborate approaches such as erasure coding can achieve equivalent levels of data protection while using less redundancy. This report examines the trade-offs in cost and performance between replicated and erasure encoded storage systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1887","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-18T03:16:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhPDCGpSctI96Cx9b4ZQG+rw6i6j3VF9wuJHbLTvKWnEAEkbgdyV3f1ioKYLweAW2GJVaP0fX78rFpjQqVHWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T10:50:34.881526Z"},"content_sha256":"85aec3dbf47afbb935e79f260bfcecc74b5eb7cc7a8c7fee4d287d9f93b652da","schema_version":"1.0","event_id":"sha256:85aec3dbf47afbb935e79f260bfcecc74b5eb7cc7a8c7fee4d287d9f93b652da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAPQ5IIUY3HA55DDGV4K62PAIE/bundle.json","state_url":"https://pith.science/pith/AAPQ5IIUY3HA55DDGV4K62PAIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAPQ5IIUY3HA55DDGV4K62PAIE/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-08-19T10:50:34Z","links":{"resolver":"https://pith.science/pith/AAPQ5IIUY3HA55DDGV4K62PAIE","bundle":"https://pith.science/pith/AAPQ5IIUY3HA55DDGV4K62PAIE/bundle.json","state":"https://pith.science/pith/AAPQ5IIUY3HA55DDGV4K62PAIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAPQ5IIUY3HA55DDGV4K62PAIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AAPQ5IIUY3HA55DDGV4K62PAIE","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":"f508b7e6dc25f8559a54fdba7b873bdc722de828e15afc8ba247d46a192b7449","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-08T16:02:21Z","title_canon_sha256":"1a7b9ac076e7ea1fe24825dceb71b85e71e433b906adeb38bbe4d20dc063aa70"},"schema_version":"1.0","source":{"id":"1308.1887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1887","created_at":"2026-05-18T03:16:08Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1887v2","created_at":"2026-05-18T03:16:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1887","created_at":"2026-05-18T03:16:08Z"},{"alias_kind":"pith_short_12","alias_value":"AAPQ5IIUY3HA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AAPQ5IIUY3HA55DD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AAPQ5IIU","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:85aec3dbf47afbb935e79f260bfcecc74b5eb7cc7a8c7fee4d287d9f93b652da","target":"graph","created_at":"2026-05-18T03:16:08Z","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":"Data storage systems are more reliable than their individual components. In order to build highly reliable systems out of less reliable parts, systems introduce redundancy. In replicated systems, objects are simply copied several times with each copy residing on a different physical device. While such an approach is simple and direct, more elaborate approaches such as erasure coding can achieve equivalent levels of data protection while using less redundancy. This report examines the trade-offs in cost and performance between replicated and erasure encoded storage systems.","authors_text":"Ab de Kwant, John Cook, Robert Primmer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-08T16:02:21Z","title":"Comparing cost and performance of replication and erasure coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1887","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:264b0c617bc9a6e583f7dd51565c121c8439ef14fccabd5e84d70144f59b5b9f","target":"record","created_at":"2026-05-18T03:16:08Z","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":"f508b7e6dc25f8559a54fdba7b873bdc722de828e15afc8ba247d46a192b7449","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-08T16:02:21Z","title_canon_sha256":"1a7b9ac076e7ea1fe24825dceb71b85e71e433b906adeb38bbe4d20dc063aa70"},"schema_version":"1.0","source":{"id":"1308.1887","kind":"arxiv","version":2}},"canonical_sha256":"001f0ea114c6ce0ef4633578af69e04104efa2dffa4bed6e95efb8eb38ceea7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"001f0ea114c6ce0ef4633578af69e04104efa2dffa4bed6e95efb8eb38ceea7f","first_computed_at":"2026-05-18T03:16:08.128144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:08.128144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2y3XTdD0bJw9WGEzLDpMNHZ8GSKN7sGPEHkz6u4vLLIXCgdgxXeCUkwPBQFCMrc2LrBm8SP+SKTzqpqRX9Z4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:08.128895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:264b0c617bc9a6e583f7dd51565c121c8439ef14fccabd5e84d70144f59b5b9f","sha256:85aec3dbf47afbb935e79f260bfcecc74b5eb7cc7a8c7fee4d287d9f93b652da"],"state_sha256":"cff031279563786bd9142339376994e6ad8ef885f90b0b2bd88be4bb9f22cdb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXGQhFOQw10ZJleHNlxleOxw+23JFFiWbEXOVMriNc4340m+33LISc+eEYQJaz6FQwL3ZnbvscrQOd4pyupmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T10:50:34.883980Z","bundle_sha256":"11cfff604016ec5f9b01012cc15d743b6bf2863d2c0ebf6e0124a44376b96de4"}}