{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZVPUO35FLYJJVT4DCGZDX7QZO6","short_pith_number":"pith:ZVPUO35F","schema_version":"1.0","canonical_sha256":"cd5f476fa55e129acf8311b23bfe1977a25b35357004e1e98e44ff13f875b6b1","source":{"kind":"arxiv","id":"1805.07535","version":1},"attestation_state":"computed","paper":{"title":"An optimal approximation of discrete random variables with respect to the Kolmogorov distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Dror Fried, Gera Weiss, Liat Cohen","submitted_at":"2018-05-19T07:38:18Z","abstract_excerpt":"We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal. In addition to a formal theoretical analysis of the correctness and of the computational complexity of the algorithm, we present a detailed empirical evaluation that shows how the proposed approach performs in practice in different applications and domains."},"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":"1805.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-19T07:38:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cc6dc80e79fd08d04930b01182aa8bbf97e9a323c0daf2277122fa92b16ad1e8","abstract_canon_sha256":"dcdda30bdaaad92dadd5f2cbafec8756b31ef396db1e0c93268665fce5c0c582"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:33.346672Z","signature_b64":"FeiKANR8zTr0xSqsCCiXzpG6ffEDRGsJepcopsRlXAjhFUQmG79zfd7TaRfkK1yzYiS+5JrXvb6c2kYf2R+BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd5f476fa55e129acf8311b23bfe1977a25b35357004e1e98e44ff13f875b6b1","last_reissued_at":"2026-05-18T00:15:33.346125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:33.346125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal approximation of discrete random variables with respect to the Kolmogorov distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Dror Fried, Gera Weiss, Liat Cohen","submitted_at":"2018-05-19T07:38:18Z","abstract_excerpt":"We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal. In addition to a formal theoretical analysis of the correctness and of the computational complexity of the algorithm, we present a detailed empirical evaluation that shows how the proposed approach performs in practice in different applications and domains."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07535","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":"1805.07535","created_at":"2026-05-18T00:15:33.346206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07535v1","created_at":"2026-05-18T00:15:33.346206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07535","created_at":"2026-05-18T00:15:33.346206+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVPUO35FLYJJ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVPUO35FLYJJVT4D","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVPUO35F","created_at":"2026-05-18T12:33:07.085635+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/ZVPUO35FLYJJVT4DCGZDX7QZO6","json":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6.json","graph_json":"https://pith.science/api/pith-number/ZVPUO35FLYJJVT4DCGZDX7QZO6/graph.json","events_json":"https://pith.science/api/pith-number/ZVPUO35FLYJJVT4DCGZDX7QZO6/events.json","paper":"https://pith.science/paper/ZVPUO35F"},"agent_actions":{"view_html":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6","download_json":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6.json","view_paper":"https://pith.science/paper/ZVPUO35F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07535&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVPUO35FLYJJVT4DCGZDX7QZO6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVPUO35FLYJJVT4DCGZDX7QZO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/action/storage_attestation","attest_author":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/action/author_attestation","sign_citation":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/action/citation_signature","submit_replication":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/action/replication_record"}},"created_at":"2026-05-18T00:15:33.346206+00:00","updated_at":"2026-05-18T00:15:33.346206+00:00"}