{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4GSWPVHGXJLXNRPOSIS7F4ZG6I","short_pith_number":"pith:4GSWPVHG","canonical_record":{"source":{"id":"1311.6392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:31:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"99e10c741bc0892f56888a9223c235d445626aaaa21083cbd479f118ccebc730","abstract_canon_sha256":"6175e2a954cdca851ea12362dc26d41a7a40374cf5cbb6b19bf161fb451370f0"},"schema_version":"1.0"},"canonical_sha256":"e1a567d4e6ba5776c5ee9225f2f326f20704fa64a072fcc60a85198f434dbbe2","source":{"kind":"arxiv","id":"1311.6392","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6392","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6392v2","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6392","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"4GSWPVHGXJLX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4GSWPVHGXJLXNRPO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4GSWPVHG","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4GSWPVHGXJLXNRPOSIS7F4ZG6I","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:31:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"99e10c741bc0892f56888a9223c235d445626aaaa21083cbd479f118ccebc730","abstract_canon_sha256":"6175e2a954cdca851ea12362dc26d41a7a40374cf5cbb6b19bf161fb451370f0"},"schema_version":"1.0"},"canonical_sha256":"e1a567d4e6ba5776c5ee9225f2f326f20704fa64a072fcc60a85198f434dbbe2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:46.732949Z","signature_b64":"idp2Eyctd+EpZ+YDQCMeqADrkWCKQ1Rybe3N/AIONwRTJS43L7T4FA3f820Tz2YOuK9I1ABiitgzbNOjqbmoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1a567d4e6ba5776c5ee9225f2f326f20704fa64a072fcc60a85198f434dbbe2","last_reissued_at":"2026-05-18T03:03:46.732200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:46.732200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6392","source_version":2,"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-18T03:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PENnr+qCTZil7jtvvg6brmem6KTKNYuLK6+wnya4XMATrUIHvdv7Q1ZYQtnD7C9cP3kSD4gFM2gvmvc0/pmRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:03:56.307994Z"},"content_sha256":"bee58ad1c754a5280c241826b53969239c9fd0a6e94cba38192743dcede2a808","schema_version":"1.0","event_id":"sha256:bee58ad1c754a5280c241826b53969239c9fd0a6e94cba38192743dcede2a808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4GSWPVHGXJLXNRPOSIS7F4ZG6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Comprehensive Approach to Universal Piecewise Nonlinear Regression Based on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"N. Denizcan Vanli, Suleyman S. Kozat","submitted_at":"2013-11-25T18:31:40Z","abstract_excerpt":"In this paper, we investigate adaptive nonlinear regression and introduce tree based piecewise linear regression algorithms that are highly efficient and provide significantly improved performance with guaranteed upper bounds in an individual sequence manner. We use a tree notion in order to partition the space of regressors in a nested structure. The introduced algorithms adapt not only their regression functions but also the complete tree structure while achieving the performance of the \"best\" linear mixture of a doubly exponential number of partitions, with a computational complexity only p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6392","kind":"arxiv","version":2},"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-18T03:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvjR9BTVBBvMw8fCRJu3sp1UIqBOe6FKGyccgUqhdpMQlQXZKrgKenHFyxhCyOUo2ZiOABCBWZFGgn2B6L0JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:03:56.308360Z"},"content_sha256":"1c8d5a6b345709b275e73705df88783e8b421c496a8131b9eed0f898792d4916","schema_version":"1.0","event_id":"sha256:1c8d5a6b345709b275e73705df88783e8b421c496a8131b9eed0f898792d4916"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GSWPVHGXJLXNRPOSIS7F4ZG6I/bundle.json","state_url":"https://pith.science/pith/4GSWPVHGXJLXNRPOSIS7F4ZG6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GSWPVHGXJLXNRPOSIS7F4ZG6I/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-26T01:03:56Z","links":{"resolver":"https://pith.science/pith/4GSWPVHGXJLXNRPOSIS7F4ZG6I","bundle":"https://pith.science/pith/4GSWPVHGXJLXNRPOSIS7F4ZG6I/bundle.json","state":"https://pith.science/pith/4GSWPVHGXJLXNRPOSIS7F4ZG6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GSWPVHGXJLXNRPOSIS7F4ZG6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4GSWPVHGXJLXNRPOSIS7F4ZG6I","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":"6175e2a954cdca851ea12362dc26d41a7a40374cf5cbb6b19bf161fb451370f0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:31:40Z","title_canon_sha256":"99e10c741bc0892f56888a9223c235d445626aaaa21083cbd479f118ccebc730"},"schema_version":"1.0","source":{"id":"1311.6392","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6392","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6392v2","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6392","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"4GSWPVHGXJLX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4GSWPVHGXJLXNRPO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4GSWPVHG","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:1c8d5a6b345709b275e73705df88783e8b421c496a8131b9eed0f898792d4916","target":"graph","created_at":"2026-05-18T03:03:46Z","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":"In this paper, we investigate adaptive nonlinear regression and introduce tree based piecewise linear regression algorithms that are highly efficient and provide significantly improved performance with guaranteed upper bounds in an individual sequence manner. We use a tree notion in order to partition the space of regressors in a nested structure. The introduced algorithms adapt not only their regression functions but also the complete tree structure while achieving the performance of the \"best\" linear mixture of a doubly exponential number of partitions, with a computational complexity only p","authors_text":"N. Denizcan Vanli, Suleyman S. Kozat","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:31:40Z","title":"A Comprehensive Approach to Universal Piecewise Nonlinear Regression Based on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6392","kind":"arxiv","version":2},"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:bee58ad1c754a5280c241826b53969239c9fd0a6e94cba38192743dcede2a808","target":"record","created_at":"2026-05-18T03:03:46Z","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":"6175e2a954cdca851ea12362dc26d41a7a40374cf5cbb6b19bf161fb451370f0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:31:40Z","title_canon_sha256":"99e10c741bc0892f56888a9223c235d445626aaaa21083cbd479f118ccebc730"},"schema_version":"1.0","source":{"id":"1311.6392","kind":"arxiv","version":2}},"canonical_sha256":"e1a567d4e6ba5776c5ee9225f2f326f20704fa64a072fcc60a85198f434dbbe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1a567d4e6ba5776c5ee9225f2f326f20704fa64a072fcc60a85198f434dbbe2","first_computed_at":"2026-05-18T03:03:46.732200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:46.732200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"idp2Eyctd+EpZ+YDQCMeqADrkWCKQ1Rybe3N/AIONwRTJS43L7T4FA3f820Tz2YOuK9I1ABiitgzbNOjqbmoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:46.732949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6392","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bee58ad1c754a5280c241826b53969239c9fd0a6e94cba38192743dcede2a808","sha256:1c8d5a6b345709b275e73705df88783e8b421c496a8131b9eed0f898792d4916"],"state_sha256":"8ebd3e864a2d7d4a51cb12639d076f7f3f57b9ad45f803e1dd9c693f2e14cd01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W84U18uXsGoJ7CvYOWUek4r0P5BNQGlyf3/VF0ffbj0O+oLs6WTIEUk+4DCyq5Ve39RD9Bl11U2DJFNFxnNkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:03:56.310743Z","bundle_sha256":"490830c0f4dad74bb1cbba227809d6f4dd8269aab77880935806e224012dd59a"}}