{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U3ZTV3AIHCEQ42NUQACOATL7EF","short_pith_number":"pith:U3ZTV3AI","schema_version":"1.0","canonical_sha256":"a6f33aec0838890e69b48004e04d7f215a7bc934b85d93e3816b09ebda89ad4d","source":{"kind":"arxiv","id":"1512.07901","version":3},"attestation_state":"computed","paper":{"title":"Simple set cardinality estimation through random sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Enoch Peserico, Luca Pretto, Marco Bressan","submitted_at":"2015-12-24T20:42:10Z","abstract_excerpt":"We present a simple algorithm that estimates the cardinality $n$ of a set $V$ when allowed to sample elements of $V$ uniformly and independently at random. Our algorithm with probability $(1-\\delta)$ returns a $(1\\pm\\epsilon)-$approximation of $n$ drawing $O\\big(\\sqrt{n} \\cdot \\epsilon^{-1}\\sqrt{\\log(\\delta^{-1})}\\big)$ samples (for $\\epsilon^{-1}\\sqrt{\\log(\\delta^{-1})} = O(\\sqrt{n})$)."},"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":"1512.07901","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-24T20:42:10Z","cross_cats_sorted":[],"title_canon_sha256":"e60c07cd5141e74fda42b02cd86af1555053cb7d022235cd2b65f1a6a16731f4","abstract_canon_sha256":"029c7f0646138d20044db383d70adf1b8f52bb879de6d799681ac7396ffbee69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:41.800261Z","signature_b64":"0BElkAPIRUi354JUfpVdVsozsYFIV2Z8WRhqmsnlVOQnMPaK9grYpT/nt153b2GyIVF2lz5xNnjRvubdQ7G7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6f33aec0838890e69b48004e04d7f215a7bc934b85d93e3816b09ebda89ad4d","last_reissued_at":"2026-05-18T00:18:41.799727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:41.799727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple set cardinality estimation through random sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Enoch Peserico, Luca Pretto, Marco Bressan","submitted_at":"2015-12-24T20:42:10Z","abstract_excerpt":"We present a simple algorithm that estimates the cardinality $n$ of a set $V$ when allowed to sample elements of $V$ uniformly and independently at random. Our algorithm with probability $(1-\\delta)$ returns a $(1\\pm\\epsilon)-$approximation of $n$ drawing $O\\big(\\sqrt{n} \\cdot \\epsilon^{-1}\\sqrt{\\log(\\delta^{-1})}\\big)$ samples (for $\\epsilon^{-1}\\sqrt{\\log(\\delta^{-1})} = O(\\sqrt{n})$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07901","kind":"arxiv","version":3},"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":"1512.07901","created_at":"2026-05-18T00:18:41.799816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07901v3","created_at":"2026-05-18T00:18:41.799816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07901","created_at":"2026-05-18T00:18:41.799816+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3ZTV3AIHCEQ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3ZTV3AIHCEQ42NU","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3ZTV3AI","created_at":"2026-05-18T12:29:44.643036+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/U3ZTV3AIHCEQ42NUQACOATL7EF","json":"https://pith.science/pith/U3ZTV3AIHCEQ42NUQACOATL7EF.json","graph_json":"https://pith.science/api/pith-number/U3ZTV3AIHCEQ42NUQACOATL7EF/graph.json","events_json":"https://pith.science/api/pith-number/U3ZTV3AIHCEQ42NUQACOATL7EF/events.json","paper":"https://pith.science/paper/U3ZTV3AI"},"agent_actions":{"view_html":"https://pith.science/pith/U3ZTV3AIHCEQ42NUQACOATL7EF","download_json":"https://pith.science/pith/U3ZTV3AIHCEQ42NUQACOATL7EF.json","view_paper":"https://pith.science/paper/U3ZTV3AI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07901&json=true","fetch_graph":"https://pith.science/api/pith-number/U3ZTV3AIHCEQ42NUQACOATL7EF/graph.json","fetch_events":"https://pith.science/api/pith-number/U3ZTV3AIHCEQ42NUQACOATL7EF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3ZTV3AIHCEQ42NUQACOATL7EF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3ZTV3AIHCEQ42NUQACOATL7EF/action/storage_attestation","attest_author":"https://pith.science/pith/U3ZTV3AIHCEQ42NUQACOATL7EF/action/author_attestation","sign_citation":"https://pith.science/pith/U3ZTV3AIHCEQ42NUQACOATL7EF/action/citation_signature","submit_replication":"https://pith.science/pith/U3ZTV3AIHCEQ42NUQACOATL7EF/action/replication_record"}},"created_at":"2026-05-18T00:18:41.799816+00:00","updated_at":"2026-05-18T00:18:41.799816+00:00"}