{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4ANA3DD3XLK6FRUTTCC5XBYJCX","short_pith_number":"pith:4ANA3DD3","schema_version":"1.0","canonical_sha256":"e01a0d8c7bbad5e2c6939885db870915f47a026a243e3b0b78c717bc8de3b4e8","source":{"kind":"arxiv","id":"1910.09600","version":3},"attestation_state":"computed","paper":{"title":"Is graph-based feature selection of genes better than random?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-bio.QM"],"primary_cat":"q-bio.GN","authors_text":"Genevi\\`eve Boucher, Joseph Paul Cohen, Martin Weiss, Mohammad Hashir, Paul Bertin, Theodore J. Perkins, Vincent Frappier","submitted_at":"2019-10-21T18:51:25Z","abstract_excerpt":"Gene interaction graphs aim to capture various relationships between genes and represent decades of biology research. When trying to make predictions from genomic data, those graphs could be used to overcome the curse of dimensionality by making machine learning models sparser and more consistent with biological common knowledge. In this work, we focus on assessing whether those graphs capture dependencies seen in gene expression data better than random. We formulate a condition that graphs should satisfy to provide a good prior knowledge and propose to test it using a `Single Gene Inference' "},"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":"1910.09600","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2019-10-21T18:51:25Z","cross_cats_sorted":["cs.LG","q-bio.QM"],"title_canon_sha256":"042fffeeaa606639ef190a265935a34cef5cdaa77391b92bb6cb6ef139481a88","abstract_canon_sha256":"7357392f3b8e694c18275b3f1e2a9a81b22f021a86cc3bacbc0b87cc88b3e8ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:52.411815Z","signature_b64":"TXnjBNcsX4yunrqJtWsL4g/y1f4MZuryZOIRNXcLVJGE0wKK6MckOWf6Hzh2XDUCcinaGW+jPQVJ8dkyh6jmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e01a0d8c7bbad5e2c6939885db870915f47a026a243e3b0b78c717bc8de3b4e8","last_reissued_at":"2026-07-05T00:32:52.411335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:52.411335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is graph-based feature selection of genes better than random?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-bio.QM"],"primary_cat":"q-bio.GN","authors_text":"Genevi\\`eve Boucher, Joseph Paul Cohen, Martin Weiss, Mohammad Hashir, Paul Bertin, Theodore J. Perkins, Vincent Frappier","submitted_at":"2019-10-21T18:51:25Z","abstract_excerpt":"Gene interaction graphs aim to capture various relationships between genes and represent decades of biology research. When trying to make predictions from genomic data, those graphs could be used to overcome the curse of dimensionality by making machine learning models sparser and more consistent with biological common knowledge. In this work, we focus on assessing whether those graphs capture dependencies seen in gene expression data better than random. We formulate a condition that graphs should satisfy to provide a good prior knowledge and propose to test it using a `Single Gene Inference' "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09600","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.09600/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.09600","created_at":"2026-07-05T00:32:52.411394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.09600v3","created_at":"2026-07-05T00:32:52.411394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09600","created_at":"2026-07-05T00:32:52.411394+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ANA3DD3XLK6","created_at":"2026-07-05T00:32:52.411394+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ANA3DD3XLK6FRUT","created_at":"2026-07-05T00:32:52.411394+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ANA3DD3","created_at":"2026-07-05T00:32:52.411394+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/4ANA3DD3XLK6FRUTTCC5XBYJCX","json":"https://pith.science/pith/4ANA3DD3XLK6FRUTTCC5XBYJCX.json","graph_json":"https://pith.science/api/pith-number/4ANA3DD3XLK6FRUTTCC5XBYJCX/graph.json","events_json":"https://pith.science/api/pith-number/4ANA3DD3XLK6FRUTTCC5XBYJCX/events.json","paper":"https://pith.science/paper/4ANA3DD3"},"agent_actions":{"view_html":"https://pith.science/pith/4ANA3DD3XLK6FRUTTCC5XBYJCX","download_json":"https://pith.science/pith/4ANA3DD3XLK6FRUTTCC5XBYJCX.json","view_paper":"https://pith.science/paper/4ANA3DD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.09600&json=true","fetch_graph":"https://pith.science/api/pith-number/4ANA3DD3XLK6FRUTTCC5XBYJCX/graph.json","fetch_events":"https://pith.science/api/pith-number/4ANA3DD3XLK6FRUTTCC5XBYJCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ANA3DD3XLK6FRUTTCC5XBYJCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ANA3DD3XLK6FRUTTCC5XBYJCX/action/storage_attestation","attest_author":"https://pith.science/pith/4ANA3DD3XLK6FRUTTCC5XBYJCX/action/author_attestation","sign_citation":"https://pith.science/pith/4ANA3DD3XLK6FRUTTCC5XBYJCX/action/citation_signature","submit_replication":"https://pith.science/pith/4ANA3DD3XLK6FRUTTCC5XBYJCX/action/replication_record"}},"created_at":"2026-07-05T00:32:52.411394+00:00","updated_at":"2026-07-05T00:32:52.411394+00:00"}