{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3PNTEYJVHHS3DRNZTIPTYS76NY","short_pith_number":"pith:3PNTEYJV","canonical_record":{"source":{"id":"1711.01528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T04:01:29Z","cross_cats_sorted":[],"title_canon_sha256":"d23cd0b92964b60e874ccfad7f9afc357e1f78a1ecfdc89fae613d152e595862","abstract_canon_sha256":"c4bce98c89043fb8750679c8d374d8925bc5af52cff0b1392c586cc3f33c323e"},"schema_version":"1.0"},"canonical_sha256":"dbdb32613539e5b1c5b99a1f3c4bfe6e12e37e0f94f124de82ee86ee7b5e0cbd","source":{"kind":"arxiv","id":"1711.01528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01528","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01528v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01528","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"3PNTEYJVHHS3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3PNTEYJVHHS3DRNZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3PNTEYJV","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3PNTEYJVHHS3DRNZTIPTYS76NY","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T04:01:29Z","cross_cats_sorted":[],"title_canon_sha256":"d23cd0b92964b60e874ccfad7f9afc357e1f78a1ecfdc89fae613d152e595862","abstract_canon_sha256":"c4bce98c89043fb8750679c8d374d8925bc5af52cff0b1392c586cc3f33c323e"},"schema_version":"1.0"},"canonical_sha256":"dbdb32613539e5b1c5b99a1f3c4bfe6e12e37e0f94f124de82ee86ee7b5e0cbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:17.539188Z","signature_b64":"1JxyhYd5hGcUjcXgUzsjncdwyWuVv6t0XG3Nj4v/YDw/iCkTWfGRnIeOmTXYbUPxoSwYt+8ggvH9OieAjeOMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbdb32613539e5b1c5b99a1f3c4bfe6e12e37e0f94f124de82ee86ee7b5e0cbd","last_reissued_at":"2026-05-18T00:31:17.538554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:17.538554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01528","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-18T00:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ZOCcWK7CKXnNw2/9r/Q6JrPaXpwSfvZhJZzC20AHE1UFVCjGJJbLy2EJ2ZliXR4H+T/L1ktUN3lc6HymuukDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:30:47.242121Z"},"content_sha256":"3b68bba141ce09918494a5d9920659a4f3b56d626b71ad9a03d7dc54f63bc438","schema_version":"1.0","event_id":"sha256:3b68bba141ce09918494a5d9920659a4f3b56d626b71ad9a03d7dc54f63bc438"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3PNTEYJVHHS3DRNZTIPTYS76NY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetric R\\'enyi Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Abram Magner, Michael Drmota, Wojciech Szpankowski","submitted_at":"2017-11-05T04:01:29Z","abstract_excerpt":"In 1960 R\\'enyi in his Michigan State University lectures asked for the number of random queries necessary to recover a hidden bijective labeling of $n$ distinct objects. In each query one selects a random subset of labels and asks, which objects have these labels? We consider here an asymmetric version of the problem in which in every query an object is chosen with probability $p > 1/2$ and we ignore \"inconclusive\" queries. We study the number of queries needed to recover the labeling in its entirety ($H_n$), before at least one element is recovered ($F_n$), and to recover a randomly chosen e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01528","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-18T00:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+9pnQyRFKPHutrglyqVaDMXWLQQ4k5ZUIqvGRP4hrBxMYEppYRWkSUqoBRG3VgVbLkO3uucW/x4QjsIH3x9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:30:47.242884Z"},"content_sha256":"fa344e3a2037529b927632437d651dd24163db2467a7413641fe4317d5189271","schema_version":"1.0","event_id":"sha256:fa344e3a2037529b927632437d651dd24163db2467a7413641fe4317d5189271"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PNTEYJVHHS3DRNZTIPTYS76NY/bundle.json","state_url":"https://pith.science/pith/3PNTEYJVHHS3DRNZTIPTYS76NY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PNTEYJVHHS3DRNZTIPTYS76NY/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-01T01:30:47Z","links":{"resolver":"https://pith.science/pith/3PNTEYJVHHS3DRNZTIPTYS76NY","bundle":"https://pith.science/pith/3PNTEYJVHHS3DRNZTIPTYS76NY/bundle.json","state":"https://pith.science/pith/3PNTEYJVHHS3DRNZTIPTYS76NY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PNTEYJVHHS3DRNZTIPTYS76NY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3PNTEYJVHHS3DRNZTIPTYS76NY","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":"c4bce98c89043fb8750679c8d374d8925bc5af52cff0b1392c586cc3f33c323e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T04:01:29Z","title_canon_sha256":"d23cd0b92964b60e874ccfad7f9afc357e1f78a1ecfdc89fae613d152e595862"},"schema_version":"1.0","source":{"id":"1711.01528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01528","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01528v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01528","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"3PNTEYJVHHS3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3PNTEYJVHHS3DRNZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3PNTEYJV","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:fa344e3a2037529b927632437d651dd24163db2467a7413641fe4317d5189271","target":"graph","created_at":"2026-05-18T00:31:17Z","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 1960 R\\'enyi in his Michigan State University lectures asked for the number of random queries necessary to recover a hidden bijective labeling of $n$ distinct objects. In each query one selects a random subset of labels and asks, which objects have these labels? We consider here an asymmetric version of the problem in which in every query an object is chosen with probability $p > 1/2$ and we ignore \"inconclusive\" queries. We study the number of queries needed to recover the labeling in its entirety ($H_n$), before at least one element is recovered ($F_n$), and to recover a randomly chosen e","authors_text":"Abram Magner, Michael Drmota, Wojciech Szpankowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T04:01:29Z","title":"Asymmetric R\\'enyi Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01528","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:3b68bba141ce09918494a5d9920659a4f3b56d626b71ad9a03d7dc54f63bc438","target":"record","created_at":"2026-05-18T00:31:17Z","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":"c4bce98c89043fb8750679c8d374d8925bc5af52cff0b1392c586cc3f33c323e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T04:01:29Z","title_canon_sha256":"d23cd0b92964b60e874ccfad7f9afc357e1f78a1ecfdc89fae613d152e595862"},"schema_version":"1.0","source":{"id":"1711.01528","kind":"arxiv","version":1}},"canonical_sha256":"dbdb32613539e5b1c5b99a1f3c4bfe6e12e37e0f94f124de82ee86ee7b5e0cbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbdb32613539e5b1c5b99a1f3c4bfe6e12e37e0f94f124de82ee86ee7b5e0cbd","first_computed_at":"2026-05-18T00:31:17.538554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:17.538554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1JxyhYd5hGcUjcXgUzsjncdwyWuVv6t0XG3Nj4v/YDw/iCkTWfGRnIeOmTXYbUPxoSwYt+8ggvH9OieAjeOMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:17.539188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b68bba141ce09918494a5d9920659a4f3b56d626b71ad9a03d7dc54f63bc438","sha256:fa344e3a2037529b927632437d651dd24163db2467a7413641fe4317d5189271"],"state_sha256":"be33b20f33168de33940fd1b9fee82e1ce014515b044280a18b402d70ab88d59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOQPkc2Req5IT2Sz/Nq7M6+DVycIPuP+FJ7lemOATL9c007Zgy128AcP1WOZDKiTA9ncajxaDwDqzSmDIVFvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:30:47.247359Z","bundle_sha256":"fcd7b3da169e827bf9a8324547a0284f45bbeb00b3802a5ee0512b2c0c9d4ee9"}}