{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UMD4CCSE4BRHDXTH2YX47HZ3X4","short_pith_number":"pith:UMD4CCSE","canonical_record":{"source":{"id":"1404.5568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-20T07:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"c627fd4712ec42f4ab47acbeb62c40b9a4ce01bead3e12c04de07dccaf42f8b0","abstract_canon_sha256":"79ec1d967aed3664cdb88e51e0ba0ac4267f23289b8da84021b3bf7124299ef9"},"schema_version":"1.0"},"canonical_sha256":"a307c10a44e06271de67d62fcf9f3bbf3dcd9c5e08046b18bcf8098262e693ef","source":{"kind":"arxiv","id":"1404.5568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5568","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5568v1","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5568","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"UMD4CCSE4BRH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UMD4CCSE4BRHDXTH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UMD4CCSE","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UMD4CCSE4BRHDXTH2YX47HZ3X4","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-20T07:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"c627fd4712ec42f4ab47acbeb62c40b9a4ce01bead3e12c04de07dccaf42f8b0","abstract_canon_sha256":"79ec1d967aed3664cdb88e51e0ba0ac4267f23289b8da84021b3bf7124299ef9"},"schema_version":"1.0"},"canonical_sha256":"a307c10a44e06271de67d62fcf9f3bbf3dcd9c5e08046b18bcf8098262e693ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:30.903359Z","signature_b64":"XXrUCWe19U48uPKuzCnqsDRXpfCP6PJxq9Cjpa2BxJNWBoNKqQzXfuzCf/IErl71JBQzNuwLfoWwLbIPzFu0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a307c10a44e06271de67d62fcf9f3bbf3dcd9c5e08046b18bcf8098262e693ef","last_reissued_at":"2026-05-18T02:53:30.902625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:30.902625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5568","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-18T02:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5FP4HamDa0K3VkjmdUPv3km0Ltq9JbNXilnUFgGvxkWTQXnOkx8MSlWFj4T1w/FJHLhjAb7QoEh2y6/Q7uuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:49:13.443275Z"},"content_sha256":"a9fc1e9969f416378f86e16d5ae8633e619947847db685a340c496b030fb787b","schema_version":"1.0","event_id":"sha256:a9fc1e9969f416378f86e16d5ae8633e619947847db685a340c496b030fb787b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UMD4CCSE4BRHDXTH2YX47HZ3X4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dana Ron, Gilad Tsur","submitted_at":"2014-04-20T07:20:02Z","abstract_excerpt":"We study a basic problem of approximating the size of an unknown set $S$ in a known universe $U$. We consider two versions of the problem. In both versions the algorithm can specify subsets $T\\subseteq U$. In the first version, which we refer to as the group query or subset query version, the algorithm is told whether $T\\cap S$ is non-empty. In the second version, which we refer to as the subset sampling version, if $T\\cap S$ is non-empty, then the algorithm receives a uniformly selected element from $T\\cap S$. We study the difference between these two versions under different conditions on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5568","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-18T02:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuRfOq76Dwf6uZlgBcXaD66smvFoydlBBhsg/qEwEyKWgWWB8fVjsE+CKkzNwKxS5D5aYnFLV2EaJ7/zX36kAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:49:13.443661Z"},"content_sha256":"0c2b4ce08c69bb8aa85352a17323cd910b48e80715eee9ce73b746a990492591","schema_version":"1.0","event_id":"sha256:0c2b4ce08c69bb8aa85352a17323cd910b48e80715eee9ce73b746a990492591"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/bundle.json","state_url":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/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-01T07:49:13Z","links":{"resolver":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4","bundle":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/bundle.json","state":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UMD4CCSE4BRHDXTH2YX47HZ3X4","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":"79ec1d967aed3664cdb88e51e0ba0ac4267f23289b8da84021b3bf7124299ef9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-20T07:20:02Z","title_canon_sha256":"c627fd4712ec42f4ab47acbeb62c40b9a4ce01bead3e12c04de07dccaf42f8b0"},"schema_version":"1.0","source":{"id":"1404.5568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5568","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5568v1","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5568","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"UMD4CCSE4BRH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UMD4CCSE4BRHDXTH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UMD4CCSE","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:0c2b4ce08c69bb8aa85352a17323cd910b48e80715eee9ce73b746a990492591","target":"graph","created_at":"2026-05-18T02:53:30Z","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 study a basic problem of approximating the size of an unknown set $S$ in a known universe $U$. We consider two versions of the problem. In both versions the algorithm can specify subsets $T\\subseteq U$. In the first version, which we refer to as the group query or subset query version, the algorithm is told whether $T\\cap S$ is non-empty. In the second version, which we refer to as the subset sampling version, if $T\\cap S$ is non-empty, then the algorithm receives a uniformly selected element from $T\\cap S$. We study the difference between these two versions under different conditions on th","authors_text":"Dana Ron, Gilad Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-20T07:20:02Z","title":"The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5568","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:a9fc1e9969f416378f86e16d5ae8633e619947847db685a340c496b030fb787b","target":"record","created_at":"2026-05-18T02:53:30Z","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":"79ec1d967aed3664cdb88e51e0ba0ac4267f23289b8da84021b3bf7124299ef9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-20T07:20:02Z","title_canon_sha256":"c627fd4712ec42f4ab47acbeb62c40b9a4ce01bead3e12c04de07dccaf42f8b0"},"schema_version":"1.0","source":{"id":"1404.5568","kind":"arxiv","version":1}},"canonical_sha256":"a307c10a44e06271de67d62fcf9f3bbf3dcd9c5e08046b18bcf8098262e693ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a307c10a44e06271de67d62fcf9f3bbf3dcd9c5e08046b18bcf8098262e693ef","first_computed_at":"2026-05-18T02:53:30.902625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:30.902625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XXrUCWe19U48uPKuzCnqsDRXpfCP6PJxq9Cjpa2BxJNWBoNKqQzXfuzCf/IErl71JBQzNuwLfoWwLbIPzFu0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:30.903359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9fc1e9969f416378f86e16d5ae8633e619947847db685a340c496b030fb787b","sha256:0c2b4ce08c69bb8aa85352a17323cd910b48e80715eee9ce73b746a990492591"],"state_sha256":"04f1539d8fe0152d3bcb13cdf1e50ec61a4492bf8f3d4df0defe234dbb4623a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrT7Mm9jZ4mPeKcdVSCNJk2eTchH9can4dkJY4TUxh2iewOP/YpWeDd8v6vSzoUml0D/L2dlvhw1DYVB17f4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:49:13.445785Z","bundle_sha256":"8cbefbf1d640567ca03ce7bbaa1762ef593485c957553246ea7d51afe51c02e4"}}