{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5JRO6BST74DJ7KL2AIT2GC36KC","short_pith_number":"pith:5JRO6BST","schema_version":"1.0","canonical_sha256":"ea62ef0653ff069fa97a0227a30b7e50b65919da8f53f0532f9120d082519db0","source":{"kind":"arxiv","id":"2110.03195","version":1},"attestation_state":"computed","paper":{"title":"Coresets for Decision Trees of Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Ernesto Evgeniy Sanches Shayda, Ibrahim Jubran, Ilan Newman","submitted_at":"2021-10-07T05:49:55Z","abstract_excerpt":"A $k$-decision tree $t$ (or $k$-tree) is a recursive partition of a matrix (2D-signal) into $k\\geq 1$ block matrices (axis-parallel rectangles, leaves) where each rectangle is assigned a real label. Its regression or classification loss to a given matrix $D$ of $N$ entries (labels) is the sum of squared differences over every label in $D$ and its assigned label by $t$. Given an error parameter $\\varepsilon\\in(0,1)$, a $(k,\\varepsilon)$-coreset $C$ of $D$ is a small summarization that provably approximates this loss to \\emph{every} such tree, up to a multiplicative factor of $1\\pm\\varepsilon$. "},"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":"2110.03195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-07T05:49:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ee1636fcc5d7c5b21a7171d6e0800fa17980d4863a66bb5e346dffa029e2a77e","abstract_canon_sha256":"4665e20be96d78ed7c44ad9146776fdf62c5d6c1dd4839fc45929f76ec992604"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:40.342339Z","signature_b64":"rgpvuahjEULtWEKiO8IB+L4rm2Ip951tI65Sux8lyapXa754vPIcFUSnsF5K5B/iDX9bSUoktrC4LFjtAh1SAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea62ef0653ff069fa97a0227a30b7e50b65919da8f53f0532f9120d082519db0","last_reissued_at":"2026-07-05T03:20:40.341904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:40.341904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coresets for Decision Trees of Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Ernesto Evgeniy Sanches Shayda, Ibrahim Jubran, Ilan Newman","submitted_at":"2021-10-07T05:49:55Z","abstract_excerpt":"A $k$-decision tree $t$ (or $k$-tree) is a recursive partition of a matrix (2D-signal) into $k\\geq 1$ block matrices (axis-parallel rectangles, leaves) where each rectangle is assigned a real label. Its regression or classification loss to a given matrix $D$ of $N$ entries (labels) is the sum of squared differences over every label in $D$ and its assigned label by $t$. Given an error parameter $\\varepsilon\\in(0,1)$, a $(k,\\varepsilon)$-coreset $C$ of $D$ is a small summarization that provably approximates this loss to \\emph{every} such tree, up to a multiplicative factor of $1\\pm\\varepsilon$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03195","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.03195/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.03195","created_at":"2026-07-05T03:20:40.341962+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.03195v1","created_at":"2026-07-05T03:20:40.341962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03195","created_at":"2026-07-05T03:20:40.341962+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JRO6BST74DJ","created_at":"2026-07-05T03:20:40.341962+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JRO6BST74DJ7KL2","created_at":"2026-07-05T03:20:40.341962+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JRO6BST","created_at":"2026-07-05T03:20:40.341962+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/5JRO6BST74DJ7KL2AIT2GC36KC","json":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC.json","graph_json":"https://pith.science/api/pith-number/5JRO6BST74DJ7KL2AIT2GC36KC/graph.json","events_json":"https://pith.science/api/pith-number/5JRO6BST74DJ7KL2AIT2GC36KC/events.json","paper":"https://pith.science/paper/5JRO6BST"},"agent_actions":{"view_html":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC","download_json":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC.json","view_paper":"https://pith.science/paper/5JRO6BST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.03195&json=true","fetch_graph":"https://pith.science/api/pith-number/5JRO6BST74DJ7KL2AIT2GC36KC/graph.json","fetch_events":"https://pith.science/api/pith-number/5JRO6BST74DJ7KL2AIT2GC36KC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/action/storage_attestation","attest_author":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/action/author_attestation","sign_citation":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/action/citation_signature","submit_replication":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/action/replication_record"}},"created_at":"2026-07-05T03:20:40.341962+00:00","updated_at":"2026-07-05T03:20:40.341962+00:00"}