{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YE7MZQZBVQ57OYV4KKUBNXPPGW","short_pith_number":"pith:YE7MZQZB","canonical_record":{"source":{"id":"1102.1443","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-07T21:38:58Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"84b7e4a5ed0b182735077e0a0c93cd9c746fca5cdc440e2b60caa4f51af165c2","abstract_canon_sha256":"2aef803e23a40a1fd609d10fd640731b6ae2a05a07faa993eb48214d4ef34cf6"},"schema_version":"1.0"},"canonical_sha256":"c13eccc321ac3bf762bc52a816ddef3593ca380ab6ed3c752529a3a80146e636","source":{"kind":"arxiv","id":"1102.1443","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1443","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1443v3","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1443","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"YE7MZQZBVQ57","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YE7MZQZBVQ57OYV4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YE7MZQZB","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YE7MZQZBVQ57OYV4KKUBNXPPGW","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1443","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-07T21:38:58Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"84b7e4a5ed0b182735077e0a0c93cd9c746fca5cdc440e2b60caa4f51af165c2","abstract_canon_sha256":"2aef803e23a40a1fd609d10fd640731b6ae2a05a07faa993eb48214d4ef34cf6"},"schema_version":"1.0"},"canonical_sha256":"c13eccc321ac3bf762bc52a816ddef3593ca380ab6ed3c752529a3a80146e636","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:39.913795Z","signature_b64":"irN7WisXDQYrIQIVtZh6MxWXNBFygcKUBzRYWxCcej12y/KSnRJ9hKqcSnZqSYozgH/I0OOF9yIeW/mYepKwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c13eccc321ac3bf762bc52a816ddef3593ca380ab6ed3c752529a3a80146e636","last_reissued_at":"2026-05-18T02:22:39.913243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:39.913243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1443","source_version":3,"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:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIRBDUQk0MCH1mrVz8pnemlbAhMMzYilvejhPySguq6h15zgyswmO4fQkk/wgsUXUsaeSH+XLdQKXiQ0OsCVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:21:19.875904Z"},"content_sha256":"cac09cf6c4af59bbefcabe2ccf094107917b3e1159378eb9bdfb4b6d18b7dff2","schema_version":"1.0","event_id":"sha256:cac09cf6c4af59bbefcabe2ccf094107917b3e1159378eb9bdfb4b6d18b7dff2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YE7MZQZBVQ57OYV4KKUBNXPPGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Communication Protocols that Compute Almost Privately","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CR","authors_text":"Bhaskar DasGupta, Marco Comi, Michael Schapira, Venkatakumar Srinivasan","submitted_at":"2011-02-07T21:38:58Z","abstract_excerpt":"A traditionally desired goal when designing auction mechanisms is incentive compatibility, i.e., ensuring that bidders fare best by truthfully reporting their preferences. A complementary goal, which has, thus far, received significantly less attention, is to preserve privacy, i.e., to ensure that bidders reveal no more information than necessary. We further investigate and generalize the approximate privacy model for two-party communication recently introduced by Feigenbaum et al.[8]. We explore the privacy properties of a natural class of communication protocols that we refer to as \"dissecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1443","kind":"arxiv","version":3},"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:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pS4Bmnl5fSzI67yPZfEM11ui8CmIaZDddhxgT9EowPEm4wVDDQu3ey+7DQCJ4T1+s0asd/Szkh8zANvEHNR2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:21:19.876253Z"},"content_sha256":"a032037cf78f6aa3872e90aa3f5c71f0bd99493b9ae217120f06242a44dfae91","schema_version":"1.0","event_id":"sha256:a032037cf78f6aa3872e90aa3f5c71f0bd99493b9ae217120f06242a44dfae91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YE7MZQZBVQ57OYV4KKUBNXPPGW/bundle.json","state_url":"https://pith.science/pith/YE7MZQZBVQ57OYV4KKUBNXPPGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YE7MZQZBVQ57OYV4KKUBNXPPGW/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-03T10:21:19Z","links":{"resolver":"https://pith.science/pith/YE7MZQZBVQ57OYV4KKUBNXPPGW","bundle":"https://pith.science/pith/YE7MZQZBVQ57OYV4KKUBNXPPGW/bundle.json","state":"https://pith.science/pith/YE7MZQZBVQ57OYV4KKUBNXPPGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YE7MZQZBVQ57OYV4KKUBNXPPGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YE7MZQZBVQ57OYV4KKUBNXPPGW","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":"2aef803e23a40a1fd609d10fd640731b6ae2a05a07faa993eb48214d4ef34cf6","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-07T21:38:58Z","title_canon_sha256":"84b7e4a5ed0b182735077e0a0c93cd9c746fca5cdc440e2b60caa4f51af165c2"},"schema_version":"1.0","source":{"id":"1102.1443","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1443","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1443v3","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1443","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"YE7MZQZBVQ57","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YE7MZQZBVQ57OYV4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YE7MZQZB","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:a032037cf78f6aa3872e90aa3f5c71f0bd99493b9ae217120f06242a44dfae91","target":"graph","created_at":"2026-05-18T02:22:39Z","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":"A traditionally desired goal when designing auction mechanisms is incentive compatibility, i.e., ensuring that bidders fare best by truthfully reporting their preferences. A complementary goal, which has, thus far, received significantly less attention, is to preserve privacy, i.e., to ensure that bidders reveal no more information than necessary. We further investigate and generalize the approximate privacy model for two-party communication recently introduced by Feigenbaum et al.[8]. We explore the privacy properties of a natural class of communication protocols that we refer to as \"dissecti","authors_text":"Bhaskar DasGupta, Marco Comi, Michael Schapira, Venkatakumar Srinivasan","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-07T21:38:58Z","title":"On Communication Protocols that Compute Almost Privately"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1443","kind":"arxiv","version":3},"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:cac09cf6c4af59bbefcabe2ccf094107917b3e1159378eb9bdfb4b6d18b7dff2","target":"record","created_at":"2026-05-18T02:22:39Z","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":"2aef803e23a40a1fd609d10fd640731b6ae2a05a07faa993eb48214d4ef34cf6","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-07T21:38:58Z","title_canon_sha256":"84b7e4a5ed0b182735077e0a0c93cd9c746fca5cdc440e2b60caa4f51af165c2"},"schema_version":"1.0","source":{"id":"1102.1443","kind":"arxiv","version":3}},"canonical_sha256":"c13eccc321ac3bf762bc52a816ddef3593ca380ab6ed3c752529a3a80146e636","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c13eccc321ac3bf762bc52a816ddef3593ca380ab6ed3c752529a3a80146e636","first_computed_at":"2026-05-18T02:22:39.913243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:39.913243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"irN7WisXDQYrIQIVtZh6MxWXNBFygcKUBzRYWxCcej12y/KSnRJ9hKqcSnZqSYozgH/I0OOF9yIeW/mYepKwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:39.913795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1443","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cac09cf6c4af59bbefcabe2ccf094107917b3e1159378eb9bdfb4b6d18b7dff2","sha256:a032037cf78f6aa3872e90aa3f5c71f0bd99493b9ae217120f06242a44dfae91"],"state_sha256":"2bc9701f6fa190afc7e42e418b87e526d5f2ea996be342cde8d93a22ef64bfa4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hg5KBD0AhCJER1rRV2D16FicyU/731ptA1fZNWqgPH+UMjCsW61NK1exJu2faJaj2C3SEMfVNkWqLgQ+W541AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:21:19.878178Z","bundle_sha256":"6a8f706d54556c1479796d362434f2805d1409601a756065bd3f6d604be7baa0"}}