{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZCYIW4IZ27MW4TS64EUDBXWNAG","short_pith_number":"pith:ZCYIW4IZ","schema_version":"1.0","canonical_sha256":"c8b08b7119d7d96e4e5ee12830decd0196fc52a55f1f305a294890add9881d11","source":{"kind":"arxiv","id":"1711.07545","version":1},"attestation_state":"computed","paper":{"title":"On estimating the alphabet size of a discrete random source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Philip Ginzboorg","submitted_at":"2017-11-20T21:10:15Z","abstract_excerpt":"We are concerned with estimating alphabet size $N$ from a stream of symbols taken uniformly at random from that alphabet. We define and analyze a memory-restricted variant of an algorithm that have been earlier proposed for this purpose. The alphabet size $N$ can be estimated in $O(\\sqrt{N})$ time and space by the memory-restricted variant of this algorithm."},"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":"1711.07545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-20T21:10:15Z","cross_cats_sorted":[],"title_canon_sha256":"2707150a7ddd4781400a66778a33ce625de8a1df8a885c7dcb356c1dcbd7db66","abstract_canon_sha256":"82e934be21660a14ec4e2e055a2d579258a87767a267f2a2bb6711fa94d2a84a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:58.738576Z","signature_b64":"3daZJzkZKCVXHxCuOwNDLxjKRmSVY/AM0FTN/SokTbVjc79yq92Y5nErikv9aH9UAxT/TTNtpMq97BN4OZX0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b08b7119d7d96e4e5ee12830decd0196fc52a55f1f305a294890add9881d11","last_reissued_at":"2026-05-18T00:29:58.737952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:58.737952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On estimating the alphabet size of a discrete random source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Philip Ginzboorg","submitted_at":"2017-11-20T21:10:15Z","abstract_excerpt":"We are concerned with estimating alphabet size $N$ from a stream of symbols taken uniformly at random from that alphabet. We define and analyze a memory-restricted variant of an algorithm that have been earlier proposed for this purpose. The alphabet size $N$ can be estimated in $O(\\sqrt{N})$ time and space by the memory-restricted variant of this algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07545","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":"1711.07545","created_at":"2026-05-18T00:29:58.738062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07545v1","created_at":"2026-05-18T00:29:58.738062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07545","created_at":"2026-05-18T00:29:58.738062+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCYIW4IZ27MW","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCYIW4IZ27MW4TS6","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCYIW4IZ","created_at":"2026-05-18T12:31:59.375834+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/ZCYIW4IZ27MW4TS64EUDBXWNAG","json":"https://pith.science/pith/ZCYIW4IZ27MW4TS64EUDBXWNAG.json","graph_json":"https://pith.science/api/pith-number/ZCYIW4IZ27MW4TS64EUDBXWNAG/graph.json","events_json":"https://pith.science/api/pith-number/ZCYIW4IZ27MW4TS64EUDBXWNAG/events.json","paper":"https://pith.science/paper/ZCYIW4IZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZCYIW4IZ27MW4TS64EUDBXWNAG","download_json":"https://pith.science/pith/ZCYIW4IZ27MW4TS64EUDBXWNAG.json","view_paper":"https://pith.science/paper/ZCYIW4IZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07545&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCYIW4IZ27MW4TS64EUDBXWNAG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCYIW4IZ27MW4TS64EUDBXWNAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCYIW4IZ27MW4TS64EUDBXWNAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCYIW4IZ27MW4TS64EUDBXWNAG/action/storage_attestation","attest_author":"https://pith.science/pith/ZCYIW4IZ27MW4TS64EUDBXWNAG/action/author_attestation","sign_citation":"https://pith.science/pith/ZCYIW4IZ27MW4TS64EUDBXWNAG/action/citation_signature","submit_replication":"https://pith.science/pith/ZCYIW4IZ27MW4TS64EUDBXWNAG/action/replication_record"}},"created_at":"2026-05-18T00:29:58.738062+00:00","updated_at":"2026-05-18T00:29:58.738062+00:00"}