{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MFVZGZU4M2INH5LAEIYOGQXURY","short_pith_number":"pith:MFVZGZU4","canonical_record":{"source":{"id":"1905.11067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-05-27T09:17:04Z","cross_cats_sorted":["cs.CR","cs.LG","stat.TH"],"title_canon_sha256":"54c1d1c2e6ba14bc5e257907a0f868c734e1225872d347e05725d6db7b332bd7","abstract_canon_sha256":"cc805ca82c54b835268f399c96a6811ab7b0cb553ac18e5f935a7aeddc7c6d81"},"schema_version":"1.0"},"canonical_sha256":"616b93669c6690d3f5602230e342f48e209ad8009aa56ce77a717b407c06f5a6","source":{"kind":"arxiv","id":"1905.11067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11067","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11067v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11067","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"MFVZGZU4M2IN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MFVZGZU4M2INH5LA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MFVZGZU4","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MFVZGZU4M2INH5LAEIYOGQXURY","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-05-27T09:17:04Z","cross_cats_sorted":["cs.CR","cs.LG","stat.TH"],"title_canon_sha256":"54c1d1c2e6ba14bc5e257907a0f868c734e1225872d347e05725d6db7b332bd7","abstract_canon_sha256":"cc805ca82c54b835268f399c96a6811ab7b0cb553ac18e5f935a7aeddc7c6d81"},"schema_version":"1.0"},"canonical_sha256":"616b93669c6690d3f5602230e342f48e209ad8009aa56ce77a717b407c06f5a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.010197Z","signature_b64":"8EW6/kHE7fjqSJoR7NTHZ7bDewyPq2q84/cgEjsMJWD2mISatLRDmfeoEcBB79WhRtZ7Ua1evfK654yUt7zPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"616b93669c6690d3f5602230e342f48e209ad8009aa56ce77a717b407c06f5a6","last_reissued_at":"2026-05-17T23:45:03.009558Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.009558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11067","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-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NW7r4rJLZROdrtqUPhPq6fBd/rtUWLtT5Qg79o8zJItek7WfLpPuOvdal3i7/AsPMcwjjyQQ9XYwiS1NG1dDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:50:46.978168Z"},"content_sha256":"02392e0bfd5d15fc244d48068b8d696f603752bca267edea200fb0b93c713c6a","schema_version":"1.0","event_id":"sha256:02392e0bfd5d15fc244d48068b8d696f603752bca267edea200fb0b93c713c6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MFVZGZU4M2INH5LAEIYOGQXURY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locally Differentially Private Minimum Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG","stat.TH"],"primary_cat":"math.ST","authors_text":"Arashi Haishima, Chia-Mu Yu, Jun Sakuma, Kazuto Fukuchi","submitted_at":"2019-05-27T09:17:04Z","abstract_excerpt":"We investigate a problem of finding the minimum, in which each user has a real value and we want to estimate the minimum of these values under the local differential privacy constraint. We reveal that this problem is fundamentally difficult, and we cannot construct a mechanism that is consistent in the worst case. Instead of considering the worst case, we aim to construct a private mechanism whose error rate is adaptive to the easiness of estimation of the minimum. As a measure of easiness, we introduce a parameter $\\alpha$ that characterizes the fatness of the minimum-side tail of the user da"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11067","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-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPaH72wnpt3oJKrEpirghH+n8OWyYia/5lXNpAEFIeIycojTvY42AQ/q55w/nCVXwTYb4clQNfwmRfgsVLHvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:50:46.978828Z"},"content_sha256":"7f95a44c900849071b9b087783e61b3484476a72901a8bcac889472f35095971","schema_version":"1.0","event_id":"sha256:7f95a44c900849071b9b087783e61b3484476a72901a8bcac889472f35095971"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFVZGZU4M2INH5LAEIYOGQXURY/bundle.json","state_url":"https://pith.science/pith/MFVZGZU4M2INH5LAEIYOGQXURY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFVZGZU4M2INH5LAEIYOGQXURY/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-30T11:50:46Z","links":{"resolver":"https://pith.science/pith/MFVZGZU4M2INH5LAEIYOGQXURY","bundle":"https://pith.science/pith/MFVZGZU4M2INH5LAEIYOGQXURY/bundle.json","state":"https://pith.science/pith/MFVZGZU4M2INH5LAEIYOGQXURY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFVZGZU4M2INH5LAEIYOGQXURY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MFVZGZU4M2INH5LAEIYOGQXURY","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":"cc805ca82c54b835268f399c96a6811ab7b0cb553ac18e5f935a7aeddc7c6d81","cross_cats_sorted":["cs.CR","cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-05-27T09:17:04Z","title_canon_sha256":"54c1d1c2e6ba14bc5e257907a0f868c734e1225872d347e05725d6db7b332bd7"},"schema_version":"1.0","source":{"id":"1905.11067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11067","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11067v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11067","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"MFVZGZU4M2IN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MFVZGZU4M2INH5LA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MFVZGZU4","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:7f95a44c900849071b9b087783e61b3484476a72901a8bcac889472f35095971","target":"graph","created_at":"2026-05-17T23:45:03Z","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 investigate a problem of finding the minimum, in which each user has a real value and we want to estimate the minimum of these values under the local differential privacy constraint. We reveal that this problem is fundamentally difficult, and we cannot construct a mechanism that is consistent in the worst case. Instead of considering the worst case, we aim to construct a private mechanism whose error rate is adaptive to the easiness of estimation of the minimum. As a measure of easiness, we introduce a parameter $\\alpha$ that characterizes the fatness of the minimum-side tail of the user da","authors_text":"Arashi Haishima, Chia-Mu Yu, Jun Sakuma, Kazuto Fukuchi","cross_cats":["cs.CR","cs.LG","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-05-27T09:17:04Z","title":"Locally Differentially Private Minimum Finding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11067","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:02392e0bfd5d15fc244d48068b8d696f603752bca267edea200fb0b93c713c6a","target":"record","created_at":"2026-05-17T23:45:03Z","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":"cc805ca82c54b835268f399c96a6811ab7b0cb553ac18e5f935a7aeddc7c6d81","cross_cats_sorted":["cs.CR","cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-05-27T09:17:04Z","title_canon_sha256":"54c1d1c2e6ba14bc5e257907a0f868c734e1225872d347e05725d6db7b332bd7"},"schema_version":"1.0","source":{"id":"1905.11067","kind":"arxiv","version":1}},"canonical_sha256":"616b93669c6690d3f5602230e342f48e209ad8009aa56ce77a717b407c06f5a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"616b93669c6690d3f5602230e342f48e209ad8009aa56ce77a717b407c06f5a6","first_computed_at":"2026-05-17T23:45:03.009558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.009558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8EW6/kHE7fjqSJoR7NTHZ7bDewyPq2q84/cgEjsMJWD2mISatLRDmfeoEcBB79WhRtZ7Ua1evfK654yUt7zPBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.010197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02392e0bfd5d15fc244d48068b8d696f603752bca267edea200fb0b93c713c6a","sha256:7f95a44c900849071b9b087783e61b3484476a72901a8bcac889472f35095971"],"state_sha256":"cf291b41c50d18e85c8ef207e66271a6b0f1e655077f519ade302b7052d1a8dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fGx2pmupgx7SUVlXwmDx8vLJW5XE76+de8vuv3rTt4TvSU21nwHHMsvP/cmEICU06gsQ7GSCMBnNfiRpPY8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:50:46.982352Z","bundle_sha256":"d304f88c8935524abb0d4f12338ee48a4e62c6585118cf5744ecc0d8a32ee750"}}