{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:63COWBWQOMAFQT7J4MTARPTUZL","short_pith_number":"pith:63COWBWQ","schema_version":"1.0","canonical_sha256":"f6c4eb06d07300584fe9e32608be74caef4dd6b7580e995741db6c589d0eb051","source":{"kind":"arxiv","id":"1407.6067","version":1},"attestation_state":"computed","paper":{"title":"The U-curve optimization problem: improvements on the original algorithm and time complexity analysis","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Carlos E. Ferreira, Junior Barrera, Marcelo S. Reis","submitted_at":"2014-07-22T23:18:08Z","abstract_excerpt":"The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the classical feature selection problem in Machine Learning. Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem. In this article, we point out that the U-Curve algorithm is in fact suboptimal, and introduce the U-Curve-Search (UCS) algorithm, which is actually optimal. We also present the results of optimal and suboptimal experiments, in which UCS is compared with the UBB optima"},"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":"1407.6067","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2014-07-22T23:18:08Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"ecab9912cb44945a5a1bce1b52c2948e12cf7663d98c6dd2f117a115381b797e","abstract_canon_sha256":"549817892264152c0195d3e0a783774bcd702a6967f53fd6c89af3d5dcee957e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:59.156521Z","signature_b64":"4oY2BCvF8Pg5RazJ7NjuVHvMEeAMyr27Z3Fkdps7eliKqjKTJqIzlrHngh2jYYr6xs2fhpMeyYBt70TNwvY4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c4eb06d07300584fe9e32608be74caef4dd6b7580e995741db6c589d0eb051","last_reissued_at":"2026-05-18T02:46:59.155679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:59.155679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The U-curve optimization problem: improvements on the original algorithm and time complexity analysis","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Carlos E. Ferreira, Junior Barrera, Marcelo S. Reis","submitted_at":"2014-07-22T23:18:08Z","abstract_excerpt":"The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the classical feature selection problem in Machine Learning. Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem. In this article, we point out that the U-Curve algorithm is in fact suboptimal, and introduce the U-Curve-Search (UCS) algorithm, which is actually optimal. We also present the results of optimal and suboptimal experiments, in which UCS is compared with the UBB optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6067","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":"1407.6067","created_at":"2026-05-18T02:46:59.155785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6067v1","created_at":"2026-05-18T02:46:59.155785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6067","created_at":"2026-05-18T02:46:59.155785+00:00"},{"alias_kind":"pith_short_12","alias_value":"63COWBWQOMAF","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"63COWBWQOMAFQT7J","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"63COWBWQ","created_at":"2026-05-18T12:28:16.859392+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/63COWBWQOMAFQT7J4MTARPTUZL","json":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL.json","graph_json":"https://pith.science/api/pith-number/63COWBWQOMAFQT7J4MTARPTUZL/graph.json","events_json":"https://pith.science/api/pith-number/63COWBWQOMAFQT7J4MTARPTUZL/events.json","paper":"https://pith.science/paper/63COWBWQ"},"agent_actions":{"view_html":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL","download_json":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL.json","view_paper":"https://pith.science/paper/63COWBWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6067&json=true","fetch_graph":"https://pith.science/api/pith-number/63COWBWQOMAFQT7J4MTARPTUZL/graph.json","fetch_events":"https://pith.science/api/pith-number/63COWBWQOMAFQT7J4MTARPTUZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/action/storage_attestation","attest_author":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/action/author_attestation","sign_citation":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/action/citation_signature","submit_replication":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/action/replication_record"}},"created_at":"2026-05-18T02:46:59.155785+00:00","updated_at":"2026-05-18T02:46:59.155785+00:00"}