{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HNOE5V7VNZ7W6FQXWBDAO6ASA6","short_pith_number":"pith:HNOE5V7V","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"},"canonical_sha256":"3b5c4ed7f56e7f6f1617b0460778120798ccca5372041501e7f2693d1f1e7a81","source":{"kind":"arxiv","id":"1510.05417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05417","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05417v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05417","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"HNOE5V7VNZ7W","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HNOE5V7VNZ7W6FQX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HNOE5V7V","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HNOE5V7VNZ7W6FQXWBDAO6ASA6","target":"record","payload":{"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"},"canonical_sha256":"3b5c4ed7f56e7f6f1617b0460778120798ccca5372041501e7f2693d1f1e7a81","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"},"source_kind":"arxiv","source_id":"1510.05417","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-05-18T01:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EH83+ToqcyB6NEROWKrERWgG01y/zWXsARZIYZZPlOPWADv7LBDRnrGQluKzJAMiVg/018QCZdOY/dd62zwvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:47:45.559989Z"},"content_sha256":"145c49e3f2eb5449b0b367ca45205644a8cfd1a2885e85c47c3017ed7f2abf7f","schema_version":"1.0","event_id":"sha256:145c49e3f2eb5449b0b367ca45205644a8cfd1a2885e85c47c3017ed7f2abf7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HNOE5V7VNZ7W6FQXWBDAO6ASA6","target":"graph","payload":{"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"},"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-18T01:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qgrao7c7OUJF7L/+PY/sydpvhC1I/9xRMvNCP8XXyiuGuVHXzI/P5EjFUoECUl1MeLiyb0boNMQpwbSTJBcuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:47:45.560610Z"},"content_sha256":"dfd97733a5c766aa3521843764276c0e86f8d62330681515701d293fc3e0d120","schema_version":"1.0","event_id":"sha256:dfd97733a5c766aa3521843764276c0e86f8d62330681515701d293fc3e0d120"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/bundle.json","state_url":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/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-06T06:47:45Z","links":{"resolver":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6","bundle":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/bundle.json","state":"https://pith.science/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNOE5V7VNZ7W6FQXWBDAO6ASA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HNOE5V7VNZ7W6FQXWBDAO6ASA6","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":"29ea29312d40b26aba84320caf38828086ae3088d975ae8de4b6f59eaed38068","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-19T10:44:53Z","title_canon_sha256":"72d5f9883826fbaa00121e4b175d38c66228843a74e30584ceb5b95c2323d78b"},"schema_version":"1.0","source":{"id":"1510.05417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05417","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05417v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05417","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"HNOE5V7VNZ7W","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HNOE5V7VNZ7W6FQX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HNOE5V7V","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:dfd97733a5c766aa3521843764276c0e86f8d62330681515701d293fc3e0d120","target":"graph","created_at":"2026-05-18T01:29:52Z","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":"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","authors_text":"Ryuhei Miyashiro, Toshiki Sato, Yuichi Takano","cross_cats":["cs.LG","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-19T10:44:53Z","title":"Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05417","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:145c49e3f2eb5449b0b367ca45205644a8cfd1a2885e85c47c3017ed7f2abf7f","target":"record","created_at":"2026-05-18T01:29:52Z","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":"29ea29312d40b26aba84320caf38828086ae3088d975ae8de4b6f59eaed38068","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-19T10:44:53Z","title_canon_sha256":"72d5f9883826fbaa00121e4b175d38c66228843a74e30584ceb5b95c2323d78b"},"schema_version":"1.0","source":{"id":"1510.05417","kind":"arxiv","version":1}},"canonical_sha256":"3b5c4ed7f56e7f6f1617b0460778120798ccca5372041501e7f2693d1f1e7a81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b5c4ed7f56e7f6f1617b0460778120798ccca5372041501e7f2693d1f1e7a81","first_computed_at":"2026-05-18T01:29:52.340282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:52.340282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ClbvSTl/WwJNWCSUiaoFtbqoiKMliHyVCPDZREoGaFtruIVe/JJfSQSMP/HgM75PalrDtxntwpcwf0QBAS1gBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:52.340844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:145c49e3f2eb5449b0b367ca45205644a8cfd1a2885e85c47c3017ed7f2abf7f","sha256:dfd97733a5c766aa3521843764276c0e86f8d62330681515701d293fc3e0d120"],"state_sha256":"db142d218e015b987f52a937ca420e92bb376905d0cb84a5c6d0472fc6ead6bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpuwK10nuEyLge1A1g8DkGXrc+f4ntNrY2hsWKbvIxfffnFhKwzQ7V/lm3QVgSh0Nf+N7jhVkTg+bG5XZwD/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:47:45.564096Z","bundle_sha256":"84e2893ad94e91c179690a9d846b42f7a52141a46b2ccebae072acb9deedf6ba"}}