{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:32YKIVFYEOL364RGO5PTPBLOZU","short_pith_number":"pith:32YKIVFY","canonical_record":{"source":{"id":"1710.09515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-26T02:39:29Z","cross_cats_sorted":[],"title_canon_sha256":"d01e676fda51a1695858fee7906c124f27941b5c38ec7155d650fa8d4e576fc7","abstract_canon_sha256":"0963c3aad1acdcf4b1725a684cb792a47146e1ef2f7f5305c461873d2bb48c1b"},"schema_version":"1.0"},"canonical_sha256":"deb0a454b82397bf7226775f37856ecd36ca91dcdf328bedca8260df60d94a9f","source":{"kind":"arxiv","id":"1710.09515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09515","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09515v1","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09515","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"32YKIVFYEOL3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"32YKIVFYEOL364RG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"32YKIVFY","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:32YKIVFYEOL364RGO5PTPBLOZU","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-26T02:39:29Z","cross_cats_sorted":[],"title_canon_sha256":"d01e676fda51a1695858fee7906c124f27941b5c38ec7155d650fa8d4e576fc7","abstract_canon_sha256":"0963c3aad1acdcf4b1725a684cb792a47146e1ef2f7f5305c461873d2bb48c1b"},"schema_version":"1.0"},"canonical_sha256":"deb0a454b82397bf7226775f37856ecd36ca91dcdf328bedca8260df60d94a9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:59.220530Z","signature_b64":"gLSGus1ODks7aiaXM6qb2Sfs6oiflRjMqxSEVdr9NDtTwdZ5dwuZBCVizxzlpDXSWjOwQR/quJj+pv5q8TKTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deb0a454b82397bf7226775f37856ecd36ca91dcdf328bedca8260df60d94a9f","last_reissued_at":"2026-05-18T00:31:59.220046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:59.220046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09515","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:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXe9oGZ2LkO+kqjn1/vMi/wh0aZFAi/ULjrvDvVUeqPNZBPLd7Kb075FXA4q/DGPfYo7NZncui4DbhfDSdVEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:40:34.838810Z"},"content_sha256":"3450d2e683af65837e02e16eedbcb1a979c1d0a45ec4268c3bd745477fbbc38f","schema_version":"1.0","event_id":"sha256:3450d2e683af65837e02e16eedbcb1a979c1d0a45ec4268c3bd745477fbbc38f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:32YKIVFYEOL364RGO5PTPBLOZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Soft Methodology for Cost-and-error Sensitive Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chi-Hung Lin, Da-Wei Wang, Hsuan-Tien Lin, Te-Kang Jan","submitted_at":"2017-10-26T02:39:29Z","abstract_excerpt":"Many real-world data mining applications need varying cost for different types of classification errors and thus call for cost-sensitive classification algorithms. Existing algorithms for cost-sensitive classification are successful in terms of minimizing the cost, but can result in a high error rate as the trade-off. The high error rate holds back the practical use of those algorithms. In this paper, we propose a novel cost-sensitive classification methodology that takes both the cost and the error rate into account. The methodology, called soft cost-sensitive classification, is established f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09515","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:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKxSoEkcKzDmvgJPup5bzH5iWYhYaxgVefi4yO+een6Q29prJqYd0uXn9SMvI9/KwKxMHK/8ekIymGDjgArJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:40:34.839186Z"},"content_sha256":"f667ec1912b77a87b660666a50042931fc176fd774484b7a31b5244cdf2674c4","schema_version":"1.0","event_id":"sha256:f667ec1912b77a87b660666a50042931fc176fd774484b7a31b5244cdf2674c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32YKIVFYEOL364RGO5PTPBLOZU/bundle.json","state_url":"https://pith.science/pith/32YKIVFYEOL364RGO5PTPBLOZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32YKIVFYEOL364RGO5PTPBLOZU/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-25T23:40:34Z","links":{"resolver":"https://pith.science/pith/32YKIVFYEOL364RGO5PTPBLOZU","bundle":"https://pith.science/pith/32YKIVFYEOL364RGO5PTPBLOZU/bundle.json","state":"https://pith.science/pith/32YKIVFYEOL364RGO5PTPBLOZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32YKIVFYEOL364RGO5PTPBLOZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:32YKIVFYEOL364RGO5PTPBLOZU","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":"0963c3aad1acdcf4b1725a684cb792a47146e1ef2f7f5305c461873d2bb48c1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-26T02:39:29Z","title_canon_sha256":"d01e676fda51a1695858fee7906c124f27941b5c38ec7155d650fa8d4e576fc7"},"schema_version":"1.0","source":{"id":"1710.09515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09515","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09515v1","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09515","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"32YKIVFYEOL3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"32YKIVFYEOL364RG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"32YKIVFY","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:f667ec1912b77a87b660666a50042931fc176fd774484b7a31b5244cdf2674c4","target":"graph","created_at":"2026-05-18T00:31:59Z","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":"Many real-world data mining applications need varying cost for different types of classification errors and thus call for cost-sensitive classification algorithms. Existing algorithms for cost-sensitive classification are successful in terms of minimizing the cost, but can result in a high error rate as the trade-off. The high error rate holds back the practical use of those algorithms. In this paper, we propose a novel cost-sensitive classification methodology that takes both the cost and the error rate into account. The methodology, called soft cost-sensitive classification, is established f","authors_text":"Chi-Hung Lin, Da-Wei Wang, Hsuan-Tien Lin, Te-Kang Jan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-26T02:39:29Z","title":"Soft Methodology for Cost-and-error Sensitive Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09515","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:3450d2e683af65837e02e16eedbcb1a979c1d0a45ec4268c3bd745477fbbc38f","target":"record","created_at":"2026-05-18T00:31:59Z","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":"0963c3aad1acdcf4b1725a684cb792a47146e1ef2f7f5305c461873d2bb48c1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-26T02:39:29Z","title_canon_sha256":"d01e676fda51a1695858fee7906c124f27941b5c38ec7155d650fa8d4e576fc7"},"schema_version":"1.0","source":{"id":"1710.09515","kind":"arxiv","version":1}},"canonical_sha256":"deb0a454b82397bf7226775f37856ecd36ca91dcdf328bedca8260df60d94a9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deb0a454b82397bf7226775f37856ecd36ca91dcdf328bedca8260df60d94a9f","first_computed_at":"2026-05-18T00:31:59.220046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:59.220046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gLSGus1ODks7aiaXM6qb2Sfs6oiflRjMqxSEVdr9NDtTwdZ5dwuZBCVizxzlpDXSWjOwQR/quJj+pv5q8TKTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:59.220530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3450d2e683af65837e02e16eedbcb1a979c1d0a45ec4268c3bd745477fbbc38f","sha256:f667ec1912b77a87b660666a50042931fc176fd774484b7a31b5244cdf2674c4"],"state_sha256":"fc60853e8fb78a723ed6ee4d5f09f4b4d06f3d96345793332db93d0ab1a3662c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8Oa0fvAxQs6tfQfutVpmxum2IEVw/Uv/poB9O/JV5yd27zZq9mFCB23YxNyNJU9FyugjC/eInwufIdwUgCVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:40:34.841756Z","bundle_sha256":"4943ddb926bb3570cdb5a931c6046e2fcef46f7278fec77cfaccea4ecb37e2f1"}}