{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XYKXRAHB4S4ZNRSGFCEVJDC3K3","short_pith_number":"pith:XYKXRAHB","canonical_record":{"source":{"id":"1512.05028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T02:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"bbf1826cf41b06674c3b7b38d1ae98c06e0e47ac05789c4570cbd9cf73f1eea1","abstract_canon_sha256":"686c0e693bc748b263169c2fd8305f8be4b6a97dc3080d12727b80b816a2b70f"},"schema_version":"1.0"},"canonical_sha256":"be157880e1e4b996c6462889548c5b56da5edb90f5a33b7ba19fbc38e81d4d89","source":{"kind":"arxiv","id":"1512.05028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05028","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05028v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05028","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"XYKXRAHB4S4Z","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XYKXRAHB4S4ZNRSG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XYKXRAHB","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XYKXRAHB4S4ZNRSGFCEVJDC3K3","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T02:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"bbf1826cf41b06674c3b7b38d1ae98c06e0e47ac05789c4570cbd9cf73f1eea1","abstract_canon_sha256":"686c0e693bc748b263169c2fd8305f8be4b6a97dc3080d12727b80b816a2b70f"},"schema_version":"1.0"},"canonical_sha256":"be157880e1e4b996c6462889548c5b56da5edb90f5a33b7ba19fbc38e81d4d89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:13.698487Z","signature_b64":"LU//hZbmuSrlS2jxQdBWK2ZrIs7XSR7Q37VLR3g507a52a22tjqX7RPt0bzk64BTk2KI/w4EJ3ZqoooQWlkuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be157880e1e4b996c6462889548c5b56da5edb90f5a33b7ba19fbc38e81d4d89","last_reissued_at":"2026-05-18T01:24:13.697840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:13.697840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05028","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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASGGn0PA5wsqTf5wzxJoW/UQlebTfINYyFYCHFMKGi1Roz8B/bOuRaNU+FCJ69yu+9ugSWs2REnb3FvU7tYBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:14:28.469610Z"},"content_sha256":"b806c3865ff8f0ce343eb7cdd783a0a4f6e3bd1416c38108db6ad025752e83b3","schema_version":"1.0","event_id":"sha256:b806c3865ff8f0ce343eb7cdd783a0a4f6e3bd1416c38108db6ad025752e83b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XYKXRAHB4S4ZNRSGFCEVJDC3K3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Las Vegas reduction from one-way set reconciliation to error correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2015-12-16T02:14:51Z","abstract_excerpt":"Suppose we have two players $A$ and $C$, where player $A$ has a string $s[0..u-1]$ and player $C$ has a string $t[0..u-1]$ and none of the two players knows the other's string. Assume that $s$ and $t$ are both over an integer alphabet $[\\sigma]$, where the first string contains $n$ non-zero entries. We would wish to answer to the following basic question. Assuming that $s$ and $t$ differ in at most $k$ positions, how many bits does player $A$ need to send to player $C$ so that he can recover $s$ with certainty? Further, how much time does player $A$ need to spend to compute the sent bits and h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05028","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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYcYMu4tb4ICGqaOEz9qffnlIjghsKjA6SL6oxeSp44tAybyizRa33dVgRMgiV92HfuzSGB7mS74c6iPiaHFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:14:28.469945Z"},"content_sha256":"409150d1c9bd5559437449b2f7c825e7205b905e4d617ed11ab88b4cb1f81a35","schema_version":"1.0","event_id":"sha256:409150d1c9bd5559437449b2f7c825e7205b905e4d617ed11ab88b4cb1f81a35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYKXRAHB4S4ZNRSGFCEVJDC3K3/bundle.json","state_url":"https://pith.science/pith/XYKXRAHB4S4ZNRSGFCEVJDC3K3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYKXRAHB4S4ZNRSGFCEVJDC3K3/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-02T16:14:28Z","links":{"resolver":"https://pith.science/pith/XYKXRAHB4S4ZNRSGFCEVJDC3K3","bundle":"https://pith.science/pith/XYKXRAHB4S4ZNRSGFCEVJDC3K3/bundle.json","state":"https://pith.science/pith/XYKXRAHB4S4ZNRSGFCEVJDC3K3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYKXRAHB4S4ZNRSGFCEVJDC3K3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XYKXRAHB4S4ZNRSGFCEVJDC3K3","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":"686c0e693bc748b263169c2fd8305f8be4b6a97dc3080d12727b80b816a2b70f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T02:14:51Z","title_canon_sha256":"bbf1826cf41b06674c3b7b38d1ae98c06e0e47ac05789c4570cbd9cf73f1eea1"},"schema_version":"1.0","source":{"id":"1512.05028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05028","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05028v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05028","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"XYKXRAHB4S4Z","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XYKXRAHB4S4ZNRSG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XYKXRAHB","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:409150d1c9bd5559437449b2f7c825e7205b905e4d617ed11ab88b4cb1f81a35","target":"graph","created_at":"2026-05-18T01:24:13Z","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":"Suppose we have two players $A$ and $C$, where player $A$ has a string $s[0..u-1]$ and player $C$ has a string $t[0..u-1]$ and none of the two players knows the other's string. Assume that $s$ and $t$ are both over an integer alphabet $[\\sigma]$, where the first string contains $n$ non-zero entries. We would wish to answer to the following basic question. Assuming that $s$ and $t$ differ in at most $k$ positions, how many bits does player $A$ need to send to player $C$ so that he can recover $s$ with certainty? Further, how much time does player $A$ need to spend to compute the sent bits and h","authors_text":"Djamal Belazzougui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T02:14:51Z","title":"Optimal Las Vegas reduction from one-way set reconciliation to error correction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05028","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:b806c3865ff8f0ce343eb7cdd783a0a4f6e3bd1416c38108db6ad025752e83b3","target":"record","created_at":"2026-05-18T01:24:13Z","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":"686c0e693bc748b263169c2fd8305f8be4b6a97dc3080d12727b80b816a2b70f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T02:14:51Z","title_canon_sha256":"bbf1826cf41b06674c3b7b38d1ae98c06e0e47ac05789c4570cbd9cf73f1eea1"},"schema_version":"1.0","source":{"id":"1512.05028","kind":"arxiv","version":1}},"canonical_sha256":"be157880e1e4b996c6462889548c5b56da5edb90f5a33b7ba19fbc38e81d4d89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be157880e1e4b996c6462889548c5b56da5edb90f5a33b7ba19fbc38e81d4d89","first_computed_at":"2026-05-18T01:24:13.697840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:13.697840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LU//hZbmuSrlS2jxQdBWK2ZrIs7XSR7Q37VLR3g507a52a22tjqX7RPt0bzk64BTk2KI/w4EJ3ZqoooQWlkuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:13.698487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b806c3865ff8f0ce343eb7cdd783a0a4f6e3bd1416c38108db6ad025752e83b3","sha256:409150d1c9bd5559437449b2f7c825e7205b905e4d617ed11ab88b4cb1f81a35"],"state_sha256":"5ee498413ef1be2252b40e7f6a1f46a2a8c38d62e4bf928a5561ad89a9da98cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNK7GxtvtdJMWs2VbyAzGvZH0cLdMpRr3zHT2QpMsAhA8ODtMbv4tM0E9yQulzRq5UKTOTv92wv7aeQwmMrcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:14:28.471795Z","bundle_sha256":"a73c099bde91a6e1ecf9180f789c2e30e584b5a0314a5876be33f7bf6bbe2adc"}}