{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5QBM2NXWFKA6GBIRBN24JZLNES","short_pith_number":"pith:5QBM2NXW","canonical_record":{"source":{"id":"1611.09461","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-29T02:41:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cadf093ffa5101cd09a6f8058c69b01a53694ee286c0b34cfb69225d3d30d9a5","abstract_canon_sha256":"7e39b63bfb401220d5d1d3fc2a89da0483b322b4f427483956675302da947b2c"},"schema_version":"1.0"},"canonical_sha256":"ec02cd36f62a81e305110b75c4e56d24a45c32977510d7be2a8eb53d7fde3cae","source":{"kind":"arxiv","id":"1611.09461","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09461","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09461v3","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09461","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"5QBM2NXWFKA6","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5QBM2NXWFKA6GBIR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5QBM2NXW","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5QBM2NXWFKA6GBIRBN24JZLNES","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09461","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-29T02:41:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cadf093ffa5101cd09a6f8058c69b01a53694ee286c0b34cfb69225d3d30d9a5","abstract_canon_sha256":"7e39b63bfb401220d5d1d3fc2a89da0483b322b4f427483956675302da947b2c"},"schema_version":"1.0"},"canonical_sha256":"ec02cd36f62a81e305110b75c4e56d24a45c32977510d7be2a8eb53d7fde3cae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.575475Z","signature_b64":"KUZqeeWaVWb6MMlq4oPfPSBXjaDcgNQGEGrZZbeGNdKuVkLocoZiV8Q9kBGDDbku0uNzGPZGacGH2CPp6rFPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec02cd36f62a81e305110b75c4e56d24a45c32977510d7be2a8eb53d7fde3cae","last_reissued_at":"2026-05-18T00:02:18.575028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.575028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09461","source_version":3,"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:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1x4TKp1o0ZZzfX7t7o9K12aj6HvaM2nOsY2ZSQZxp1+28u6dwgxnkTMC+epRAi5Vpf8y/MCrGAjk+fJnQZ7jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:10:18.587876Z"},"content_sha256":"6f8d673137563dac3919105a7bc02c4cf45751c61d113db76c77fef17863e284","schema_version":"1.0","event_id":"sha256:6f8d673137563dac3919105a7bc02c4cf45751c61d113db76c77fef17863e284"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5QBM2NXWFKA6GBIRBN24JZLNES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-Sensitive Reference Pair Encoding for Multi-Label Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chih-Wei Chang, Hsuan-Tien Lin, Kuan-Hao Huang, Yao-Yuan Yang","submitted_at":"2016-11-29T02:41:28Z","abstract_excerpt":"Label space expansion for multi-label classification (MLC) is a methodology that encodes the original label vectors to higher dimensional codes before training and decodes the predicted codes back to the label vectors during testing. The methodology has been demonstrated to improve the performance of MLC algorithms when coupled with off-the-shelf error-correcting codes for encoding and decoding. Nevertheless, such a coding scheme can be complicated to implement, and cannot easily satisfy a common application need of cost-sensitive MLC---adapting to different evaluation criteria of interest. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09461","kind":"arxiv","version":3},"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:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIVCpY+E+R/NPknFni4+AU+ntmESwZZx18rjFYSIIxEBdm6LK+by5pujd6Dl7Emwgz//nLIy88D7xpZgzVGZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:10:18.588472Z"},"content_sha256":"b9b44862b74f13bd6b61ee37c37b18b9c9653fd0e2042b4931c133a77518a98b","schema_version":"1.0","event_id":"sha256:b9b44862b74f13bd6b61ee37c37b18b9c9653fd0e2042b4931c133a77518a98b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QBM2NXWFKA6GBIRBN24JZLNES/bundle.json","state_url":"https://pith.science/pith/5QBM2NXWFKA6GBIRBN24JZLNES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QBM2NXWFKA6GBIRBN24JZLNES/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-25T22:10:18Z","links":{"resolver":"https://pith.science/pith/5QBM2NXWFKA6GBIRBN24JZLNES","bundle":"https://pith.science/pith/5QBM2NXWFKA6GBIRBN24JZLNES/bundle.json","state":"https://pith.science/pith/5QBM2NXWFKA6GBIRBN24JZLNES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QBM2NXWFKA6GBIRBN24JZLNES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5QBM2NXWFKA6GBIRBN24JZLNES","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":"7e39b63bfb401220d5d1d3fc2a89da0483b322b4f427483956675302da947b2c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-29T02:41:28Z","title_canon_sha256":"cadf093ffa5101cd09a6f8058c69b01a53694ee286c0b34cfb69225d3d30d9a5"},"schema_version":"1.0","source":{"id":"1611.09461","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09461","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09461v3","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09461","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"5QBM2NXWFKA6","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5QBM2NXWFKA6GBIR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5QBM2NXW","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:b9b44862b74f13bd6b61ee37c37b18b9c9653fd0e2042b4931c133a77518a98b","target":"graph","created_at":"2026-05-18T00:02:18Z","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 space expansion for multi-label classification (MLC) is a methodology that encodes the original label vectors to higher dimensional codes before training and decodes the predicted codes back to the label vectors during testing. The methodology has been demonstrated to improve the performance of MLC algorithms when coupled with off-the-shelf error-correcting codes for encoding and decoding. Nevertheless, such a coding scheme can be complicated to implement, and cannot easily satisfy a common application need of cost-sensitive MLC---adapting to different evaluation criteria of interest. In","authors_text":"Chih-Wei Chang, Hsuan-Tien Lin, Kuan-Hao Huang, Yao-Yuan Yang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-29T02:41:28Z","title":"Cost-Sensitive Reference Pair Encoding for Multi-Label Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09461","kind":"arxiv","version":3},"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:6f8d673137563dac3919105a7bc02c4cf45751c61d113db76c77fef17863e284","target":"record","created_at":"2026-05-18T00:02:18Z","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":"7e39b63bfb401220d5d1d3fc2a89da0483b322b4f427483956675302da947b2c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-29T02:41:28Z","title_canon_sha256":"cadf093ffa5101cd09a6f8058c69b01a53694ee286c0b34cfb69225d3d30d9a5"},"schema_version":"1.0","source":{"id":"1611.09461","kind":"arxiv","version":3}},"canonical_sha256":"ec02cd36f62a81e305110b75c4e56d24a45c32977510d7be2a8eb53d7fde3cae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec02cd36f62a81e305110b75c4e56d24a45c32977510d7be2a8eb53d7fde3cae","first_computed_at":"2026-05-18T00:02:18.575028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:18.575028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KUZqeeWaVWb6MMlq4oPfPSBXjaDcgNQGEGrZZbeGNdKuVkLocoZiV8Q9kBGDDbku0uNzGPZGacGH2CPp6rFPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:18.575475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09461","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f8d673137563dac3919105a7bc02c4cf45751c61d113db76c77fef17863e284","sha256:b9b44862b74f13bd6b61ee37c37b18b9c9653fd0e2042b4931c133a77518a98b"],"state_sha256":"31ff81799bf053122984211f9ba16834397f94441417029337da6458c30205ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJmSo0gezagd+EOCPcnB4YIZPal7z4CtBiLlQFlS0EUay9K7vtCd+CAF6I7ZL+zHKcYRFY93mQsFqrREaKmoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:10:18.591610Z","bundle_sha256":"5af26e652e062151aed70eaeb5d6d22588bcce505b96096b830737e82588c0e8"}}