{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W4O5BABNZKOUOITYBUQTY3R632","short_pith_number":"pith:W4O5BABN","schema_version":"1.0","canonical_sha256":"b71dd0802dca9d4722780d213c6e3ede95026b3945562e375f212b2a78843752","source":{"kind":"arxiv","id":"1610.05108","version":4},"attestation_state":"computed","paper":{"title":"The xyz algorithm for fast interaction search in high-dimensional data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Gian-Andrea Thanei, Nicolai Meinshausen, Rajen D. Shah","submitted_at":"2016-10-17T13:42:22Z","abstract_excerpt":"When performing regression on a dataset with $p$ variables, it is often of interest to go beyond using main linear effects and include interactions as products between individual variables. For small-scale problems, these interactions can be computed explicitly but this leads to a computational complexity of at least $\\mathcal{O}(p^2)$ if done naively. This cost can be prohibitive if $p$ is very large. We introduce a new randomised algorithm that is able to discover interactions with high probability and under mild conditions has a runtime that is subquadratic in $p$. We show that strong inter"},"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":"1610.05108","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-17T13:42:22Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"1354c4670f0c2394aae81e17b0b79e78cacff303642b774e2778e186f29b6d2e","abstract_canon_sha256":"b82095d5daedde53f1691a989bfe4e4914479c1d4ca400931fdc7d6714f8a345"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:34.660977Z","signature_b64":"XacyCJA7yxzA+nXn4IkiX0FgnIGoztT9YgjQ776cxffRwuKuFQcVyQ0i7vo0e6hYVyK0m0nBbjTlScThQB/CAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b71dd0802dca9d4722780d213c6e3ede95026b3945562e375f212b2a78843752","last_reissued_at":"2026-05-18T00:05:34.660427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:34.660427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The xyz algorithm for fast interaction search in high-dimensional data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Gian-Andrea Thanei, Nicolai Meinshausen, Rajen D. Shah","submitted_at":"2016-10-17T13:42:22Z","abstract_excerpt":"When performing regression on a dataset with $p$ variables, it is often of interest to go beyond using main linear effects and include interactions as products between individual variables. For small-scale problems, these interactions can be computed explicitly but this leads to a computational complexity of at least $\\mathcal{O}(p^2)$ if done naively. This cost can be prohibitive if $p$ is very large. We introduce a new randomised algorithm that is able to discover interactions with high probability and under mild conditions has a runtime that is subquadratic in $p$. We show that strong inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05108","kind":"arxiv","version":4},"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":"1610.05108","created_at":"2026-05-18T00:05:34.660499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05108v4","created_at":"2026-05-18T00:05:34.660499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05108","created_at":"2026-05-18T00:05:34.660499+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4O5BABNZKOU","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4O5BABNZKOUOITY","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4O5BABN","created_at":"2026-05-18T12:30:48.956258+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/W4O5BABNZKOUOITYBUQTY3R632","json":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632.json","graph_json":"https://pith.science/api/pith-number/W4O5BABNZKOUOITYBUQTY3R632/graph.json","events_json":"https://pith.science/api/pith-number/W4O5BABNZKOUOITYBUQTY3R632/events.json","paper":"https://pith.science/paper/W4O5BABN"},"agent_actions":{"view_html":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632","download_json":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632.json","view_paper":"https://pith.science/paper/W4O5BABN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05108&json=true","fetch_graph":"https://pith.science/api/pith-number/W4O5BABNZKOUOITYBUQTY3R632/graph.json","fetch_events":"https://pith.science/api/pith-number/W4O5BABNZKOUOITYBUQTY3R632/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/action/storage_attestation","attest_author":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/action/author_attestation","sign_citation":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/action/citation_signature","submit_replication":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/action/replication_record"}},"created_at":"2026-05-18T00:05:34.660499+00:00","updated_at":"2026-05-18T00:05:34.660499+00:00"}