{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZVPUO35FLYJJVT4DCGZDX7QZO6","short_pith_number":"pith:ZVPUO35F","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"},"canonical_sha256":"cd5f476fa55e129acf8311b23bfe1977a25b35357004e1e98e44ff13f875b6b1","source":{"kind":"arxiv","id":"1805.07535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07535","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07535v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07535","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZVPUO35FLYJJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZVPUO35FLYJJVT4D","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZVPUO35F","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZVPUO35FLYJJVT4DCGZDX7QZO6","target":"record","payload":{"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"},"canonical_sha256":"cd5f476fa55e129acf8311b23bfe1977a25b35357004e1e98e44ff13f875b6b1","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"},"source_kind":"arxiv","source_id":"1805.07535","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-18T00:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wiz43mlS9pBOfPy2vc9LB8Wm+fGf6+LpYtYiOqG7oarm828B0cONUiG0OPNBZ5ulv3d5YzNyI/KE+UHSXqVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:50:16.543897Z"},"content_sha256":"66d8195d151732383f5cb76a95b1b646608c70a7684425ab283470a22c4b6f84","schema_version":"1.0","event_id":"sha256:66d8195d151732383f5cb76a95b1b646608c70a7684425ab283470a22c4b6f84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZVPUO35FLYJJVT4DCGZDX7QZO6","target":"graph","payload":{"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"},"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-18T00:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAWtE2U3NWL0tICW2SDUfCHtZN379kcocdVWhncK7SIwMuAm9JvVVN+cxydizHK1PsyRZcOcaO6KBoXz0gkdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:50:16.544238Z"},"content_sha256":"c0a3bdbda7533a56b448520bd715fd60523d2bd66c0e18bf32c16a33d6194c54","schema_version":"1.0","event_id":"sha256:c0a3bdbda7533a56b448520bd715fd60523d2bd66c0e18bf32c16a33d6194c54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/bundle.json","state_url":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/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-03T06:50:16Z","links":{"resolver":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6","bundle":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/bundle.json","state":"https://pith.science/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVPUO35FLYJJVT4DCGZDX7QZO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZVPUO35FLYJJVT4DCGZDX7QZO6","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":"dcdda30bdaaad92dadd5f2cbafec8756b31ef396db1e0c93268665fce5c0c582","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-19T07:38:18Z","title_canon_sha256":"cc6dc80e79fd08d04930b01182aa8bbf97e9a323c0daf2277122fa92b16ad1e8"},"schema_version":"1.0","source":{"id":"1805.07535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07535","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07535v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07535","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZVPUO35FLYJJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZVPUO35FLYJJVT4D","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZVPUO35F","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:c0a3bdbda7533a56b448520bd715fd60523d2bd66c0e18bf32c16a33d6194c54","target":"graph","created_at":"2026-05-18T00:15:33Z","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 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.","authors_text":"Dror Fried, Gera Weiss, Liat Cohen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-19T07:38:18Z","title":"An optimal approximation of discrete random variables with respect to the Kolmogorov distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07535","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:66d8195d151732383f5cb76a95b1b646608c70a7684425ab283470a22c4b6f84","target":"record","created_at":"2026-05-18T00:15:33Z","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":"dcdda30bdaaad92dadd5f2cbafec8756b31ef396db1e0c93268665fce5c0c582","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-19T07:38:18Z","title_canon_sha256":"cc6dc80e79fd08d04930b01182aa8bbf97e9a323c0daf2277122fa92b16ad1e8"},"schema_version":"1.0","source":{"id":"1805.07535","kind":"arxiv","version":1}},"canonical_sha256":"cd5f476fa55e129acf8311b23bfe1977a25b35357004e1e98e44ff13f875b6b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd5f476fa55e129acf8311b23bfe1977a25b35357004e1e98e44ff13f875b6b1","first_computed_at":"2026-05-18T00:15:33.346125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:33.346125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FeiKANR8zTr0xSqsCCiXzpG6ffEDRGsJepcopsRlXAjhFUQmG79zfd7TaRfkK1yzYiS+5JrXvb6c2kYf2R+BAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:33.346672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66d8195d151732383f5cb76a95b1b646608c70a7684425ab283470a22c4b6f84","sha256:c0a3bdbda7533a56b448520bd715fd60523d2bd66c0e18bf32c16a33d6194c54"],"state_sha256":"b7fcc2c7a98e66e40e7b6ae4a82849491239145795501896b40d332d005e30a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lK/U853mfayVEI3ZBcJ1kBhBX6Xpe3c1Ea3iItTT4f6B2R0lDEmifaoGZDH5JuCSaD5R9c4RJ+zMFoRNBY3vAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:50:16.546181Z","bundle_sha256":"27769ed2b8fb8ad64a0f6b7759a097ac88d29ebfb77e7f03d5ee67643d384256"}}