{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:S3X7BMLXC6O7USZLIUXGTIRZRW","short_pith_number":"pith:S3X7BMLX","schema_version":"1.0","canonical_sha256":"96eff0b177179dfa4b2b452e69a2398db299726b9096594e75118ac4dee0ae0d","source":{"kind":"arxiv","id":"1301.2267","version":1},"attestation_state":"computed","paper":{"title":"Efficient Stepwise Selection in Decomposable Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Amol Deshpande, Michael I. Jordan, Minos Garofalakis","submitted_at":"2013-01-10T16:23:22Z","abstract_excerpt":"In this paper, we present an efficient way of performing stepwise selection in the class of decomposable models. The main contribution of the paper is a simple characterization of the edges that canbe added to a decomposable model while keeping the resulting model decomposable and an efficient algorithm for enumerating all such edges for a given model in essentially O(1) time per edge. We also discuss how backward selection can be performed efficiently using our data structures.We also analyze the complexity of the complete stepwise selection procedure, including the complexity of choosing whi"},"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":"1301.2267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:23:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"af5010be4b146af355f9136c910f67084f5b609864c6ca44059b7fc611cf14a8","abstract_canon_sha256":"0055c466295c719df6d6429f9e6c73c2d533751f26f830fe7f0f63719ccd1601"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.747202Z","signature_b64":"TPIRHOcf9it/OeZ5r4jGau5dTe9GK8FX0kOrlzed9SZOzaOShUXaMVOOg+hdpTI7UaVLFpVi9aRAfmV5Xk+gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96eff0b177179dfa4b2b452e69a2398db299726b9096594e75118ac4dee0ae0d","last_reissued_at":"2026-05-18T03:36:45.746587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.746587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Stepwise Selection in Decomposable Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Amol Deshpande, Michael I. Jordan, Minos Garofalakis","submitted_at":"2013-01-10T16:23:22Z","abstract_excerpt":"In this paper, we present an efficient way of performing stepwise selection in the class of decomposable models. The main contribution of the paper is a simple characterization of the edges that canbe added to a decomposable model while keeping the resulting model decomposable and an efficient algorithm for enumerating all such edges for a given model in essentially O(1) time per edge. We also discuss how backward selection can be performed efficiently using our data structures.We also analyze the complexity of the complete stepwise selection procedure, including the complexity of choosing whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2267","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.2267","created_at":"2026-05-18T03:36:45.746678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2267v1","created_at":"2026-05-18T03:36:45.746678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2267","created_at":"2026-05-18T03:36:45.746678+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3X7BMLXC6O7","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3X7BMLXC6O7USZL","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3X7BMLX","created_at":"2026-05-18T12:27:59.945178+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/S3X7BMLXC6O7USZLIUXGTIRZRW","json":"https://pith.science/pith/S3X7BMLXC6O7USZLIUXGTIRZRW.json","graph_json":"https://pith.science/api/pith-number/S3X7BMLXC6O7USZLIUXGTIRZRW/graph.json","events_json":"https://pith.science/api/pith-number/S3X7BMLXC6O7USZLIUXGTIRZRW/events.json","paper":"https://pith.science/paper/S3X7BMLX"},"agent_actions":{"view_html":"https://pith.science/pith/S3X7BMLXC6O7USZLIUXGTIRZRW","download_json":"https://pith.science/pith/S3X7BMLXC6O7USZLIUXGTIRZRW.json","view_paper":"https://pith.science/paper/S3X7BMLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2267&json=true","fetch_graph":"https://pith.science/api/pith-number/S3X7BMLXC6O7USZLIUXGTIRZRW/graph.json","fetch_events":"https://pith.science/api/pith-number/S3X7BMLXC6O7USZLIUXGTIRZRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3X7BMLXC6O7USZLIUXGTIRZRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3X7BMLXC6O7USZLIUXGTIRZRW/action/storage_attestation","attest_author":"https://pith.science/pith/S3X7BMLXC6O7USZLIUXGTIRZRW/action/author_attestation","sign_citation":"https://pith.science/pith/S3X7BMLXC6O7USZLIUXGTIRZRW/action/citation_signature","submit_replication":"https://pith.science/pith/S3X7BMLXC6O7USZLIUXGTIRZRW/action/replication_record"}},"created_at":"2026-05-18T03:36:45.746678+00:00","updated_at":"2026-05-18T03:36:45.746678+00:00"}