{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HNOE5V7VNZ7W6FQXWBDAO6ASA6","short_pith_number":"pith:HNOE5V7V","schema_version":"1.0","canonical_sha256":"3b5c4ed7f56e7f6f1617b0460778120798ccca5372041501e7f2693d1f1e7a81","source":{"kind":"arxiv","id":"1510.05417","version":1},"attestation_state":"computed","paper":{"title":"Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ML"],"primary_cat":"stat.ME","authors_text":"Ryuhei Miyashiro, Toshiki Sato, Yuichi Takano","submitted_at":"2015-10-19T10:44:53Z","abstract_excerpt":"This paper concerns a method of selecting a subset of features for a sequential logit model. Tanaka and Nakagawa (2014) proposed a mixed integer quadratic optimization formulation for solving the problem based on a quadratic approximation of the logistic loss function. However, since there is a significant gap between the logistic loss function and its quadratic approximation, their formulation may fail to find a good subset of features. To overcome this drawback, we apply a piecewise-linear approximation to the logistic loss function. Accordingly, we frame the feature subset selection problem"},"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":"1510.05417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-19T10:44:53Z","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"title_canon_sha256":"72d5f9883826fbaa00121e4b175d38c66228843a74e30584ceb5b95c2323d78b","abstract_canon_sha256":"29ea29312d40b26aba84320caf38828086ae3088d975ae8de4b6f59eaed38068"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:52.340844Z","signature_b64":"ClbvSTl/WwJNWCSUiaoFtbqoiKMliHyVCPDZREoGaFtruIVe/JJfSQSMP/HgM75PalrDtxntwpcwf0QBAS1gBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b5c4ed7f56e7f6f1617b0460778120798ccca5372041501e7f2693d1f1e7a81","last_reissued_at":"2026-05-18T01:29:52.340282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:52.340282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ML"],"primary_cat":"stat.ME","authors_text":"Ryuhei Miyashiro, Toshiki Sato, Yuichi Takano","submitted_at":"2015-10-19T10:44:53Z","abstract_excerpt":"This paper concerns a method of selecting a subset of features for a sequential logit model. Tanaka and Nakagawa (2014) proposed a mixed integer quadratic optimization formulation for solving the problem based on a quadratic approximation of the logistic loss function. However, since there is a significant gap between the logistic loss function and its quadratic approximation, their formulation may fail to find a good subset of features. To overcome this drawback, we apply a piecewise-linear approximation to the logistic loss function. Accordingly, we frame the feature subset selection problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05417","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":""},"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":"1510.05417","created_at":"2026-05-18T01:29:52.340385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05417v1","created_at":"2026-05-18T01:29:52.340385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05417","created_at":"2026-05-18T01:29:52.340385+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNOE5V7VNZ7W","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNOE5V7VNZ7W6FQX","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNOE5V7V","created_at":"2026-05-18T12:29:25.134429+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/HNOE5V7VNZ7W6FQXWBDAO6ASA6","json":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6.json","graph_json":"https://pith.science/api/pith-number/HNOE5V7VNZ7W6FQXWBDAO6ASA6/graph.json","events_json":"https://pith.science/api/pith-number/HNOE5V7VNZ7W6FQXWBDAO6ASA6/events.json","paper":"https://pith.science/paper/HNOE5V7V"},"agent_actions":{"view_html":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6","download_json":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6.json","view_paper":"https://pith.science/paper/HNOE5V7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05417&json=true","fetch_graph":"https://pith.science/api/pith-number/HNOE5V7VNZ7W6FQXWBDAO6ASA6/graph.json","fetch_events":"https://pith.science/api/pith-number/HNOE5V7VNZ7W6FQXWBDAO6ASA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/action/storage_attestation","attest_author":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/action/author_attestation","sign_citation":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/action/citation_signature","submit_replication":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/action/replication_record"}},"created_at":"2026-05-18T01:29:52.340385+00:00","updated_at":"2026-05-18T01:29:52.340385+00:00"}