{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D3PRXBSCALY7EVZ3KXGXRD34RA","short_pith_number":"pith:D3PRXBSC","canonical_record":{"source":{"id":"1611.10133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T13:09:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2c8e24708f50c38529d3880d54b6c5af3dad0060437749e6cc6bf4736b4f0676","abstract_canon_sha256":"a7b0601a560840123c90d35b361ddbd14850dae7cef1bae235e44ec13118196b"},"schema_version":"1.0"},"canonical_sha256":"1edf1b864202f1f2573b55cd788f7c883228a9716b23eb909973a52455c68f8c","source":{"kind":"arxiv","id":"1611.10133","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10133","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10133v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10133","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"D3PRXBSCALY7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3PRXBSCALY7EVZ3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3PRXBSC","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D3PRXBSCALY7EVZ3KXGXRD34RA","target":"record","payload":{"canonical_record":{"source":{"id":"1611.10133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T13:09:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2c8e24708f50c38529d3880d54b6c5af3dad0060437749e6cc6bf4736b4f0676","abstract_canon_sha256":"a7b0601a560840123c90d35b361ddbd14850dae7cef1bae235e44ec13118196b"},"schema_version":"1.0"},"canonical_sha256":"1edf1b864202f1f2573b55cd788f7c883228a9716b23eb909973a52455c68f8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:05.042169Z","signature_b64":"ARVo8JSbw2V8VG3r/pL6j+9RB9ZWpYG15T2U+lNc+XRSM2flpG1KtQTpBBIN+MCRcWR9p0uwIGqtvN+1J2LgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1edf1b864202f1f2573b55cd788f7c883228a9716b23eb909973a52455c68f8c","last_reissued_at":"2026-05-18T00:56:05.041592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:05.041592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.10133","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:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xt75oRLkGDVPEkfFCzKMV2JgSk2W9HBxig7L0NsAadQpI6IrdgTPz1sDFpd0D2hoTTgAR4qzvqqiPZXeKzGXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:12:50.069452Z"},"content_sha256":"b568131b998f87c02a19bc531c090af714bd7eab4d2960da6ff34584499b9033","schema_version":"1.0","event_id":"sha256:b568131b998f87c02a19bc531c090af714bd7eab4d2960da6ff34584499b9033"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D3PRXBSCALY7EVZ3KXGXRD34RA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rounds in a combinatorial search problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"D\\'aniel Gerbner, M\\'at\\'e Vizer","submitted_at":"2016-11-30T13:09:41Z","abstract_excerpt":"We consider the following combinatorial search problem: we are given some excellent elements of $[n]$ and we should find at least one, asking questions of the following type: \"Is there an excellent element in $A \\subset [n]$?\". G.O.H. Katona proved sharp results for the number of questions needed to ask in the adaptive, non-adaptive and two-round versions of this problem.\n  We verify a conjecture of Katona by proving that in the $r$-round version we need to ask $rn^{1/r}+O(1)$ queries for fixed $r$ and this is sharp.\n  We also prove bounds for the queries needed to ask if we want to find at le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10133","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:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4tQDlErSGw0DDhmYVLnQ0ctE26dMRjgWFOXedGY7Tunv0gak3ywvXr53U1VAndGef6iIaTOxy62pin0SYLICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:12:50.069803Z"},"content_sha256":"77fde8b340b5182fb9c4b08862fe07e0f13bd24f6848064a5859a3aae36251ae","schema_version":"1.0","event_id":"sha256:77fde8b340b5182fb9c4b08862fe07e0f13bd24f6848064a5859a3aae36251ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3PRXBSCALY7EVZ3KXGXRD34RA/bundle.json","state_url":"https://pith.science/pith/D3PRXBSCALY7EVZ3KXGXRD34RA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3PRXBSCALY7EVZ3KXGXRD34RA/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-30T06:12:50Z","links":{"resolver":"https://pith.science/pith/D3PRXBSCALY7EVZ3KXGXRD34RA","bundle":"https://pith.science/pith/D3PRXBSCALY7EVZ3KXGXRD34RA/bundle.json","state":"https://pith.science/pith/D3PRXBSCALY7EVZ3KXGXRD34RA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3PRXBSCALY7EVZ3KXGXRD34RA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D3PRXBSCALY7EVZ3KXGXRD34RA","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":"a7b0601a560840123c90d35b361ddbd14850dae7cef1bae235e44ec13118196b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T13:09:41Z","title_canon_sha256":"2c8e24708f50c38529d3880d54b6c5af3dad0060437749e6cc6bf4736b4f0676"},"schema_version":"1.0","source":{"id":"1611.10133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10133","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10133v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10133","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"D3PRXBSCALY7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3PRXBSCALY7EVZ3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3PRXBSC","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:77fde8b340b5182fb9c4b08862fe07e0f13bd24f6848064a5859a3aae36251ae","target":"graph","created_at":"2026-05-18T00:56:05Z","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 the following combinatorial search problem: we are given some excellent elements of $[n]$ and we should find at least one, asking questions of the following type: \"Is there an excellent element in $A \\subset [n]$?\". G.O.H. Katona proved sharp results for the number of questions needed to ask in the adaptive, non-adaptive and two-round versions of this problem.\n  We verify a conjecture of Katona by proving that in the $r$-round version we need to ask $rn^{1/r}+O(1)$ queries for fixed $r$ and this is sharp.\n  We also prove bounds for the queries needed to ask if we want to find at le","authors_text":"D\\'aniel Gerbner, M\\'at\\'e Vizer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T13:09:41Z","title":"Rounds in a combinatorial search problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10133","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:b568131b998f87c02a19bc531c090af714bd7eab4d2960da6ff34584499b9033","target":"record","created_at":"2026-05-18T00:56:05Z","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":"a7b0601a560840123c90d35b361ddbd14850dae7cef1bae235e44ec13118196b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T13:09:41Z","title_canon_sha256":"2c8e24708f50c38529d3880d54b6c5af3dad0060437749e6cc6bf4736b4f0676"},"schema_version":"1.0","source":{"id":"1611.10133","kind":"arxiv","version":1}},"canonical_sha256":"1edf1b864202f1f2573b55cd788f7c883228a9716b23eb909973a52455c68f8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1edf1b864202f1f2573b55cd788f7c883228a9716b23eb909973a52455c68f8c","first_computed_at":"2026-05-18T00:56:05.041592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:05.041592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ARVo8JSbw2V8VG3r/pL6j+9RB9ZWpYG15T2U+lNc+XRSM2flpG1KtQTpBBIN+MCRcWR9p0uwIGqtvN+1J2LgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:05.042169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b568131b998f87c02a19bc531c090af714bd7eab4d2960da6ff34584499b9033","sha256:77fde8b340b5182fb9c4b08862fe07e0f13bd24f6848064a5859a3aae36251ae"],"state_sha256":"64ca17676e799f2bb7f027facbb54e302f136dd98ef14af5c36bf6ff822706c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kixHR9XPBwjfSXtZrVp7sJKf4BFLt0y5rgoObd5Sujde4wWErRIKhLONdIi8gP4o31usqoCiCyRO7QQBRN90Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:12:50.071828Z","bundle_sha256":"ad4e60e4bea0e9c220fb87b9b494e72060081c31c8d8a111b74f6451435ad884"}}