{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EJVR2HKLBVL5MCY4QSGWIDJIN3","short_pith_number":"pith:EJVR2HKL","canonical_record":{"source":{"id":"1603.09048","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:19:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4376a54f2acf1a455dd1b376f53b74da9eab3e5078073eb5e971c5850a568378","abstract_canon_sha256":"0864cecf08b28659fa823256e7b9d87b6611087d347b827219df4bb21d5293a6"},"schema_version":"1.0"},"canonical_sha256":"226b1d1d4b0d57d60b1c848d640d286ec512afcb382c097ef4aa450d885a2ef3","source":{"kind":"arxiv","id":"1603.09048","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09048","created_at":"2026-05-17T23:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09048v5","created_at":"2026-05-17T23:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09048","created_at":"2026-05-17T23:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"EJVR2HKLBVL5","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJVR2HKLBVL5MCY4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJVR2HKL","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EJVR2HKLBVL5MCY4QSGWIDJIN3","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09048","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:19:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4376a54f2acf1a455dd1b376f53b74da9eab3e5078073eb5e971c5850a568378","abstract_canon_sha256":"0864cecf08b28659fa823256e7b9d87b6611087d347b827219df4bb21d5293a6"},"schema_version":"1.0"},"canonical_sha256":"226b1d1d4b0d57d60b1c848d640d286ec512afcb382c097ef4aa450d885a2ef3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:42.003499Z","signature_b64":"shzyU5sZ0dEzaXmcslIq3aFfBQAZ4wGark8Ozqf28q6Kfftt2M3TNHaU1ICjUpCqdfKlI6cLdk0hIM4GTSjoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"226b1d1d4b0d57d60b1c848d640d286ec512afcb382c097ef4aa450d885a2ef3","last_reissued_at":"2026-05-17T23:54:42.002896Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:42.002896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09048","source_version":5,"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-17T23:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uME0rtAH85X+pKEQoA+46XzuBO1ffj18EhGhkeTli+tjyEqKzQGKMAZUyavy+WVwN0A5wFa/t5ffxxK1IYOtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:35:39.272106Z"},"content_sha256":"98f92a4ed0d9e2ff7910cf22ee5d7620dd83a9ee013cd3ccc38a2c9ad5299f49","schema_version":"1.0","event_id":"sha256:98f92a4ed0d9e2ff7910cf22ee5d7620dd83a9ee013cd3ccc38a2c9ad5299f49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EJVR2HKLBVL5MCY4QSGWIDJIN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-Sensitive Label Embedding for Multi-Label Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hsuan-Tien Lin, Kuan-Hao Huang","submitted_at":"2016-03-30T06:19:02Z","abstract_excerpt":"Label embedding (LE) is an important family of multi-label classification algorithms that digest the label information jointly for better performance. Different real-world applications evaluate performance by different cost functions of interest. Current LE algorithms often aim to optimize one specific cost function, but they can suffer from bad performance with respect to other cost functions. In this paper, we resolve the performance issue by proposing a novel cost-sensitive LE algorithm that takes the cost function of interest into account. The proposed algorithm, cost-sensitive label embed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09048","kind":"arxiv","version":5},"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-17T23:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SG96v1NULjbZfDzMWc0kcCw0OOdmBxyKtAZgyGg47K6EvnsnYvDelm/CC48rHzD5anByXLl+W0eOnSXry7vAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:35:39.272816Z"},"content_sha256":"f069f4afdbc980198f1fdfb1e4b6d68c30694caf0d7e5fc8930dbcc68d3875fb","schema_version":"1.0","event_id":"sha256:f069f4afdbc980198f1fdfb1e4b6d68c30694caf0d7e5fc8930dbcc68d3875fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJVR2HKLBVL5MCY4QSGWIDJIN3/bundle.json","state_url":"https://pith.science/pith/EJVR2HKLBVL5MCY4QSGWIDJIN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJVR2HKLBVL5MCY4QSGWIDJIN3/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-26T00:35:39Z","links":{"resolver":"https://pith.science/pith/EJVR2HKLBVL5MCY4QSGWIDJIN3","bundle":"https://pith.science/pith/EJVR2HKLBVL5MCY4QSGWIDJIN3/bundle.json","state":"https://pith.science/pith/EJVR2HKLBVL5MCY4QSGWIDJIN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJVR2HKLBVL5MCY4QSGWIDJIN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EJVR2HKLBVL5MCY4QSGWIDJIN3","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":"0864cecf08b28659fa823256e7b9d87b6611087d347b827219df4bb21d5293a6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:19:02Z","title_canon_sha256":"4376a54f2acf1a455dd1b376f53b74da9eab3e5078073eb5e971c5850a568378"},"schema_version":"1.0","source":{"id":"1603.09048","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09048","created_at":"2026-05-17T23:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09048v5","created_at":"2026-05-17T23:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09048","created_at":"2026-05-17T23:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"EJVR2HKLBVL5","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJVR2HKLBVL5MCY4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJVR2HKL","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:f069f4afdbc980198f1fdfb1e4b6d68c30694caf0d7e5fc8930dbcc68d3875fb","target":"graph","created_at":"2026-05-17T23:54:42Z","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":"Label embedding (LE) is an important family of multi-label classification algorithms that digest the label information jointly for better performance. Different real-world applications evaluate performance by different cost functions of interest. Current LE algorithms often aim to optimize one specific cost function, but they can suffer from bad performance with respect to other cost functions. In this paper, we resolve the performance issue by proposing a novel cost-sensitive LE algorithm that takes the cost function of interest into account. The proposed algorithm, cost-sensitive label embed","authors_text":"Hsuan-Tien Lin, Kuan-Hao Huang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:19:02Z","title":"Cost-Sensitive Label Embedding for Multi-Label Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09048","kind":"arxiv","version":5},"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:98f92a4ed0d9e2ff7910cf22ee5d7620dd83a9ee013cd3ccc38a2c9ad5299f49","target":"record","created_at":"2026-05-17T23:54:42Z","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":"0864cecf08b28659fa823256e7b9d87b6611087d347b827219df4bb21d5293a6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:19:02Z","title_canon_sha256":"4376a54f2acf1a455dd1b376f53b74da9eab3e5078073eb5e971c5850a568378"},"schema_version":"1.0","source":{"id":"1603.09048","kind":"arxiv","version":5}},"canonical_sha256":"226b1d1d4b0d57d60b1c848d640d286ec512afcb382c097ef4aa450d885a2ef3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"226b1d1d4b0d57d60b1c848d640d286ec512afcb382c097ef4aa450d885a2ef3","first_computed_at":"2026-05-17T23:54:42.002896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:42.002896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"shzyU5sZ0dEzaXmcslIq3aFfBQAZ4wGark8Ozqf28q6Kfftt2M3TNHaU1ICjUpCqdfKlI6cLdk0hIM4GTSjoAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:42.003499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09048","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98f92a4ed0d9e2ff7910cf22ee5d7620dd83a9ee013cd3ccc38a2c9ad5299f49","sha256:f069f4afdbc980198f1fdfb1e4b6d68c30694caf0d7e5fc8930dbcc68d3875fb"],"state_sha256":"280191dfb4819e8345f17d9732eb863419d06cfe5db8fb8dc909eb18ea054ee8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqGl19Me9zdbA6BuNxcOWE7o+sMDCL64nzB+wCsdOAX4d4cyYeWouHd3u24Rog5bNZbudUZod4/lVmguCb0sCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:35:39.276778Z","bundle_sha256":"1a05a5f9c7047839c960fec97e1f1e131b1d66c2226036fa504179da340385f4"}}