{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:D2UHF3SFXFIKPFRWAHQH7FJJQL","short_pith_number":"pith:D2UHF3SF","schema_version":"1.0","canonical_sha256":"1ea872ee45b950a7963601e07f952982f749eb6fa5ef264b5ac744057c343127","source":{"kind":"arxiv","id":"1204.4539","version":3},"attestation_state":"computed","paper":{"title":"Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Bin Yu, Julien Mairal","submitted_at":"2012-04-20T06:24:37Z","abstract_excerpt":"We consider supervised learning problems where the features are embedded in a graph, such as gene expressions in a gene network. In this context, it is of much interest to automatically select a subgraph with few connected components; by exploiting prior knowledge, one can indeed improve the prediction performance or obtain results that are easier to interpret. Regularization or penalty functions for selecting features in graphs have recently been proposed, but they raise new algorithmic challenges. For example, they typically require solving a combinatorially hard selection problem among all "},"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":"1204.4539","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-04-20T06:24:37Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"f7e9157ae200db56dcc465079d0a60b84ab1efc55cc17e4216e87d1498b2a1e8","abstract_canon_sha256":"a753b6db0cec233cac21b21dad0b639d92a7ee86902e099609e9880c97e2fb94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:57.998418Z","signature_b64":"5eXX+A+1Ts/IxsG0PfbyRyrPaC73/0hEicy5bxasV5dnLjxSnXcHOVRia82F8Hy/O1/5MTmtwpZXO5QNUB7lAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea872ee45b950a7963601e07f952982f749eb6fa5ef264b5ac744057c343127","last_reissued_at":"2026-05-18T03:12:57.997762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:57.997762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Bin Yu, Julien Mairal","submitted_at":"2012-04-20T06:24:37Z","abstract_excerpt":"We consider supervised learning problems where the features are embedded in a graph, such as gene expressions in a gene network. In this context, it is of much interest to automatically select a subgraph with few connected components; by exploiting prior knowledge, one can indeed improve the prediction performance or obtain results that are easier to interpret. Regularization or penalty functions for selecting features in graphs have recently been proposed, but they raise new algorithmic challenges. For example, they typically require solving a combinatorially hard selection problem among all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4539","kind":"arxiv","version":3},"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":"1204.4539","created_at":"2026-05-18T03:12:57.997860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4539v3","created_at":"2026-05-18T03:12:57.997860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4539","created_at":"2026-05-18T03:12:57.997860+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2UHF3SFXFIK","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2UHF3SFXFIKPFRW","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2UHF3SF","created_at":"2026-05-18T12:27:01.376967+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/D2UHF3SFXFIKPFRWAHQH7FJJQL","json":"https://pith.science/pith/D2UHF3SFXFIKPFRWAHQH7FJJQL.json","graph_json":"https://pith.science/api/pith-number/D2UHF3SFXFIKPFRWAHQH7FJJQL/graph.json","events_json":"https://pith.science/api/pith-number/D2UHF3SFXFIKPFRWAHQH7FJJQL/events.json","paper":"https://pith.science/paper/D2UHF3SF"},"agent_actions":{"view_html":"https://pith.science/pith/D2UHF3SFXFIKPFRWAHQH7FJJQL","download_json":"https://pith.science/pith/D2UHF3SFXFIKPFRWAHQH7FJJQL.json","view_paper":"https://pith.science/paper/D2UHF3SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4539&json=true","fetch_graph":"https://pith.science/api/pith-number/D2UHF3SFXFIKPFRWAHQH7FJJQL/graph.json","fetch_events":"https://pith.science/api/pith-number/D2UHF3SFXFIKPFRWAHQH7FJJQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2UHF3SFXFIKPFRWAHQH7FJJQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2UHF3SFXFIKPFRWAHQH7FJJQL/action/storage_attestation","attest_author":"https://pith.science/pith/D2UHF3SFXFIKPFRWAHQH7FJJQL/action/author_attestation","sign_citation":"https://pith.science/pith/D2UHF3SFXFIKPFRWAHQH7FJJQL/action/citation_signature","submit_replication":"https://pith.science/pith/D2UHF3SFXFIKPFRWAHQH7FJJQL/action/replication_record"}},"created_at":"2026-05-18T03:12:57.997860+00:00","updated_at":"2026-05-18T03:12:57.997860+00:00"}