{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UMD4CCSE4BRHDXTH2YX47HZ3X4","short_pith_number":"pith:UMD4CCSE","schema_version":"1.0","canonical_sha256":"a307c10a44e06271de67d62fcf9f3bbf3dcd9c5e08046b18bcf8098262e693ef","source":{"kind":"arxiv","id":"1404.5568","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.5568","created_at":"2026-05-18T02:53:30.902748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5568v1","created_at":"2026-05-18T02:53:30.902748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5568","created_at":"2026-05-18T02:53:30.902748+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMD4CCSE4BRH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMD4CCSE4BRHDXTH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMD4CCSE","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4","json":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4.json","graph_json":"https://pith.science/api/pith-number/UMD4CCSE4BRHDXTH2YX47HZ3X4/graph.json","events_json":"https://pith.science/api/pith-number/UMD4CCSE4BRHDXTH2YX47HZ3X4/events.json","paper":"https://pith.science/paper/UMD4CCSE"},"agent_actions":{"view_html":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4","download_json":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4.json","view_paper":"https://pith.science/paper/UMD4CCSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5568&json=true","fetch_graph":"https://pith.science/api/pith-number/UMD4CCSE4BRHDXTH2YX47HZ3X4/graph.json","fetch_events":"https://pith.science/api/pith-number/UMD4CCSE4BRHDXTH2YX47HZ3X4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/action/storage_attestation","attest_author":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/action/author_attestation","sign_citation":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/action/citation_signature","submit_replication":"https://pith.science/pith/UMD4CCSE4BRHDXTH2YX47HZ3X4/action/replication_record"}},"created_at":"2026-05-18T02:53:30.902748+00:00","updated_at":"2026-05-18T02:53:30.902748+00:00"}