{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:E2PNLHU257RGHHHUFJHVSVRZCC","short_pith_number":"pith:E2PNLHU2","canonical_record":{"source":{"id":"1209.5601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-25T13:21:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4892e6c3b4e99b841f54c2eed95b8b17ce9c255f1d5d2d3743222dbb8dd0e418","abstract_canon_sha256":"bcc48285bbcaedafe354dd44d5c690fc12b0ea2aa696a3df063eebe196b90c15"},"schema_version":"1.0"},"canonical_sha256":"269ed59e9aefe2639cf42a4f5956391081baf7d63e807d9d7f7bc67d381b7b42","source":{"kind":"arxiv","id":"1209.5601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5601","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5601v1","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5601","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"E2PNLHU257RG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E2PNLHU257RGHHHU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E2PNLHU2","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:E2PNLHU257RGHHHUFJHVSVRZCC","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-25T13:21:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4892e6c3b4e99b841f54c2eed95b8b17ce9c255f1d5d2d3743222dbb8dd0e418","abstract_canon_sha256":"bcc48285bbcaedafe354dd44d5c690fc12b0ea2aa696a3df063eebe196b90c15"},"schema_version":"1.0"},"canonical_sha256":"269ed59e9aefe2639cf42a4f5956391081baf7d63e807d9d7f7bc67d381b7b42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:16.160504Z","signature_b64":"FodnvIKNLjaB8eoXJGz4/m2Ghm7W3pkwds5p2ox0kikfScVEVVHu7jk3CuQsptH1SS6IRAh+WsN9upmu/Vm9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"269ed59e9aefe2639cf42a4f5956391081baf7d63e807d9d7f7bc67d381b7b42","last_reissued_at":"2026-05-18T03:25:16.159884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:16.159884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5601","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-18T03:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4WeWksURGcbuvqvIInk+V8s49ahUh5BcfS6DxWy9vndDIQrPW501yPqYwcz5GV1Xcda6V+D0F9+vTLu+wrbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:29:23.802087Z"},"content_sha256":"623f08c7a9f4ea3d285444732019564e9083140b8e1aadb7900c2511a21b3575","schema_version":"1.0","event_id":"sha256:623f08c7a9f4ea3d285444732019564e9083140b8e1aadb7900c2511a21b3575"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:E2PNLHU257RGHHHUFJHVSVRZCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature selection with test cost constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Fan Min, Qinghua Hu, William Zhu","submitted_at":"2012-09-25T13:21:40Z","abstract_excerpt":"Feature selection is an important preprocessing step in machine learning and data mining. In real-world applications, costs, including money, time and other resources, are required to acquire the features. In some cases, there is a test cost constraint due to limited resources. We shall deliberately select an informative and cheap feature subset for classification. This paper proposes the feature selection with test cost constraint problem for this issue. The new problem has a simple form while described as a constraint satisfaction problem (CSP). Backtracking is a general algorithm for CSP, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5601","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-18T03:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ff/0pjVcpz+Kd9dBo8pKRmW34hBaq1qRpxtTJH7wdqeOnxcxKA+oZJbxzGLFIpZ4ExrduFrAv5+iPNEt9FY9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:29:23.802448Z"},"content_sha256":"0fd4bcfed5cd4ec0ea6e6d953e0f9a1732032b44a308e0374f7af8707cff4041","schema_version":"1.0","event_id":"sha256:0fd4bcfed5cd4ec0ea6e6d953e0f9a1732032b44a308e0374f7af8707cff4041"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2PNLHU257RGHHHUFJHVSVRZCC/bundle.json","state_url":"https://pith.science/pith/E2PNLHU257RGHHHUFJHVSVRZCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2PNLHU257RGHHHUFJHVSVRZCC/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-05T09:29:23Z","links":{"resolver":"https://pith.science/pith/E2PNLHU257RGHHHUFJHVSVRZCC","bundle":"https://pith.science/pith/E2PNLHU257RGHHHUFJHVSVRZCC/bundle.json","state":"https://pith.science/pith/E2PNLHU257RGHHHUFJHVSVRZCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2PNLHU257RGHHHUFJHVSVRZCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E2PNLHU257RGHHHUFJHVSVRZCC","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":"bcc48285bbcaedafe354dd44d5c690fc12b0ea2aa696a3df063eebe196b90c15","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-25T13:21:40Z","title_canon_sha256":"4892e6c3b4e99b841f54c2eed95b8b17ce9c255f1d5d2d3743222dbb8dd0e418"},"schema_version":"1.0","source":{"id":"1209.5601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5601","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5601v1","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5601","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"E2PNLHU257RG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E2PNLHU257RGHHHU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E2PNLHU2","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:0fd4bcfed5cd4ec0ea6e6d953e0f9a1732032b44a308e0374f7af8707cff4041","target":"graph","created_at":"2026-05-18T03:25:16Z","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":"Feature selection is an important preprocessing step in machine learning and data mining. In real-world applications, costs, including money, time and other resources, are required to acquire the features. In some cases, there is a test cost constraint due to limited resources. We shall deliberately select an informative and cheap feature subset for classification. This paper proposes the feature selection with test cost constraint problem for this issue. The new problem has a simple form while described as a constraint satisfaction problem (CSP). Backtracking is a general algorithm for CSP, a","authors_text":"Fan Min, Qinghua Hu, William Zhu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-25T13:21:40Z","title":"Feature selection with test cost constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5601","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:623f08c7a9f4ea3d285444732019564e9083140b8e1aadb7900c2511a21b3575","target":"record","created_at":"2026-05-18T03:25:16Z","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":"bcc48285bbcaedafe354dd44d5c690fc12b0ea2aa696a3df063eebe196b90c15","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-25T13:21:40Z","title_canon_sha256":"4892e6c3b4e99b841f54c2eed95b8b17ce9c255f1d5d2d3743222dbb8dd0e418"},"schema_version":"1.0","source":{"id":"1209.5601","kind":"arxiv","version":1}},"canonical_sha256":"269ed59e9aefe2639cf42a4f5956391081baf7d63e807d9d7f7bc67d381b7b42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"269ed59e9aefe2639cf42a4f5956391081baf7d63e807d9d7f7bc67d381b7b42","first_computed_at":"2026-05-18T03:25:16.159884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:16.159884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FodnvIKNLjaB8eoXJGz4/m2Ghm7W3pkwds5p2ox0kikfScVEVVHu7jk3CuQsptH1SS6IRAh+WsN9upmu/Vm9CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:16.160504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:623f08c7a9f4ea3d285444732019564e9083140b8e1aadb7900c2511a21b3575","sha256:0fd4bcfed5cd4ec0ea6e6d953e0f9a1732032b44a308e0374f7af8707cff4041"],"state_sha256":"0f71a24eb4ecdda62f4c74e4e1ae672536109f45bdc014ae840a10443db31076"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gd8bO6VwKMT5xIhX/8afioqLcksQkhzSDr9PAPU5aZWDi0sGgXSq0Ks3i+IrsLR9f2pkO0B3u7C9ofSuQxPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:29:23.804449Z","bundle_sha256":"0ab81dc2e8506212b44d5344e0db94d066d60f20515ec80151521d17234409bd"}}