{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:O6MUD4CBI5G4CCYBDM6YVDUXG6","short_pith_number":"pith:O6MUD4CB","schema_version":"1.0","canonical_sha256":"779941f041474dc10b011b3d8a8e97378573f0c1658aed662ae66092f0ae69a6","source":{"kind":"arxiv","id":"2006.08790","version":1},"attestation_state":"computed","paper":{"title":"FANOK: Knockoffs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre d'Aspremont, Armin Askari, Laurent El Ghaoui, Quentin Rebjock","submitted_at":"2020-06-15T21:55:34Z","abstract_excerpt":"We describe a series of algorithms that efficiently implement Gaussian model-X knockoffs to control the false discovery rate on large scale feature selection problems. Identifying the knockoff distribution requires solving a large scale semidefinite program for which we derive several efficient methods. One handles generic covariance matrices, has a complexity scaling as $O(p^3)$ where $p$ is the ambient dimension, while another assumes a rank $k$ factor model on the covariance matrix to reduce this complexity bound to $O(pk^2)$. We also derive efficient procedures to both estimate factor mode"},"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":"2006.08790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T21:55:34Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"2f21fff5c9482583db3fdd1991079cfddeeca55ebd659a23a830531ee54f1fc8","abstract_canon_sha256":"764f1de01180720f065923df6b7935b801fe18557ab62bd8a43cbab453e8acde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:43.046740Z","signature_b64":"vZci2SnMRIfnRF8NjqBleAXtl4vZ/hPIpGDuHM77C4J3P+dYtMj2eyjGDqNArwSsclo9FqltZsi2BEZnGFcFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"779941f041474dc10b011b3d8a8e97378573f0c1658aed662ae66092f0ae69a6","last_reissued_at":"2026-07-05T01:10:43.046393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:43.046393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FANOK: Knockoffs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre d'Aspremont, Armin Askari, Laurent El Ghaoui, Quentin Rebjock","submitted_at":"2020-06-15T21:55:34Z","abstract_excerpt":"We describe a series of algorithms that efficiently implement Gaussian model-X knockoffs to control the false discovery rate on large scale feature selection problems. Identifying the knockoff distribution requires solving a large scale semidefinite program for which we derive several efficient methods. One handles generic covariance matrices, has a complexity scaling as $O(p^3)$ where $p$ is the ambient dimension, while another assumes a rank $k$ factor model on the covariance matrix to reduce this complexity bound to $O(pk^2)$. We also derive efficient procedures to both estimate factor mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08790","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.08790/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":"2006.08790","created_at":"2026-07-05T01:10:43.046456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08790v1","created_at":"2026-07-05T01:10:43.046456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08790","created_at":"2026-07-05T01:10:43.046456+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6MUD4CBI5G4","created_at":"2026-07-05T01:10:43.046456+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6MUD4CBI5G4CCYB","created_at":"2026-07-05T01:10:43.046456+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6MUD4CB","created_at":"2026-07-05T01:10:43.046456+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/O6MUD4CBI5G4CCYBDM6YVDUXG6","json":"https://pith.science/pith/O6MUD4CBI5G4CCYBDM6YVDUXG6.json","graph_json":"https://pith.science/api/pith-number/O6MUD4CBI5G4CCYBDM6YVDUXG6/graph.json","events_json":"https://pith.science/api/pith-number/O6MUD4CBI5G4CCYBDM6YVDUXG6/events.json","paper":"https://pith.science/paper/O6MUD4CB"},"agent_actions":{"view_html":"https://pith.science/pith/O6MUD4CBI5G4CCYBDM6YVDUXG6","download_json":"https://pith.science/pith/O6MUD4CBI5G4CCYBDM6YVDUXG6.json","view_paper":"https://pith.science/paper/O6MUD4CB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08790&json=true","fetch_graph":"https://pith.science/api/pith-number/O6MUD4CBI5G4CCYBDM6YVDUXG6/graph.json","fetch_events":"https://pith.science/api/pith-number/O6MUD4CBI5G4CCYBDM6YVDUXG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6MUD4CBI5G4CCYBDM6YVDUXG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6MUD4CBI5G4CCYBDM6YVDUXG6/action/storage_attestation","attest_author":"https://pith.science/pith/O6MUD4CBI5G4CCYBDM6YVDUXG6/action/author_attestation","sign_citation":"https://pith.science/pith/O6MUD4CBI5G4CCYBDM6YVDUXG6/action/citation_signature","submit_replication":"https://pith.science/pith/O6MUD4CBI5G4CCYBDM6YVDUXG6/action/replication_record"}},"created_at":"2026-07-05T01:10:43.046456+00:00","updated_at":"2026-07-05T01:10:43.046456+00:00"}