{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EQZE37RZAHJKRZFRCPF2RO4LXR","short_pith_number":"pith:EQZE37RZ","canonical_record":{"source":{"id":"1410.2645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-09T22:45:50Z","cross_cats_sorted":[],"title_canon_sha256":"fd10ad002ca806b8a227115a75c4e75bec11415eb25d116c697f94c8da928c5e","abstract_canon_sha256":"68d5937fa8d09b88fe40cec7dea11389003626fa4b96b1af2eae7abbad83323b"},"schema_version":"1.0"},"canonical_sha256":"24324dfe3901d2a8e4b113cba8bb8bbc578dce44b7cffc4d706cf413491cd9a0","source":{"kind":"arxiv","id":"1410.2645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2645","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2645v1","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2645","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"EQZE37RZAHJK","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EQZE37RZAHJKRZFR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EQZE37RZ","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EQZE37RZAHJKRZFRCPF2RO4LXR","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-09T22:45:50Z","cross_cats_sorted":[],"title_canon_sha256":"fd10ad002ca806b8a227115a75c4e75bec11415eb25d116c697f94c8da928c5e","abstract_canon_sha256":"68d5937fa8d09b88fe40cec7dea11389003626fa4b96b1af2eae7abbad83323b"},"schema_version":"1.0"},"canonical_sha256":"24324dfe3901d2a8e4b113cba8bb8bbc578dce44b7cffc4d706cf413491cd9a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:37.737213Z","signature_b64":"zpBiHoxe6C2XW9kMi05j+mRtLureu3N2gBzqRteZ43Jxi5CeEdp+vzWdkzMKbdc5+tLzJX8javTO9946ynKeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24324dfe3901d2a8e4b113cba8bb8bbc578dce44b7cffc4d706cf413491cd9a0","last_reissued_at":"2026-05-18T02:40:37.736471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:37.736471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2645","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:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PeXdRuF+dZeVwb3HHrYDG7T2cdrDKe2yNUU0Q5KSt/TM6aae7R0CT1zbqqbKtX+yogBpA5R0jEevplEFhFlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:49:49.041951Z"},"content_sha256":"f1d0e43d6f0ab7570322b031d992732f89342cff9b548a2b957d42fdc09e52c6","schema_version":"1.0","event_id":"sha256:f1d0e43d6f0ab7570322b031d992732f89342cff9b548a2b957d42fdc09e52c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EQZE37RZAHJKRZFRCPF2RO4LXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Party Set Reconciliation Using Characteristic Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anudhyan Boral, Michael Mitzenmacher","submitted_at":"2014-10-09T22:45:50Z","abstract_excerpt":"In the standard set reconciliation problem, there are two parties $A_1$ and $A_2$, each respectively holding a set of elements $S_1$ and $S_2$. The goal is for both parties to obtain the union $S_1 \\cup S_2$. In many distributed computing settings the sets may be large but the set difference $|S_1-S_2|+|S_2-S_1|$ is small. In these cases one aims to achieve reconciliation efficiently in terms of communication; ideally, the communication should depend on the size of the set difference, and not on the size of the sets.\n  Recent work has considered generalizations of the reconciliation problem to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2645","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:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJFYXuy0YCdjTGjyvCB68N3pCNpngWvosh+X9o54SDnFGMg8dRQiO7O/zVhxQBq/BvOlzl8tNer/0eJq7v1LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:49:49.042572Z"},"content_sha256":"8b4429471ac243ab7fc9c833ce4acbd22c7994c94fcdbecd05d15b91ae78a06c","schema_version":"1.0","event_id":"sha256:8b4429471ac243ab7fc9c833ce4acbd22c7994c94fcdbecd05d15b91ae78a06c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQZE37RZAHJKRZFRCPF2RO4LXR/bundle.json","state_url":"https://pith.science/pith/EQZE37RZAHJKRZFRCPF2RO4LXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQZE37RZAHJKRZFRCPF2RO4LXR/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-03T14:49:49Z","links":{"resolver":"https://pith.science/pith/EQZE37RZAHJKRZFRCPF2RO4LXR","bundle":"https://pith.science/pith/EQZE37RZAHJKRZFRCPF2RO4LXR/bundle.json","state":"https://pith.science/pith/EQZE37RZAHJKRZFRCPF2RO4LXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQZE37RZAHJKRZFRCPF2RO4LXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EQZE37RZAHJKRZFRCPF2RO4LXR","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":"68d5937fa8d09b88fe40cec7dea11389003626fa4b96b1af2eae7abbad83323b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-09T22:45:50Z","title_canon_sha256":"fd10ad002ca806b8a227115a75c4e75bec11415eb25d116c697f94c8da928c5e"},"schema_version":"1.0","source":{"id":"1410.2645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2645","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2645v1","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2645","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"EQZE37RZAHJK","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EQZE37RZAHJKRZFR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EQZE37RZ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:8b4429471ac243ab7fc9c833ce4acbd22c7994c94fcdbecd05d15b91ae78a06c","target":"graph","created_at":"2026-05-18T02:40:37Z","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":"In the standard set reconciliation problem, there are two parties $A_1$ and $A_2$, each respectively holding a set of elements $S_1$ and $S_2$. The goal is for both parties to obtain the union $S_1 \\cup S_2$. In many distributed computing settings the sets may be large but the set difference $|S_1-S_2|+|S_2-S_1|$ is small. In these cases one aims to achieve reconciliation efficiently in terms of communication; ideally, the communication should depend on the size of the set difference, and not on the size of the sets.\n  Recent work has considered generalizations of the reconciliation problem to","authors_text":"Anudhyan Boral, Michael Mitzenmacher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-09T22:45:50Z","title":"Multi-Party Set Reconciliation Using Characteristic Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2645","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:f1d0e43d6f0ab7570322b031d992732f89342cff9b548a2b957d42fdc09e52c6","target":"record","created_at":"2026-05-18T02:40:37Z","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":"68d5937fa8d09b88fe40cec7dea11389003626fa4b96b1af2eae7abbad83323b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-09T22:45:50Z","title_canon_sha256":"fd10ad002ca806b8a227115a75c4e75bec11415eb25d116c697f94c8da928c5e"},"schema_version":"1.0","source":{"id":"1410.2645","kind":"arxiv","version":1}},"canonical_sha256":"24324dfe3901d2a8e4b113cba8bb8bbc578dce44b7cffc4d706cf413491cd9a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24324dfe3901d2a8e4b113cba8bb8bbc578dce44b7cffc4d706cf413491cd9a0","first_computed_at":"2026-05-18T02:40:37.736471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:37.736471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpBiHoxe6C2XW9kMi05j+mRtLureu3N2gBzqRteZ43Jxi5CeEdp+vzWdkzMKbdc5+tLzJX8javTO9946ynKeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:37.737213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1d0e43d6f0ab7570322b031d992732f89342cff9b548a2b957d42fdc09e52c6","sha256:8b4429471ac243ab7fc9c833ce4acbd22c7994c94fcdbecd05d15b91ae78a06c"],"state_sha256":"83895ac1e2b149eee52c1a49da3cb1f1443eb8453d0b7faa46be95b9257fd19c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DnGk36QzkTOoZkMgcBJt/yHm64w1LzaEPDyHuz1HdkxvX/zl64ysqX2s6/9BdkBUeUBLCy09OIL/MGXle1rmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:49:49.045161Z","bundle_sha256":"79f8c1792376ff0cb8ffeaf566b7c9a19b627cc52b0a313296d135d053a5cad9"}}