{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5E2OQQ7AHXASTIEH4HH6AW37HQ","short_pith_number":"pith:5E2OQQ7A","canonical_record":{"source":{"id":"1605.01814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-06T04:10:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2d1d9e449e029404c0e5b448987a0f3d49cf7f2733b1f06a4139e026dd28e6ee","abstract_canon_sha256":"e3916903ab7c911ec201de77ced658eda74ef60b67d433f359da41580316b81d"},"schema_version":"1.0"},"canonical_sha256":"e934e843e03dc129a087e1cfe05b7f3c29c52447eafe59cfc638b5b0bd6414a8","source":{"kind":"arxiv","id":"1605.01814","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01814","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01814v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01814","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"5E2OQQ7AHXAS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5E2OQQ7AHXASTIEH","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5E2OQQ7A","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5E2OQQ7AHXASTIEH4HH6AW37HQ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-06T04:10:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2d1d9e449e029404c0e5b448987a0f3d49cf7f2733b1f06a4139e026dd28e6ee","abstract_canon_sha256":"e3916903ab7c911ec201de77ced658eda74ef60b67d433f359da41580316b81d"},"schema_version":"1.0"},"canonical_sha256":"e934e843e03dc129a087e1cfe05b7f3c29c52447eafe59cfc638b5b0bd6414a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:31.331083Z","signature_b64":"cAZC2iUXwN7B+E72+cMEtJa1JIQ3weTPrL7UiAk1LVZ5Cn4mJcnAtGLmItrjKJPt1WIOsUwzkRJCJrjLgbKnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e934e843e03dc129a087e1cfe05b7f3c29c52447eafe59cfc638b5b0bd6414a8","last_reissued_at":"2026-05-18T01:15:31.330537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:31.330537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01814","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-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yx26ayIe8DH64G+gv27kb+FNHb+O1dplCZqRQ97QknkrsCI2PYig+aTMgmaWrvlslh1+Myit5WjvRtXO1i61CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:36:03.965467Z"},"content_sha256":"608bdcbfa2d99713109837ea3db243750181ceda3e1ba1b3765aea8011f02f51","schema_version":"1.0","event_id":"sha256:608bdcbfa2d99713109837ea3db243750181ceda3e1ba1b3765aea8011f02f51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5E2OQQ7AHXASTIEH4HH6AW37HQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetric R\\'enyi Problem and PATRICIA Tries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.PR","authors_text":"Abram Magner, Michael Drmota, Wojciech Szpankowski","submitted_at":"2016-05-06T04:10:34Z","abstract_excerpt":"In 1960, R\\'enyi 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, what is the set of objects that 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 (the height), to recover at least one single element (the fillup level), and to recover a randomly chosen element (the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01814","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-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xyPy3KC+7E/N6VvHThDE0jbs0CiTVPd6mNMlUmCvnWCVvnCyvBQAJZ1Ep5OJKKd0vvwhgQUiJnrcE7K2Dv4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:36:03.966209Z"},"content_sha256":"6c05a4e1848ee1c41ce8f70cf256b4224c4c7230c47aa15367bfeecd847e804a","schema_version":"1.0","event_id":"sha256:6c05a4e1848ee1c41ce8f70cf256b4224c4c7230c47aa15367bfeecd847e804a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5E2OQQ7AHXASTIEH4HH6AW37HQ/bundle.json","state_url":"https://pith.science/pith/5E2OQQ7AHXASTIEH4HH6AW37HQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5E2OQQ7AHXASTIEH4HH6AW37HQ/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-31T16:36:03Z","links":{"resolver":"https://pith.science/pith/5E2OQQ7AHXASTIEH4HH6AW37HQ","bundle":"https://pith.science/pith/5E2OQQ7AHXASTIEH4HH6AW37HQ/bundle.json","state":"https://pith.science/pith/5E2OQQ7AHXASTIEH4HH6AW37HQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5E2OQQ7AHXASTIEH4HH6AW37HQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5E2OQQ7AHXASTIEH4HH6AW37HQ","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":"e3916903ab7c911ec201de77ced658eda74ef60b67d433f359da41580316b81d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-06T04:10:34Z","title_canon_sha256":"2d1d9e449e029404c0e5b448987a0f3d49cf7f2733b1f06a4139e026dd28e6ee"},"schema_version":"1.0","source":{"id":"1605.01814","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01814","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01814v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01814","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"5E2OQQ7AHXAS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5E2OQQ7AHXASTIEH","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5E2OQQ7A","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:6c05a4e1848ee1c41ce8f70cf256b4224c4c7230c47aa15367bfeecd847e804a","target":"graph","created_at":"2026-05-18T01:15:31Z","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 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, what is the set of objects that 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 (the height), to recover at least one single element (the fillup level), and to recover a randomly chosen element (the t","authors_text":"Abram Magner, Michael Drmota, Wojciech Szpankowski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-06T04:10:34Z","title":"Asymmetric R\\'enyi Problem and PATRICIA Tries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01814","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:608bdcbfa2d99713109837ea3db243750181ceda3e1ba1b3765aea8011f02f51","target":"record","created_at":"2026-05-18T01:15:31Z","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":"e3916903ab7c911ec201de77ced658eda74ef60b67d433f359da41580316b81d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-06T04:10:34Z","title_canon_sha256":"2d1d9e449e029404c0e5b448987a0f3d49cf7f2733b1f06a4139e026dd28e6ee"},"schema_version":"1.0","source":{"id":"1605.01814","kind":"arxiv","version":1}},"canonical_sha256":"e934e843e03dc129a087e1cfe05b7f3c29c52447eafe59cfc638b5b0bd6414a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e934e843e03dc129a087e1cfe05b7f3c29c52447eafe59cfc638b5b0bd6414a8","first_computed_at":"2026-05-18T01:15:31.330537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:31.330537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAZC2iUXwN7B+E72+cMEtJa1JIQ3weTPrL7UiAk1LVZ5Cn4mJcnAtGLmItrjKJPt1WIOsUwzkRJCJrjLgbKnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:31.331083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01814","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:608bdcbfa2d99713109837ea3db243750181ceda3e1ba1b3765aea8011f02f51","sha256:6c05a4e1848ee1c41ce8f70cf256b4224c4c7230c47aa15367bfeecd847e804a"],"state_sha256":"1fa3a6dc650899d901878061c5cc38e0bd170ab2625116b8957781109b15dd2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3haN3r8Q06seSIYDj4xqGt51bGaPXZSvO/Y25Z3kYCSxhuJNt9k4lxdj806jbsRu3oB+BtlOCBMoAXOSDB5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:36:03.969357Z","bundle_sha256":"b2d132a59bcc9b210f6c2704367393e6fb752b0feccf78298e22705c682417eb"}}