{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GBBGJIUJLERO7LGWM47G6MDTK6","short_pith_number":"pith:GBBGJIUJ","schema_version":"1.0","canonical_sha256":"304264a2895922efacd6673e6f3073578c92dfbfcdc7fa2537e36177d868edc6","source":{"kind":"arxiv","id":"1710.04234","version":2},"attestation_state":"computed","paper":{"title":"Maximum Margin Interval Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.AP"],"primary_cat":"stat.ML","authors_text":"Alexandre Drouin, Fran\\c{c}ois Laviolette, Toby Dylan Hocking","submitted_at":"2017-10-11T18:02:38Z","abstract_excerpt":"Learning a regression function using censored or interval-valued output data is an important problem in fields such as genomics and medicine. The goal is to learn a real-valued prediction function, and the training output labels indicate an interval of possible values. Whereas most existing algorithms for this task are linear models, in this paper we investigate learning nonlinear tree models. We propose to learn a tree by minimizing a margin-based discriminative objective function, and we provide a dynamic programming algorithm for computing the optimal solution in log-linear time. We show em"},"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":"1710.04234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-11T18:02:38Z","cross_cats_sorted":["cs.DS","cs.LG","stat.AP"],"title_canon_sha256":"ac54ff2d18d0a41689cd169be0b376c270b580c4a49db0731ea77efa602f8162","abstract_canon_sha256":"3707cb1885337904d17c4148cc8394a4b9146ecaefbc7def9a3afaf9cb94ad79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:55.630523Z","signature_b64":"6cxO0zCsCUZPSgKNgahckkm+uOCa/VQSf4/1F1pdB5jJvMqcvw2dXZmAEi5YaddK8EWAi5GNnRwVdYObDdn0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"304264a2895922efacd6673e6f3073578c92dfbfcdc7fa2537e36177d868edc6","last_reissued_at":"2026-05-18T00:31:55.630141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:55.630141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Margin Interval Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.AP"],"primary_cat":"stat.ML","authors_text":"Alexandre Drouin, Fran\\c{c}ois Laviolette, Toby Dylan Hocking","submitted_at":"2017-10-11T18:02:38Z","abstract_excerpt":"Learning a regression function using censored or interval-valued output data is an important problem in fields such as genomics and medicine. The goal is to learn a real-valued prediction function, and the training output labels indicate an interval of possible values. Whereas most existing algorithms for this task are linear models, in this paper we investigate learning nonlinear tree models. We propose to learn a tree by minimizing a margin-based discriminative objective function, and we provide a dynamic programming algorithm for computing the optimal solution in log-linear time. We show em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04234","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":"1710.04234","created_at":"2026-05-18T00:31:55.630201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04234v2","created_at":"2026-05-18T00:31:55.630201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04234","created_at":"2026-05-18T00:31:55.630201+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBBGJIUJLERO","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBBGJIUJLERO7LGW","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBBGJIUJ","created_at":"2026-05-18T12:31:15.632608+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/GBBGJIUJLERO7LGWM47G6MDTK6","json":"https://pith.science/pith/GBBGJIUJLERO7LGWM47G6MDTK6.json","graph_json":"https://pith.science/api/pith-number/GBBGJIUJLERO7LGWM47G6MDTK6/graph.json","events_json":"https://pith.science/api/pith-number/GBBGJIUJLERO7LGWM47G6MDTK6/events.json","paper":"https://pith.science/paper/GBBGJIUJ"},"agent_actions":{"view_html":"https://pith.science/pith/GBBGJIUJLERO7LGWM47G6MDTK6","download_json":"https://pith.science/pith/GBBGJIUJLERO7LGWM47G6MDTK6.json","view_paper":"https://pith.science/paper/GBBGJIUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04234&json=true","fetch_graph":"https://pith.science/api/pith-number/GBBGJIUJLERO7LGWM47G6MDTK6/graph.json","fetch_events":"https://pith.science/api/pith-number/GBBGJIUJLERO7LGWM47G6MDTK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBBGJIUJLERO7LGWM47G6MDTK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBBGJIUJLERO7LGWM47G6MDTK6/action/storage_attestation","attest_author":"https://pith.science/pith/GBBGJIUJLERO7LGWM47G6MDTK6/action/author_attestation","sign_citation":"https://pith.science/pith/GBBGJIUJLERO7LGWM47G6MDTK6/action/citation_signature","submit_replication":"https://pith.science/pith/GBBGJIUJLERO7LGWM47G6MDTK6/action/replication_record"}},"created_at":"2026-05-18T00:31:55.630201+00:00","updated_at":"2026-05-18T00:31:55.630201+00:00"}