{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NTJ2WAQM5JZ4UVW74P3C2TMRZD","short_pith_number":"pith:NTJ2WAQM","canonical_record":{"source":{"id":"1703.04697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-14T20:19:08Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"debe941a03b7e82a4cc453af7e7c9b5ade60fd9e2af095ea6727d7df424157e2","abstract_canon_sha256":"0744cc39ca3e8bd103ae43aaf809b6bba661bfdf03a428e23801774c640f6b74"},"schema_version":"1.0"},"canonical_sha256":"6cd3ab020cea73ca56dfe3f62d4d91c8f16e2b25c15d4c34e62f00275940c034","source":{"kind":"arxiv","id":"1703.04697","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04697","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04697v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04697","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"NTJ2WAQM5JZ4","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTJ2WAQM5JZ4UVW7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTJ2WAQM","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NTJ2WAQM5JZ4UVW74P3C2TMRZD","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-14T20:19:08Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"debe941a03b7e82a4cc453af7e7c9b5ade60fd9e2af095ea6727d7df424157e2","abstract_canon_sha256":"0744cc39ca3e8bd103ae43aaf809b6bba661bfdf03a428e23801774c640f6b74"},"schema_version":"1.0"},"canonical_sha256":"6cd3ab020cea73ca56dfe3f62d4d91c8f16e2b25c15d4c34e62f00275940c034","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:39.420486Z","signature_b64":"+XLLl1eSz+wYmCiDHeBfpH+vyGl3u9/HJDYvbeJDObRO4IeE/LrywtSJDq4d6Wo2dGoraH4yXJtHUT2mgXAGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cd3ab020cea73ca56dfe3f62d4d91c8f16e2b25c15d4c34e62f00275940c034","last_reissued_at":"2026-05-18T00:48:39.420025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:39.420025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04697","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:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qajFYFR8O3nPd08Q/ZtWXHkqyiuOrvI9SfPvMfGy0As+e7JiKGRwO14DuAJ3FtVF2Uo7zVcVHJ0uL8lhDhraBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:57:24.336196Z"},"content_sha256":"dc9c318e6b1f8fed10951534f55c21dd1e9ccfca854f5af4fdbb320668141c69","schema_version":"1.0","event_id":"sha256:dc9c318e6b1f8fed10951534f55c21dd1e9ccfca854f5af4fdbb320668141c69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NTJ2WAQM5JZ4UVW74P3C2TMRZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the benefits of output sparsity for multi-label classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Christophe Denis, Evgenii Chzhen, Joseph Salmon, Mohamed Hebiri","submitted_at":"2017-03-14T20:19:08Z","abstract_excerpt":"The multi-label classification framework, where each observation can be associated with a set of labels, has generated a tremendous amount of attention over recent years. The modern multi-label problems are typically large-scale in terms of number of observations, features and labels, and the amount of labels can even be comparable with the amount of observations. In this context, different remedies have been proposed to overcome the curse of dimensionality. In this work, we aim at exploiting the output sparsity by introducing a new loss, called the sparse weighted Hamming loss. This proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04697","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:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfL7r1kd6RnlVyj3rHWTOasGHDY17DDbGYUEvGftvb1phDiWoKiVvr195PsSJ1RyuxDuWtDYWyPZLVt2VpglCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:57:24.336949Z"},"content_sha256":"371e9885203443e3b42e4f7fb022b112653a2ef446d13d551d4d61c62a14ad6e","schema_version":"1.0","event_id":"sha256:371e9885203443e3b42e4f7fb022b112653a2ef446d13d551d4d61c62a14ad6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTJ2WAQM5JZ4UVW74P3C2TMRZD/bundle.json","state_url":"https://pith.science/pith/NTJ2WAQM5JZ4UVW74P3C2TMRZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTJ2WAQM5JZ4UVW74P3C2TMRZD/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-31T21:57:24Z","links":{"resolver":"https://pith.science/pith/NTJ2WAQM5JZ4UVW74P3C2TMRZD","bundle":"https://pith.science/pith/NTJ2WAQM5JZ4UVW74P3C2TMRZD/bundle.json","state":"https://pith.science/pith/NTJ2WAQM5JZ4UVW74P3C2TMRZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTJ2WAQM5JZ4UVW74P3C2TMRZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NTJ2WAQM5JZ4UVW74P3C2TMRZD","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":"0744cc39ca3e8bd103ae43aaf809b6bba661bfdf03a428e23801774c640f6b74","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-14T20:19:08Z","title_canon_sha256":"debe941a03b7e82a4cc453af7e7c9b5ade60fd9e2af095ea6727d7df424157e2"},"schema_version":"1.0","source":{"id":"1703.04697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04697","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04697v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04697","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"NTJ2WAQM5JZ4","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTJ2WAQM5JZ4UVW7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTJ2WAQM","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:371e9885203443e3b42e4f7fb022b112653a2ef446d13d551d4d61c62a14ad6e","target":"graph","created_at":"2026-05-18T00:48:39Z","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":"The multi-label classification framework, where each observation can be associated with a set of labels, has generated a tremendous amount of attention over recent years. The modern multi-label problems are typically large-scale in terms of number of observations, features and labels, and the amount of labels can even be comparable with the amount of observations. In this context, different remedies have been proposed to overcome the curse of dimensionality. In this work, we aim at exploiting the output sparsity by introducing a new loss, called the sparse weighted Hamming loss. This proposed ","authors_text":"Christophe Denis, Evgenii Chzhen, Joseph Salmon, Mohamed Hebiri","cross_cats":["cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-14T20:19:08Z","title":"On the benefits of output sparsity for multi-label classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04697","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:dc9c318e6b1f8fed10951534f55c21dd1e9ccfca854f5af4fdbb320668141c69","target":"record","created_at":"2026-05-18T00:48:39Z","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":"0744cc39ca3e8bd103ae43aaf809b6bba661bfdf03a428e23801774c640f6b74","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-14T20:19:08Z","title_canon_sha256":"debe941a03b7e82a4cc453af7e7c9b5ade60fd9e2af095ea6727d7df424157e2"},"schema_version":"1.0","source":{"id":"1703.04697","kind":"arxiv","version":1}},"canonical_sha256":"6cd3ab020cea73ca56dfe3f62d4d91c8f16e2b25c15d4c34e62f00275940c034","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cd3ab020cea73ca56dfe3f62d4d91c8f16e2b25c15d4c34e62f00275940c034","first_computed_at":"2026-05-18T00:48:39.420025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:39.420025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+XLLl1eSz+wYmCiDHeBfpH+vyGl3u9/HJDYvbeJDObRO4IeE/LrywtSJDq4d6Wo2dGoraH4yXJtHUT2mgXAGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:39.420486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc9c318e6b1f8fed10951534f55c21dd1e9ccfca854f5af4fdbb320668141c69","sha256:371e9885203443e3b42e4f7fb022b112653a2ef446d13d551d4d61c62a14ad6e"],"state_sha256":"c80853c24c292cc4e257a1f9b004ec88dc5e09fca098bb6cb8fe8c5cf5d959e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yLOHtrlFwhSVMvpliODHE9aljyGpN0vqrXiN+y2w674OJ4OZWtcNP6nwJYvcX2HzwWQMY5znkmTekjqn5LXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:57:24.341006Z","bundle_sha256":"2d144d7fdbaa67f087470c23ffc2483e52c168b7c23d94ccd56253a1cd7b110e"}}