{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TN56IJTT74YG724OSODUDDGDQV","short_pith_number":"pith:TN56IJTT","schema_version":"1.0","canonical_sha256":"9b7be42673ff306feb8e9387418cc3856fe5e0039afe9daba515a02f6299278d","source":{"kind":"arxiv","id":"1802.08513","version":1},"attestation_state":"computed","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$, "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.08513","created_at":"2026-05-18T00:22:41.370298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08513v1","created_at":"2026-05-18T00:22:41.370298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08513","created_at":"2026-05-18T00:22:41.370298+00:00"},{"alias_kind":"pith_short_12","alias_value":"TN56IJTT74YG","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TN56IJTT74YG724O","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TN56IJTT","created_at":"2026-05-18T12:32:53.628368+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/TN56IJTT74YG724OSODUDDGDQV","json":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV.json","graph_json":"https://pith.science/api/pith-number/TN56IJTT74YG724OSODUDDGDQV/graph.json","events_json":"https://pith.science/api/pith-number/TN56IJTT74YG724OSODUDDGDQV/events.json","paper":"https://pith.science/paper/TN56IJTT"},"agent_actions":{"view_html":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV","download_json":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV.json","view_paper":"https://pith.science/paper/TN56IJTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08513&json=true","fetch_graph":"https://pith.science/api/pith-number/TN56IJTT74YG724OSODUDDGDQV/graph.json","fetch_events":"https://pith.science/api/pith-number/TN56IJTT74YG724OSODUDDGDQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/action/storage_attestation","attest_author":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/action/author_attestation","sign_citation":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/action/citation_signature","submit_replication":"https://pith.science/pith/TN56IJTT74YG724OSODUDDGDQV/action/replication_record"}},"created_at":"2026-05-18T00:22:41.370298+00:00","updated_at":"2026-05-18T00:22:41.370298+00:00"}