{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:63COWBWQOMAFQT7J4MTARPTUZL","short_pith_number":"pith:63COWBWQ","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"},"canonical_sha256":"f6c4eb06d07300584fe9e32608be74caef4dd6b7580e995741db6c589d0eb051","source":{"kind":"arxiv","id":"1407.6067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6067","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6067v1","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6067","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"63COWBWQOMAF","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"63COWBWQOMAFQT7J","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"63COWBWQ","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:63COWBWQOMAFQT7J4MTARPTUZL","target":"record","payload":{"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"},"canonical_sha256":"f6c4eb06d07300584fe9e32608be74caef4dd6b7580e995741db6c589d0eb051","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"},"source_kind":"arxiv","source_id":"1407.6067","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-18T02:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wl/tzT5+vFY1mUCLQl7nZ5gaUZRf4OlUffD9BYv/ZctiO/yKoymM0wSv2aRgiYajJ3qhg08U8KnxBnyUDgSsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:00:29.818951Z"},"content_sha256":"41b64ff753b638e39b0e32247c8ea9b096c963e6234f446c2ae62e9746d3e285","schema_version":"1.0","event_id":"sha256:41b64ff753b638e39b0e32247c8ea9b096c963e6234f446c2ae62e9746d3e285"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:63COWBWQOMAFQT7J4MTARPTUZL","target":"graph","payload":{"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"},"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-18T02:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZuJcSDw67vXFcLrXxja8fk/ILyr8v+1cenwQcTfxiqivGqpBstxT0DTdmbo3uKLZ72uM/GmEkssAsDVikfhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:00:29.819295Z"},"content_sha256":"ddc18301c7b17515e5487e58659bde443003725eb8044691e11d9cb1cbcc2cae","schema_version":"1.0","event_id":"sha256:ddc18301c7b17515e5487e58659bde443003725eb8044691e11d9cb1cbcc2cae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/bundle.json","state_url":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63COWBWQOMAFQT7J4MTARPTUZL/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-11T11:00:29Z","links":{"resolver":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL","bundle":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/bundle.json","state":"https://pith.science/pith/63COWBWQOMAFQT7J4MTARPTUZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63COWBWQOMAFQT7J4MTARPTUZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:63COWBWQOMAFQT7J4MTARPTUZL","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":"549817892264152c0195d3e0a783774bcd702a6967f53fd6c89af3d5dcee957e","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2014-07-22T23:18:08Z","title_canon_sha256":"ecab9912cb44945a5a1bce1b52c2948e12cf7663d98c6dd2f117a115381b797e"},"schema_version":"1.0","source":{"id":"1407.6067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6067","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6067v1","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6067","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"63COWBWQOMAF","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"63COWBWQOMAFQT7J","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"63COWBWQ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:ddc18301c7b17515e5487e58659bde443003725eb8044691e11d9cb1cbcc2cae","target":"graph","created_at":"2026-05-18T02:46:59Z","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":"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","authors_text":"Carlos E. Ferreira, Junior Barrera, Marcelo S. Reis","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2014-07-22T23:18:08Z","title":"The U-curve optimization problem: improvements on the original algorithm and time complexity analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6067","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:41b64ff753b638e39b0e32247c8ea9b096c963e6234f446c2ae62e9746d3e285","target":"record","created_at":"2026-05-18T02:46:59Z","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":"549817892264152c0195d3e0a783774bcd702a6967f53fd6c89af3d5dcee957e","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2014-07-22T23:18:08Z","title_canon_sha256":"ecab9912cb44945a5a1bce1b52c2948e12cf7663d98c6dd2f117a115381b797e"},"schema_version":"1.0","source":{"id":"1407.6067","kind":"arxiv","version":1}},"canonical_sha256":"f6c4eb06d07300584fe9e32608be74caef4dd6b7580e995741db6c589d0eb051","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6c4eb06d07300584fe9e32608be74caef4dd6b7580e995741db6c589d0eb051","first_computed_at":"2026-05-18T02:46:59.155679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:59.155679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4oY2BCvF8Pg5RazJ7NjuVHvMEeAMyr27Z3Fkdps7eliKqjKTJqIzlrHngh2jYYr6xs2fhpMeyYBt70TNwvY4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:59.156521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41b64ff753b638e39b0e32247c8ea9b096c963e6234f446c2ae62e9746d3e285","sha256:ddc18301c7b17515e5487e58659bde443003725eb8044691e11d9cb1cbcc2cae"],"state_sha256":"cad1c274405434aefeb38bdde5ee675f3d721d4ed495b680b36087842bf5d4a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFUtZiDepcVUaCGB+S4vHcZhPYYLrE8dn2PYNBhMgZXPM6MHgQIUmh1Eri3nrVmgPm01SmvM7Fftuvu9k+LJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:00:29.821258Z","bundle_sha256":"e4c1f735810d85853fb7e1ee09e4fd039b16a81a56df9a3d8d02e0d860ccfac7"}}