{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7TPBV5NSBU4R7E7446DHXG5AAW","short_pith_number":"pith:7TPBV5NS","canonical_record":{"source":{"id":"1208.0798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-03T17:15:53Z","cross_cats_sorted":[],"title_canon_sha256":"89cd1cd10442fae766f99f02641ed310d49b528e2c7b471496114a019cb15533","abstract_canon_sha256":"531e02454be9caf14c5942584b6db28664118e945d48b35ee0bb84c41624e8e0"},"schema_version":"1.0"},"canonical_sha256":"fcde1af5b20d391f93fce7867b9ba005855bb0d070ca2d0351880ee7ac14bbc8","source":{"kind":"arxiv","id":"1208.0798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0798","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0798v1","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0798","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"7TPBV5NSBU4R","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7TPBV5NSBU4R7E74","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7TPBV5NS","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7TPBV5NSBU4R7E7446DHXG5AAW","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-03T17:15:53Z","cross_cats_sorted":[],"title_canon_sha256":"89cd1cd10442fae766f99f02641ed310d49b528e2c7b471496114a019cb15533","abstract_canon_sha256":"531e02454be9caf14c5942584b6db28664118e945d48b35ee0bb84c41624e8e0"},"schema_version":"1.0"},"canonical_sha256":"fcde1af5b20d391f93fce7867b9ba005855bb0d070ca2d0351880ee7ac14bbc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.540183Z","signature_b64":"2o3ZJuI/wMj6lJCf7iAL6uBnjaWt6F5TI4Ycq0f+Fsjs1PH7dofdvNGKWaJxYcRf1RH55LnbItLHb/p7tgE5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcde1af5b20d391f93fce7867b9ba005855bb0d070ca2d0351880ee7ac14bbc8","last_reissued_at":"2026-05-18T02:21:01.539685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.539685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0798","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-18T02:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/SHGvofpNfJ3B5Y07pGEGW9uETJOvtYN1exyZf3d27gQ1AATGtOBjUf3ER3kap1kzMtETAxhn+/4br6kOuBpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:34:41.614560Z"},"content_sha256":"1afeeac6173fb0f5dd42523d69eb4f3f79d62baccee0ac14f5adf06b2a2ae3e7","schema_version":"1.0","event_id":"sha256:1afeeac6173fb0f5dd42523d69eb4f3f79d62baccee0ac14f5adf06b2a2ae3e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7TPBV5NSBU4R7E7446DHXG5AAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Varghese, Michael Mitzenmacher","submitted_at":"2012-08-03T17:15:53Z","abstract_excerpt":"Large data sets are increasingly common in cloud and virtualized environments. For example, transfers of multiple gigabytes are commonplace, as are replicated blocks of such sizes. There is a need for fast error-correction or data reconciliation in such settings even when the expected number of errors is small.\n  Motivated by such cloud reconciliation problems, we consider error-correction schemes designed for large data, after explaining why previous approaches appear unsuitable. We introduce Biff codes, which are based on Bloom filters and are designed for large data. For Biff codes with a m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0798","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-18T02:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7zZe8LCHyjOQ9lvs5FXtuzv08mqKlCjxSPbfPQgJWTHEmwkTNmiy3furtvzcGPQrureavmSdURhJeOgJ2hbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:34:41.615293Z"},"content_sha256":"ea2ab23dc75b370c4196706dc616e9c5fafb8ef2e2e046a6ff956c39329917da","schema_version":"1.0","event_id":"sha256:ea2ab23dc75b370c4196706dc616e9c5fafb8ef2e2e046a6ff956c39329917da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TPBV5NSBU4R7E7446DHXG5AAW/bundle.json","state_url":"https://pith.science/pith/7TPBV5NSBU4R7E7446DHXG5AAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TPBV5NSBU4R7E7446DHXG5AAW/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-06-09T18:34:41Z","links":{"resolver":"https://pith.science/pith/7TPBV5NSBU4R7E7446DHXG5AAW","bundle":"https://pith.science/pith/7TPBV5NSBU4R7E7446DHXG5AAW/bundle.json","state":"https://pith.science/pith/7TPBV5NSBU4R7E7446DHXG5AAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TPBV5NSBU4R7E7446DHXG5AAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7TPBV5NSBU4R7E7446DHXG5AAW","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":"531e02454be9caf14c5942584b6db28664118e945d48b35ee0bb84c41624e8e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-03T17:15:53Z","title_canon_sha256":"89cd1cd10442fae766f99f02641ed310d49b528e2c7b471496114a019cb15533"},"schema_version":"1.0","source":{"id":"1208.0798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0798","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0798v1","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0798","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"7TPBV5NSBU4R","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7TPBV5NSBU4R7E74","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7TPBV5NS","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:ea2ab23dc75b370c4196706dc616e9c5fafb8ef2e2e046a6ff956c39329917da","target":"graph","created_at":"2026-05-18T02:21:01Z","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":"Large data sets are increasingly common in cloud and virtualized environments. For example, transfers of multiple gigabytes are commonplace, as are replicated blocks of such sizes. There is a need for fast error-correction or data reconciliation in such settings even when the expected number of errors is small.\n  Motivated by such cloud reconciliation problems, we consider error-correction schemes designed for large data, after explaining why previous approaches appear unsuitable. We introduce Biff codes, which are based on Bloom filters and are designed for large data. For Biff codes with a m","authors_text":"George Varghese, Michael Mitzenmacher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-03T17:15:53Z","title":"Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0798","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:1afeeac6173fb0f5dd42523d69eb4f3f79d62baccee0ac14f5adf06b2a2ae3e7","target":"record","created_at":"2026-05-18T02:21:01Z","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":"531e02454be9caf14c5942584b6db28664118e945d48b35ee0bb84c41624e8e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-03T17:15:53Z","title_canon_sha256":"89cd1cd10442fae766f99f02641ed310d49b528e2c7b471496114a019cb15533"},"schema_version":"1.0","source":{"id":"1208.0798","kind":"arxiv","version":1}},"canonical_sha256":"fcde1af5b20d391f93fce7867b9ba005855bb0d070ca2d0351880ee7ac14bbc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcde1af5b20d391f93fce7867b9ba005855bb0d070ca2d0351880ee7ac14bbc8","first_computed_at":"2026-05-18T02:21:01.539685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:01.539685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2o3ZJuI/wMj6lJCf7iAL6uBnjaWt6F5TI4Ycq0f+Fsjs1PH7dofdvNGKWaJxYcRf1RH55LnbItLHb/p7tgE5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:01.540183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1afeeac6173fb0f5dd42523d69eb4f3f79d62baccee0ac14f5adf06b2a2ae3e7","sha256:ea2ab23dc75b370c4196706dc616e9c5fafb8ef2e2e046a6ff956c39329917da"],"state_sha256":"d977a116693293af417a7b3bd44f7d5d0bdc1038f78ac7c13fc56e7e98f73899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNRlDNhvcd2Yq8xmH/EyPuL0GTs3TluDhXFSpwjQpsUgFnmik38KH1M5jG1xBhieKWJ+J75H4sHxud2hpKmCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:34:41.619524Z","bundle_sha256":"d6d8fee63d4b4894467ba83f53fe32a55c0abcb05a4190a0d9588cbb2673774e"}}