{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:5JRO6BST74DJ7KL2AIT2GC36KC","short_pith_number":"pith:5JRO6BST","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"},"canonical_sha256":"ea62ef0653ff069fa97a0227a30b7e50b65919da8f53f0532f9120d082519db0","source":{"kind":"arxiv","id":"2110.03195","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.03195","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"2110.03195v1","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03195","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"5JRO6BST74DJ","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"pith_short_16","alias_value":"5JRO6BST74DJ7KL2","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"pith_short_8","alias_value":"5JRO6BST","created_at":"2026-07-05T03:20:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:5JRO6BST74DJ7KL2AIT2GC36KC","target":"record","payload":{"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"},"canonical_sha256":"ea62ef0653ff069fa97a0227a30b7e50b65919da8f53f0532f9120d082519db0","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"},"source_kind":"arxiv","source_id":"2110.03195","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-07-05T03:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1MxbkZx5BbZvYtMflzfjEH7+0vxn2Cizdhp1Xneolrw3RZT6Sewe9TylMlpIuBARyaN+cDi3E626WZWg5kCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:32:37.700734Z"},"content_sha256":"27b02fdc78c181e1b7811a0042d345f8578447dfe839ad54d54b20a6d58a5e0a","schema_version":"1.0","event_id":"sha256:27b02fdc78c181e1b7811a0042d345f8578447dfe839ad54d54b20a6d58a5e0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:5JRO6BST74DJ7KL2AIT2GC36KC","target":"graph","payload":{"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"},"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-07-05T03:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWTyyYbtkqp//zdBqb2Q2SIFGhoFoDLWeg2o5khWBTI5GXh2yivRknM7ms9RGqoW/UmCWTFyLz5FVxAe4aFDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:32:37.701066Z"},"content_sha256":"7341e8869db732ff7820f003c03fb62174887aa313038aac9877e822196f9237","schema_version":"1.0","event_id":"sha256:7341e8869db732ff7820f003c03fb62174887aa313038aac9877e822196f9237"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/bundle.json","state_url":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JRO6BST74DJ7KL2AIT2GC36KC/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-08-06T18:32:37Z","links":{"resolver":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC","bundle":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/bundle.json","state":"https://pith.science/pith/5JRO6BST74DJ7KL2AIT2GC36KC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JRO6BST74DJ7KL2AIT2GC36KC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5JRO6BST74DJ7KL2AIT2GC36KC","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":"4665e20be96d78ed7c44ad9146776fdf62c5d6c1dd4839fc45929f76ec992604","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-07T05:49:55Z","title_canon_sha256":"ee1636fcc5d7c5b21a7171d6e0800fa17980d4863a66bb5e346dffa029e2a77e"},"schema_version":"1.0","source":{"id":"2110.03195","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.03195","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"2110.03195v1","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03195","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"5JRO6BST74DJ","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"pith_short_16","alias_value":"5JRO6BST74DJ7KL2","created_at":"2026-07-05T03:20:40Z"},{"alias_kind":"pith_short_8","alias_value":"5JRO6BST","created_at":"2026-07-05T03:20:40Z"}],"graph_snapshots":[{"event_id":"sha256:7341e8869db732ff7820f003c03fb62174887aa313038aac9877e822196f9237","target":"graph","created_at":"2026-07-05T03:20:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.03195/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$. ","authors_text":"Dan Feldman, Ernesto Evgeniy Sanches Shayda, Ibrahim Jubran, Ilan Newman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-07T05:49:55Z","title":"Coresets for Decision Trees of Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03195","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:27b02fdc78c181e1b7811a0042d345f8578447dfe839ad54d54b20a6d58a5e0a","target":"record","created_at":"2026-07-05T03:20:40Z","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":"4665e20be96d78ed7c44ad9146776fdf62c5d6c1dd4839fc45929f76ec992604","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-07T05:49:55Z","title_canon_sha256":"ee1636fcc5d7c5b21a7171d6e0800fa17980d4863a66bb5e346dffa029e2a77e"},"schema_version":"1.0","source":{"id":"2110.03195","kind":"arxiv","version":1}},"canonical_sha256":"ea62ef0653ff069fa97a0227a30b7e50b65919da8f53f0532f9120d082519db0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea62ef0653ff069fa97a0227a30b7e50b65919da8f53f0532f9120d082519db0","first_computed_at":"2026-07-05T03:20:40.341904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:20:40.341904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rgpvuahjEULtWEKiO8IB+L4rm2Ip951tI65Sux8lyapXa754vPIcFUSnsF5K5B/iDX9bSUoktrC4LFjtAh1SAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:20:40.342339Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.03195","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27b02fdc78c181e1b7811a0042d345f8578447dfe839ad54d54b20a6d58a5e0a","sha256:7341e8869db732ff7820f003c03fb62174887aa313038aac9877e822196f9237"],"state_sha256":"df635c64699e97622c82d3806a91ff73ce18e8cfb23a5b9c933b81a474a1b7c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4a61xjnzzJQ6bLD5TRED+vortsSFLDGwtGvrdx+2g87nQTDdd9fG4ZaQA4MbFpg5lyayxNSJuZyxtesqZyCKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:32:37.704480Z","bundle_sha256":"49b49d200047eafcf34e385d0e6b678754aa2c03960001f8a572285eed7adb08"}}