{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VIOFBDJYH7I2LN3YOHICTX6JFW","short_pith_number":"pith:VIOFBDJY","canonical_record":{"source":{"id":"1205.0406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-02T12:38:11Z","cross_cats_sorted":[],"title_canon_sha256":"1ee699c1dd9a6c5de58f1f56ddbc164fe0423638cb8b620bcc95479bab0f78a7","abstract_canon_sha256":"341b2c79ed21aa5df1791de633bbd989f51128178410e2176ea8e432ad57ef64"},"schema_version":"1.0"},"canonical_sha256":"aa1c508d383fd1a5b77871d029dfc92db74dce32e095464ddb8fc9b6ae0093e5","source":{"kind":"arxiv","id":"1205.0406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0406","created_at":"2026-05-18T03:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0406v1","created_at":"2026-05-18T03:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0406","created_at":"2026-05-18T03:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"VIOFBDJYH7I2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VIOFBDJYH7I2LN3Y","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VIOFBDJY","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VIOFBDJYH7I2LN3YOHICTX6JFW","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-02T12:38:11Z","cross_cats_sorted":[],"title_canon_sha256":"1ee699c1dd9a6c5de58f1f56ddbc164fe0423638cb8b620bcc95479bab0f78a7","abstract_canon_sha256":"341b2c79ed21aa5df1791de633bbd989f51128178410e2176ea8e432ad57ef64"},"schema_version":"1.0"},"canonical_sha256":"aa1c508d383fd1a5b77871d029dfc92db74dce32e095464ddb8fc9b6ae0093e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:34.613587Z","signature_b64":"rKsTzE3ukxpKuh3wLbSnrfWmplfw+//Jpcf8Dd8dgKbLwCs0WWs0x57nriNegyPf191WmdSEh3su9KW36allBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa1c508d383fd1a5b77871d029dfc92db74dce32e095464ddb8fc9b6ae0093e5","last_reissued_at":"2026-05-18T03:56:34.613157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:34.613157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0406","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:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGhSpFZUOwZxWZcBVIrhCYAP/yhDw7BseARcb/6JdwMy3DO6PnRQwYY0Ymfn9abkFpagmb/c/UUnKMCP+tsNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:07:23.489426Z"},"content_sha256":"0c56b4aad17b3ab918a66432c9a47d1889435d1269b609687cbfec1232314f88","schema_version":"1.0","event_id":"sha256:0c56b4aad17b3ab918a66432c9a47d1889435d1269b609687cbfec1232314f88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VIOFBDJYH7I2LN3YOHICTX6JFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Classifier for Uncertain Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ke Tang, Rui Wang","submitted_at":"2012-05-02T12:38:11Z","abstract_excerpt":"Many studies on the cost-sensitive learning assumed that a unique cost matrix is known for a problem. However, this assumption may not hold for many real-world problems. For example, a classifier might need to be applied in several circumstances, each of which associates with a different cost matrix. Or, different human experts have different opinions about the costs for a given problem. Motivated by these facts, this study aims to seek the minimax classifier over multiple cost matrices. In summary, we theoretically proved that, no matter how many cost matrices are involved, the minimax proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0406","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:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAjzPOzrIyLSZW95R7OOf+8lXUDEg4wDOUXrwhnXZqai5fhs8c1SnieDKCaaWOoLXrGFuLr8XRsFUG0H/6GCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:07:23.489780Z"},"content_sha256":"7df498a19b3f62e2a5915687bd75fcfd7ed29406bd33b98732d93758fcd62ae0","schema_version":"1.0","event_id":"sha256:7df498a19b3f62e2a5915687bd75fcfd7ed29406bd33b98732d93758fcd62ae0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIOFBDJYH7I2LN3YOHICTX6JFW/bundle.json","state_url":"https://pith.science/pith/VIOFBDJYH7I2LN3YOHICTX6JFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIOFBDJYH7I2LN3YOHICTX6JFW/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-01T03:07:23Z","links":{"resolver":"https://pith.science/pith/VIOFBDJYH7I2LN3YOHICTX6JFW","bundle":"https://pith.science/pith/VIOFBDJYH7I2LN3YOHICTX6JFW/bundle.json","state":"https://pith.science/pith/VIOFBDJYH7I2LN3YOHICTX6JFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIOFBDJYH7I2LN3YOHICTX6JFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VIOFBDJYH7I2LN3YOHICTX6JFW","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":"341b2c79ed21aa5df1791de633bbd989f51128178410e2176ea8e432ad57ef64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-02T12:38:11Z","title_canon_sha256":"1ee699c1dd9a6c5de58f1f56ddbc164fe0423638cb8b620bcc95479bab0f78a7"},"schema_version":"1.0","source":{"id":"1205.0406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0406","created_at":"2026-05-18T03:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0406v1","created_at":"2026-05-18T03:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0406","created_at":"2026-05-18T03:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"VIOFBDJYH7I2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VIOFBDJYH7I2LN3Y","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VIOFBDJY","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:7df498a19b3f62e2a5915687bd75fcfd7ed29406bd33b98732d93758fcd62ae0","target":"graph","created_at":"2026-05-18T03:56: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":"Many studies on the cost-sensitive learning assumed that a unique cost matrix is known for a problem. However, this assumption may not hold for many real-world problems. For example, a classifier might need to be applied in several circumstances, each of which associates with a different cost matrix. Or, different human experts have different opinions about the costs for a given problem. Motivated by these facts, this study aims to seek the minimax classifier over multiple cost matrices. In summary, we theoretically proved that, no matter how many cost matrices are involved, the minimax proble","authors_text":"Ke Tang, Rui Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-02T12:38:11Z","title":"Minimax Classifier for Uncertain Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0406","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:0c56b4aad17b3ab918a66432c9a47d1889435d1269b609687cbfec1232314f88","target":"record","created_at":"2026-05-18T03:56: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":"341b2c79ed21aa5df1791de633bbd989f51128178410e2176ea8e432ad57ef64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-02T12:38:11Z","title_canon_sha256":"1ee699c1dd9a6c5de58f1f56ddbc164fe0423638cb8b620bcc95479bab0f78a7"},"schema_version":"1.0","source":{"id":"1205.0406","kind":"arxiv","version":1}},"canonical_sha256":"aa1c508d383fd1a5b77871d029dfc92db74dce32e095464ddb8fc9b6ae0093e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa1c508d383fd1a5b77871d029dfc92db74dce32e095464ddb8fc9b6ae0093e5","first_computed_at":"2026-05-18T03:56:34.613157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:34.613157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rKsTzE3ukxpKuh3wLbSnrfWmplfw+//Jpcf8Dd8dgKbLwCs0WWs0x57nriNegyPf191WmdSEh3su9KW36allBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:34.613587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c56b4aad17b3ab918a66432c9a47d1889435d1269b609687cbfec1232314f88","sha256:7df498a19b3f62e2a5915687bd75fcfd7ed29406bd33b98732d93758fcd62ae0"],"state_sha256":"f1583645594b351e88ab8ff4ed8903701bce78fc789bf06ca70f246775e25abf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3hrdND78aqCr8y6o3AT8Pz32axztOIDNal/01lHr6yrQ8KqlbbKfPei5fTW71sKU77nWU/I81L+hzQSr7qdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:07:23.491923Z","bundle_sha256":"c897df3461f44152b66b3f921e5a9075287e963c9485c7e9dd221fb211b8f610"}}