{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C7EKRSWEDN2FF4S23TPWDJE6DJ","short_pith_number":"pith:C7EKRSWE","canonical_record":{"source":{"id":"1611.03227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-10T09:08:41Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"a3abdf8f795f2aee4527895ae6d19a6c25cf201c1a77212a3a67d95cce4f4b8a","abstract_canon_sha256":"04116c96e48e01fff14d3f89519137b0d0ae1aa7973a9f00532e1b67560c30b9"},"schema_version":"1.0"},"canonical_sha256":"17c8a8cac41b7452f25adcdf61a49e1a4402c502983f34d5572b8aa6ac3568ad","source":{"kind":"arxiv","id":"1611.03227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03227","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03227v1","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03227","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"C7EKRSWEDN2F","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7EKRSWEDN2FF4S2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7EKRSWE","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C7EKRSWEDN2FF4S23TPWDJE6DJ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-10T09:08:41Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"a3abdf8f795f2aee4527895ae6d19a6c25cf201c1a77212a3a67d95cce4f4b8a","abstract_canon_sha256":"04116c96e48e01fff14d3f89519137b0d0ae1aa7973a9f00532e1b67560c30b9"},"schema_version":"1.0"},"canonical_sha256":"17c8a8cac41b7452f25adcdf61a49e1a4402c502983f34d5572b8aa6ac3568ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:40.920622Z","signature_b64":"XSHG5nu1c3pRF4O7Cb7/x+RLqZ+3TSSCBCm07TqXW5oj/1Fh2SRU09JAfXqlJ9V1Ui5Jhtx/zwki5AkqazddAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17c8a8cac41b7452f25adcdf61a49e1a4402c502983f34d5572b8aa6ac3568ad","last_reissued_at":"2026-05-18T00:59:40.919707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:40.919707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03227","source_version":1,"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:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5ATs12wfEwZTdPajyx4CobTa414fm4A/CFt443msx8KkYoav+iSeWCbuVo7haY8sMMxnRSHZALOrNcYdt1sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:36:35.012127Z"},"content_sha256":"a2d7c134c1a476fee364d6e92e598dae4ed0d05637614ff6bfa01c2511214fab","schema_version":"1.0","event_id":"sha256:a2d7c134c1a476fee364d6e92e598dae4ed0d05637614ff6bfa01c2511214fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C7EKRSWEDN2FF4S23TPWDJE6DJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature Selection with the R Package MXM: Discovering Statistically-Equivalent Feature Subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"stat.ML","authors_text":"Alessio Farcomeni, Giorgos Athineou, Ioannis Tsamardinos, Michail Tsagris, Vincenzo Lagani","submitted_at":"2016-11-10T09:08:41Z","abstract_excerpt":"The statistically equivalent signature (SES) algorithm is a method for feature selection inspired by the principles of constrained-based learning of Bayesian Networks. Most of the currently available feature-selection methods return only a single subset of features, supposedly the one with the highest predictive power. We argue that in several domains multiple subsets can achieve close to maximal predictive accuracy, and that arbitrarily providing only one has several drawbacks. The SES method attempts to identify multiple, predictive feature subsets whose performances are statistically equiva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03227","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":""},"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:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0sh6KYF6Z91rzzcQbUdgh4Yepu5j2M2Y4ESvzyfSWjo1AaN6AZDorFJ8/fc0/1kA9IMJNL4iRbjESl/9kFGlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:36:35.012484Z"},"content_sha256":"3c4da0c60d81e65733d4a7a4330b012983c7a11ec10c1e1956af2f4e1df20823","schema_version":"1.0","event_id":"sha256:3c4da0c60d81e65733d4a7a4330b012983c7a11ec10c1e1956af2f4e1df20823"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7EKRSWEDN2FF4S23TPWDJE6DJ/bundle.json","state_url":"https://pith.science/pith/C7EKRSWEDN2FF4S23TPWDJE6DJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7EKRSWEDN2FF4S23TPWDJE6DJ/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-06-24T04:36:35Z","links":{"resolver":"https://pith.science/pith/C7EKRSWEDN2FF4S23TPWDJE6DJ","bundle":"https://pith.science/pith/C7EKRSWEDN2FF4S23TPWDJE6DJ/bundle.json","state":"https://pith.science/pith/C7EKRSWEDN2FF4S23TPWDJE6DJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7EKRSWEDN2FF4S23TPWDJE6DJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C7EKRSWEDN2FF4S23TPWDJE6DJ","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":"04116c96e48e01fff14d3f89519137b0d0ae1aa7973a9f00532e1b67560c30b9","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-10T09:08:41Z","title_canon_sha256":"a3abdf8f795f2aee4527895ae6d19a6c25cf201c1a77212a3a67d95cce4f4b8a"},"schema_version":"1.0","source":{"id":"1611.03227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03227","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03227v1","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03227","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"C7EKRSWEDN2F","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7EKRSWEDN2FF4S2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7EKRSWE","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:3c4da0c60d81e65733d4a7a4330b012983c7a11ec10c1e1956af2f4e1df20823","target":"graph","created_at":"2026-05-18T00:59:40Z","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":"The statistically equivalent signature (SES) algorithm is a method for feature selection inspired by the principles of constrained-based learning of Bayesian Networks. Most of the currently available feature-selection methods return only a single subset of features, supposedly the one with the highest predictive power. We argue that in several domains multiple subsets can achieve close to maximal predictive accuracy, and that arbitrarily providing only one has several drawbacks. The SES method attempts to identify multiple, predictive feature subsets whose performances are statistically equiva","authors_text":"Alessio Farcomeni, Giorgos Athineou, Ioannis Tsamardinos, Michail Tsagris, Vincenzo Lagani","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-10T09:08:41Z","title":"Feature Selection with the R Package MXM: Discovering Statistically-Equivalent Feature Subsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03227","kind":"arxiv","version":1},"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:a2d7c134c1a476fee364d6e92e598dae4ed0d05637614ff6bfa01c2511214fab","target":"record","created_at":"2026-05-18T00:59:40Z","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":"04116c96e48e01fff14d3f89519137b0d0ae1aa7973a9f00532e1b67560c30b9","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-10T09:08:41Z","title_canon_sha256":"a3abdf8f795f2aee4527895ae6d19a6c25cf201c1a77212a3a67d95cce4f4b8a"},"schema_version":"1.0","source":{"id":"1611.03227","kind":"arxiv","version":1}},"canonical_sha256":"17c8a8cac41b7452f25adcdf61a49e1a4402c502983f34d5572b8aa6ac3568ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17c8a8cac41b7452f25adcdf61a49e1a4402c502983f34d5572b8aa6ac3568ad","first_computed_at":"2026-05-18T00:59:40.919707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:40.919707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XSHG5nu1c3pRF4O7Cb7/x+RLqZ+3TSSCBCm07TqXW5oj/1Fh2SRU09JAfXqlJ9V1Ui5Jhtx/zwki5AkqazddAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:40.920622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2d7c134c1a476fee364d6e92e598dae4ed0d05637614ff6bfa01c2511214fab","sha256:3c4da0c60d81e65733d4a7a4330b012983c7a11ec10c1e1956af2f4e1df20823"],"state_sha256":"071ecceeb788c56064cb62c920ba9c0b67b48fa6d72cba86f846ba242da6a539"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3v5M2qtZrMkWmFmuLPCqq+Y9fAygLwyd9dbBVxC9+k652lNaQ+jURoj6WJJ7WlvItUiajssQhC2wI5Blb3gBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:36:35.014398Z","bundle_sha256":"b5ab5d03fe5559b202c4d2b7984d4be13290c50c0664835bb3b6a7a3614e8c5a"}}