{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W4O5BABNZKOUOITYBUQTY3R632","short_pith_number":"pith:W4O5BABN","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"},"canonical_sha256":"b71dd0802dca9d4722780d213c6e3ede95026b3945562e375f212b2a78843752","source":{"kind":"arxiv","id":"1610.05108","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05108","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05108v4","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05108","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"W4O5BABNZKOU","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W4O5BABNZKOUOITY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W4O5BABN","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W4O5BABNZKOUOITYBUQTY3R632","target":"record","payload":{"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"},"canonical_sha256":"b71dd0802dca9d4722780d213c6e3ede95026b3945562e375f212b2a78843752","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"},"source_kind":"arxiv","source_id":"1610.05108","source_version":4,"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-18T00:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlZAYRkdy/VYPu2s7ZX//p1h5+XbhZPKK1cXz+ifYs7cYkU7BAC5R0Rz7ZkvB+snbhqD9xPYoaePthcC1P9pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:00:59.691050Z"},"content_sha256":"37b3848f557a6d27904b2c3fc732b49c92ca76d690b0f5a1f425f632515c949a","schema_version":"1.0","event_id":"sha256:37b3848f557a6d27904b2c3fc732b49c92ca76d690b0f5a1f425f632515c949a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W4O5BABNZKOUOITYBUQTY3R632","target":"graph","payload":{"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"},"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-18T00:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEMcqhc18f6kRn5pf08EPR1sayipQ5nKTnfl7xoM+j9Oct1actrjEtbo0hVrMnZ2L2EGtynks/1Omk7rR6PZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:00:59.691757Z"},"content_sha256":"f32b46dcda17d3fda7e58d5a9880576752726ae6677ee579c66a7af9d6ec97ff","schema_version":"1.0","event_id":"sha256:f32b46dcda17d3fda7e58d5a9880576752726ae6677ee579c66a7af9d6ec97ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/bundle.json","state_url":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4O5BABNZKOUOITYBUQTY3R632/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-05-29T16:00:59Z","links":{"resolver":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632","bundle":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/bundle.json","state":"https://pith.science/pith/W4O5BABNZKOUOITYBUQTY3R632/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4O5BABNZKOUOITYBUQTY3R632/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W4O5BABNZKOUOITYBUQTY3R632","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":"b82095d5daedde53f1691a989bfe4e4914479c1d4ca400931fdc7d6714f8a345","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-17T13:42:22Z","title_canon_sha256":"1354c4670f0c2394aae81e17b0b79e78cacff303642b774e2778e186f29b6d2e"},"schema_version":"1.0","source":{"id":"1610.05108","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05108","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05108v4","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05108","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"W4O5BABNZKOU","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W4O5BABNZKOUOITY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W4O5BABN","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:f32b46dcda17d3fda7e58d5a9880576752726ae6677ee579c66a7af9d6ec97ff","target":"graph","created_at":"2026-05-18T00:05:34Z","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":"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","authors_text":"Gian-Andrea Thanei, Nicolai Meinshausen, Rajen D. Shah","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-17T13:42:22Z","title":"The xyz algorithm for fast interaction search in high-dimensional data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05108","kind":"arxiv","version":4},"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:37b3848f557a6d27904b2c3fc732b49c92ca76d690b0f5a1f425f632515c949a","target":"record","created_at":"2026-05-18T00:05:34Z","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":"b82095d5daedde53f1691a989bfe4e4914479c1d4ca400931fdc7d6714f8a345","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-17T13:42:22Z","title_canon_sha256":"1354c4670f0c2394aae81e17b0b79e78cacff303642b774e2778e186f29b6d2e"},"schema_version":"1.0","source":{"id":"1610.05108","kind":"arxiv","version":4}},"canonical_sha256":"b71dd0802dca9d4722780d213c6e3ede95026b3945562e375f212b2a78843752","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b71dd0802dca9d4722780d213c6e3ede95026b3945562e375f212b2a78843752","first_computed_at":"2026-05-18T00:05:34.660427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:34.660427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XacyCJA7yxzA+nXn4IkiX0FgnIGoztT9YgjQ776cxffRwuKuFQcVyQ0i7vo0e6hYVyK0m0nBbjTlScThQB/CAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:34.660977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05108","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37b3848f557a6d27904b2c3fc732b49c92ca76d690b0f5a1f425f632515c949a","sha256:f32b46dcda17d3fda7e58d5a9880576752726ae6677ee579c66a7af9d6ec97ff"],"state_sha256":"3153b30e98e9775b5181cc4707feccdbe7f614fd695245064b8b76e50a0a88de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBO4lFWsClRE7fQdTv3OE3Gc5XGvQVhItH0Ow1kXULs2zMElUVmdaPRGTH1ijdO6ooGMJGs+JezAtmb59/n8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:00:59.695621Z","bundle_sha256":"7f3909fa05b7261da5131423535084ef2d8f767edad6e8d7394e28296582cb9e"}}