{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TN56IJTT74YG724OSODUDDGDQV","short_pith_number":"pith:TN56IJTT","canonical_record":{"source":{"id":"1802.08513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-23T13:07:32Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"d71c55937ecf7d7cc528a15eab43684df910196f0e4a11f98cecddda453c5ff9","abstract_canon_sha256":"8afbc8229e37a07d80c8e73d9a4784014be06f5608d7efdb23d837a5037be423"},"schema_version":"1.0"},"canonical_sha256":"9b7be42673ff306feb8e9387418cc3856fe5e0039afe9daba515a02f6299278d","source":{"kind":"arxiv","id":"1802.08513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08513","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08513v1","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08513","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"TN56IJTT74YG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TN56IJTT74YG724O","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TN56IJTT","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TN56IJTT74YG724OSODUDDGDQV","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-23T13:07:32Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"d71c55937ecf7d7cc528a15eab43684df910196f0e4a11f98cecddda453c5ff9","abstract_canon_sha256":"8afbc8229e37a07d80c8e73d9a4784014be06f5608d7efdb23d837a5037be423"},"schema_version":"1.0"},"canonical_sha256":"9b7be42673ff306feb8e9387418cc3856fe5e0039afe9daba515a02f6299278d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:41.370761Z","signature_b64":"zKIghO3/n7EcodnZ5Rba+vdwRJhlCQCWQ8j6hM4tRArV6b0scf9XkcY2EdVLTaVoCpZPHEszawtO1CQSBU0ZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b7be42673ff306feb8e9387418cc3856fe5e0039afe9daba515a02f6299278d","last_reissued_at":"2026-05-18T00:22:41.370212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:41.370212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08513","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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYUJLX4q5sqDLtDasiX9/Ryhh8/x/yz9jYNGl0LT0vXy+7q31pvAJM/tB1deAHEs+NgTVrthfJACo42ctOP2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:49:09.687723Z"},"content_sha256":"6ee679265e643cc3aa2281237337d0dfa133c75009fcfb98bb05c2056a411722","schema_version":"1.0","event_id":"sha256:6ee679265e643cc3aa2281237337d0dfa133c75009fcfb98bb05c2056a411722"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TN56IJTT74YG724OSODUDDGDQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Jerry Li, Ludwig Schmidt","submitted_at":"2018-02-23T13:07:32Z","abstract_excerpt":"We study the problem of robustly learning multi-dimensional histograms. A $d$-dimensional function $h: D \\rightarrow \\mathbb{R}$ is called a $k$-histogram if there exists a partition of the domain $D \\subseteq \\mathbb{R}^d$ into $k$ axis-aligned rectangles such that $h$ is constant within each such rectangle. Let $f: D \\rightarrow \\mathbb{R}$ be a $d$-dimensional probability density function and suppose that $f$ is $\\mathrm{OPT}$-close, in $L_1$-distance, to an unknown $k$-histogram (with unknown partition). Our goal is to output a hypothesis that is $O(\\mathrm{OPT}) + \\epsilon$ close to $f$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08513","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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tI5GxELpM/PbKnMNstr/AXMOd3RJXQMRDfxrNpMlPwhj+5FGhVtHQeFD2EESI+QNwo241Em982wOqBKgahoNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:49:09.688419Z"},"content_sha256":"d5097a461906894077ac5590ff2d3763d3826d23757f7bceb7ec494b38fa00f0","schema_version":"1.0","event_id":"sha256:d5097a461906894077ac5590ff2d3763d3826d23757f7bceb7ec494b38fa00f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/bundle.json","state_url":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TN56IJTT74YG724OSODUDDGDQV/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-05-26T09:49:09Z","links":{"resolver":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV","bundle":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/bundle.json","state":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TN56IJTT74YG724OSODUDDGDQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TN56IJTT74YG724OSODUDDGDQV","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":"8afbc8229e37a07d80c8e73d9a4784014be06f5608d7efdb23d837a5037be423","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-23T13:07:32Z","title_canon_sha256":"d71c55937ecf7d7cc528a15eab43684df910196f0e4a11f98cecddda453c5ff9"},"schema_version":"1.0","source":{"id":"1802.08513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08513","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08513v1","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08513","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"TN56IJTT74YG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TN56IJTT74YG724O","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TN56IJTT","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:d5097a461906894077ac5590ff2d3763d3826d23757f7bceb7ec494b38fa00f0","target":"graph","created_at":"2026-05-18T00:22:41Z","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 study the problem of robustly learning multi-dimensional histograms. A $d$-dimensional function $h: D \\rightarrow \\mathbb{R}$ is called a $k$-histogram if there exists a partition of the domain $D \\subseteq \\mathbb{R}^d$ into $k$ axis-aligned rectangles such that $h$ is constant within each such rectangle. Let $f: D \\rightarrow \\mathbb{R}$ be a $d$-dimensional probability density function and suppose that $f$ is $\\mathrm{OPT}$-close, in $L_1$-distance, to an unknown $k$-histogram (with unknown partition). Our goal is to output a hypothesis that is $O(\\mathrm{OPT}) + \\epsilon$ close to $f$, ","authors_text":"Ilias Diakonikolas, Jerry Li, Ludwig Schmidt","cross_cats":["cs.DS","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-23T13:07:32Z","title":"Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08513","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:6ee679265e643cc3aa2281237337d0dfa133c75009fcfb98bb05c2056a411722","target":"record","created_at":"2026-05-18T00:22:41Z","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":"8afbc8229e37a07d80c8e73d9a4784014be06f5608d7efdb23d837a5037be423","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-23T13:07:32Z","title_canon_sha256":"d71c55937ecf7d7cc528a15eab43684df910196f0e4a11f98cecddda453c5ff9"},"schema_version":"1.0","source":{"id":"1802.08513","kind":"arxiv","version":1}},"canonical_sha256":"9b7be42673ff306feb8e9387418cc3856fe5e0039afe9daba515a02f6299278d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b7be42673ff306feb8e9387418cc3856fe5e0039afe9daba515a02f6299278d","first_computed_at":"2026-05-18T00:22:41.370212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:41.370212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zKIghO3/n7EcodnZ5Rba+vdwRJhlCQCWQ8j6hM4tRArV6b0scf9XkcY2EdVLTaVoCpZPHEszawtO1CQSBU0ZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:41.370761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ee679265e643cc3aa2281237337d0dfa133c75009fcfb98bb05c2056a411722","sha256:d5097a461906894077ac5590ff2d3763d3826d23757f7bceb7ec494b38fa00f0"],"state_sha256":"5feae930bb38f95797ea2cdce5bff129fe806f57df91ba6fbdb28ece7e850443"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2+7b7Xn7EtDFNGutqIeF57GYdzYCIYM2TboJYaxOKPO73sTiB+XaxLoE1ukNrWlDECjA12KB+9RtfJjfotCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:49:09.692213Z","bundle_sha256":"2fb793738468278c70699e5e38f69c1030babafbc100d3ba08b71cf9fb595861"}}