{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FEKHVRYLE656D447NZOWXHDVRK","short_pith_number":"pith:FEKHVRYL","canonical_record":{"source":{"id":"1212.2894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T04:12:46Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"8904261769b02be2b56cd57c2c510758a662e8256df9184010f45291e1c56966","abstract_canon_sha256":"fe41503c9e7dcfd9ee597b33fd9da94962d860a86837fe5c0a769f0a2581b8b6"},"schema_version":"1.0"},"canonical_sha256":"29147ac70b27bbe1f39f6e5d6b9c758abccc65363bc4d6659bfd25c3b5b2af83","source":{"kind":"arxiv","id":"1212.2894","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2894","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2894v1","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2894","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"FEKHVRYLE656","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FEKHVRYLE656D447","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FEKHVRYL","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FEKHVRYLE656D447NZOWXHDVRK","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T04:12:46Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"8904261769b02be2b56cd57c2c510758a662e8256df9184010f45291e1c56966","abstract_canon_sha256":"fe41503c9e7dcfd9ee597b33fd9da94962d860a86837fe5c0a769f0a2581b8b6"},"schema_version":"1.0"},"canonical_sha256":"29147ac70b27bbe1f39f6e5d6b9c758abccc65363bc4d6659bfd25c3b5b2af83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:35.021600Z","signature_b64":"hpVIeJNdgM752GYzHz8ir4wmC1Mn0JWX5JWmkury2INUceu77niWk45E1BrZHwwNLcYmvYWXVNkMTYDNMGtLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29147ac70b27bbe1f39f6e5d6b9c758abccc65363bc4d6659bfd25c3b5b2af83","last_reissued_at":"2026-05-18T03:38:35.020760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:35.020760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2894","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-18T03:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wF8aDxpK4NHbYXHHuTPsEdUXP+YJu0Bw56LbAlxhVAybJCUWsqLNGIiKsI2eqLqCw9YE5aklFdQouLnc3pZkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:28:47.532846Z"},"content_sha256":"6cf4c6856e276444da721cad3d124406b864005dfe5770020dc4ee148789ba97","schema_version":"1.0","event_id":"sha256:6cf4c6856e276444da721cad3d124406b864005dfe5770020dc4ee148789ba97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FEKHVRYLE656D447NZOWXHDVRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducing Reconciliation Communication Cost with Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Chia-Mu Yu, H. T. Kung","submitted_at":"2012-12-05T04:12:46Z","abstract_excerpt":"We consider a reconciliation problem, where two hosts wish to synchronize their respective sets. Efficient solutions for minimizing the communication cost between the two hosts have been previously proposed in the literature. However, they rely on prior knowledge about the size of the set differences between the two sets to be reconciled. In this paper, we propose a method which can achieve comparable efficiency without assuming this prior knowledge. Our method uses compressive sensing techniques which can leverage the expected sparsity in set differences. We study the performance of the metho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2894","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-18T03:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hoh9P/U8b8cpQxFi3CE++fqgqEyONVV+rtxg81oGrUbySp624MEY/VQgQhJ5GWbwydUpAWSKcS7qkQMEs4dLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:28:47.533520Z"},"content_sha256":"111e64071204bfb0b4fccb4bd3eac685da3e31d2859ebc15682bbdd48e926947","schema_version":"1.0","event_id":"sha256:111e64071204bfb0b4fccb4bd3eac685da3e31d2859ebc15682bbdd48e926947"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEKHVRYLE656D447NZOWXHDVRK/bundle.json","state_url":"https://pith.science/pith/FEKHVRYLE656D447NZOWXHDVRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEKHVRYLE656D447NZOWXHDVRK/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-23T02:28:47Z","links":{"resolver":"https://pith.science/pith/FEKHVRYLE656D447NZOWXHDVRK","bundle":"https://pith.science/pith/FEKHVRYLE656D447NZOWXHDVRK/bundle.json","state":"https://pith.science/pith/FEKHVRYLE656D447NZOWXHDVRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEKHVRYLE656D447NZOWXHDVRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FEKHVRYLE656D447NZOWXHDVRK","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":"fe41503c9e7dcfd9ee597b33fd9da94962d860a86837fe5c0a769f0a2581b8b6","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T04:12:46Z","title_canon_sha256":"8904261769b02be2b56cd57c2c510758a662e8256df9184010f45291e1c56966"},"schema_version":"1.0","source":{"id":"1212.2894","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2894","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2894v1","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2894","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"FEKHVRYLE656","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FEKHVRYLE656D447","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FEKHVRYL","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:111e64071204bfb0b4fccb4bd3eac685da3e31d2859ebc15682bbdd48e926947","target":"graph","created_at":"2026-05-18T03:38:35Z","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":"We consider a reconciliation problem, where two hosts wish to synchronize their respective sets. Efficient solutions for minimizing the communication cost between the two hosts have been previously proposed in the literature. However, they rely on prior knowledge about the size of the set differences between the two sets to be reconciled. In this paper, we propose a method which can achieve comparable efficiency without assuming this prior knowledge. Our method uses compressive sensing techniques which can leverage the expected sparsity in set differences. We study the performance of the metho","authors_text":"Chia-Mu Yu, H. T. Kung","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T04:12:46Z","title":"Reducing Reconciliation Communication Cost with Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2894","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:6cf4c6856e276444da721cad3d124406b864005dfe5770020dc4ee148789ba97","target":"record","created_at":"2026-05-18T03:38:35Z","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":"fe41503c9e7dcfd9ee597b33fd9da94962d860a86837fe5c0a769f0a2581b8b6","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T04:12:46Z","title_canon_sha256":"8904261769b02be2b56cd57c2c510758a662e8256df9184010f45291e1c56966"},"schema_version":"1.0","source":{"id":"1212.2894","kind":"arxiv","version":1}},"canonical_sha256":"29147ac70b27bbe1f39f6e5d6b9c758abccc65363bc4d6659bfd25c3b5b2af83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29147ac70b27bbe1f39f6e5d6b9c758abccc65363bc4d6659bfd25c3b5b2af83","first_computed_at":"2026-05-18T03:38:35.020760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:35.020760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hpVIeJNdgM752GYzHz8ir4wmC1Mn0JWX5JWmkury2INUceu77niWk45E1BrZHwwNLcYmvYWXVNkMTYDNMGtLCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:35.021600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2894","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cf4c6856e276444da721cad3d124406b864005dfe5770020dc4ee148789ba97","sha256:111e64071204bfb0b4fccb4bd3eac685da3e31d2859ebc15682bbdd48e926947"],"state_sha256":"1e0adf48019a5396afb664a4fad749110b8a87dce89acf1fccc480383b2938ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzfP5Ur6Cz6Bnx2VnlW4R9rAICe7e0jW70Y/XDXl51hyEC4ltI+JOGmIM4ckvLzvkveY8TJaDJcwxklpUR8WBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T02:28:47.536910Z","bundle_sha256":"319a4df4e8cdb4b3e72f27cbbd2f2fa314867b1a07f3b6f68404ef0238938c27"}}