{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MFMIAMEA5OSQXNK5IUGPAUTTQK","short_pith_number":"pith:MFMIAMEA","schema_version":"1.0","canonical_sha256":"6158803080eba50bb55d450cf05273829cf3321224772f2482ba1598a3b6eed3","source":{"kind":"arxiv","id":"1211.1513","version":2},"attestation_state":"computed","paper":{"title":"K-Plane Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Naresh Manwani, P. S. Sastry","submitted_at":"2012-11-07T10:57:38Z","abstract_excerpt":"In this paper, we present a novel algorithm for piecewise linear regression which can learn continuous as well as discontinuous piecewise linear functions. The main idea is to repeatedly partition the data and learn a liner model in in each partition. While a simple algorithm incorporating this idea does not work well, an interesting modification results in a good algorithm. The proposed algorithm is similar in spirit to $k$-means clustering algorithm. We show that our algorithm can also be viewed as an EM algorithm for maximum likelihood estimation of parameters under a reasonable probability"},"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":"1211.1513","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-07T10:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"4e8e5f309b3fc407603b260c2d3011ad9ef435faa4aeba21db59678b6a705b16","abstract_canon_sha256":"db4ac2053277162c3f4cbe4f2f8079c71d70b0224ecb690e04cf32bf11dd5a1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:16.696017Z","signature_b64":"N4AdCF1/70HPWFhE7Krym3PcM/e6SMISEgxnEYUQefyQUmAYvVhua2Ycs2c9m3bQOiFYqreeagPdR4CEWIe8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6158803080eba50bb55d450cf05273829cf3321224772f2482ba1598a3b6eed3","last_reissued_at":"2026-05-18T02:43:16.695361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:16.695361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-Plane Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Naresh Manwani, P. S. Sastry","submitted_at":"2012-11-07T10:57:38Z","abstract_excerpt":"In this paper, we present a novel algorithm for piecewise linear regression which can learn continuous as well as discontinuous piecewise linear functions. The main idea is to repeatedly partition the data and learn a liner model in in each partition. While a simple algorithm incorporating this idea does not work well, an interesting modification results in a good algorithm. The proposed algorithm is similar in spirit to $k$-means clustering algorithm. We show that our algorithm can also be viewed as an EM algorithm for maximum likelihood estimation of parameters under a reasonable probability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1513","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.1513","created_at":"2026-05-18T02:43:16.695482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1513v2","created_at":"2026-05-18T02:43:16.695482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1513","created_at":"2026-05-18T02:43:16.695482+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFMIAMEA5OSQ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFMIAMEA5OSQXNK5","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFMIAMEA","created_at":"2026-05-18T12:27:14.488303+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/MFMIAMEA5OSQXNK5IUGPAUTTQK","json":"https://pith.science/pith/MFMIAMEA5OSQXNK5IUGPAUTTQK.json","graph_json":"https://pith.science/api/pith-number/MFMIAMEA5OSQXNK5IUGPAUTTQK/graph.json","events_json":"https://pith.science/api/pith-number/MFMIAMEA5OSQXNK5IUGPAUTTQK/events.json","paper":"https://pith.science/paper/MFMIAMEA"},"agent_actions":{"view_html":"https://pith.science/pith/MFMIAMEA5OSQXNK5IUGPAUTTQK","download_json":"https://pith.science/pith/MFMIAMEA5OSQXNK5IUGPAUTTQK.json","view_paper":"https://pith.science/paper/MFMIAMEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1513&json=true","fetch_graph":"https://pith.science/api/pith-number/MFMIAMEA5OSQXNK5IUGPAUTTQK/graph.json","fetch_events":"https://pith.science/api/pith-number/MFMIAMEA5OSQXNK5IUGPAUTTQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFMIAMEA5OSQXNK5IUGPAUTTQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFMIAMEA5OSQXNK5IUGPAUTTQK/action/storage_attestation","attest_author":"https://pith.science/pith/MFMIAMEA5OSQXNK5IUGPAUTTQK/action/author_attestation","sign_citation":"https://pith.science/pith/MFMIAMEA5OSQXNK5IUGPAUTTQK/action/citation_signature","submit_replication":"https://pith.science/pith/MFMIAMEA5OSQXNK5IUGPAUTTQK/action/replication_record"}},"created_at":"2026-05-18T02:43:16.695482+00:00","updated_at":"2026-05-18T02:43:16.695482+00:00"}