{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BUPFUD3JK5PVZT2PYVZPQSNSGE","short_pith_number":"pith:BUPFUD3J","canonical_record":{"source":{"id":"1211.2190","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T17:21:48Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"f7671ba9c428c33ee5473c4f13f87864318a4cd245b630def0f0a6b3acb59388","abstract_canon_sha256":"15062ba840f9c31cebf011dc12cea20986e12d580c1c04e06adac275391865a9"},"schema_version":"1.0"},"canonical_sha256":"0d1e5a0f69575f5ccf4fc572f849b2310351345e63bae10a1146d12f731f4211","source":{"kind":"arxiv","id":"1211.2190","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2190","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2190v4","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2190","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"pith_short_12","alias_value":"BUPFUD3JK5PV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BUPFUD3JK5PVZT2P","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BUPFUD3J","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BUPFUD3JK5PVZT2PYVZPQSNSGE","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2190","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T17:21:48Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"f7671ba9c428c33ee5473c4f13f87864318a4cd245b630def0f0a6b3acb59388","abstract_canon_sha256":"15062ba840f9c31cebf011dc12cea20986e12d580c1c04e06adac275391865a9"},"schema_version":"1.0"},"canonical_sha256":"0d1e5a0f69575f5ccf4fc572f849b2310351345e63bae10a1146d12f731f4211","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:42.534640Z","signature_b64":"ZD2u3UCcQLeX12Y67B5FwFHKWx7u61ftFANPJyVF3P6rT6rXKAgr5ODHEUgJu9ICLwobxiIpxYVUAucefTTgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d1e5a0f69575f5ccf4fc572f849b2310351345e63bae10a1146d12f731f4211","last_reissued_at":"2026-05-18T02:51:42.534154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:42.534154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2190","source_version":4,"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-18T02:51:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whelRCaidAoysuygPSn4z44w0CwhZI2ISwgJttvx5bWZ1tV2333AYB+yqtSn55aXNdB7lJ3r/JpBlwtBSNUTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:12:41.200439Z"},"content_sha256":"32df734b036d01e432fb7ee8942614691da6c880e9478dbfffd42cbe0c5eba03","schema_version":"1.0","event_id":"sha256:32df734b036d01e432fb7ee8942614691da6c880e9478dbfffd42cbe0c5eba03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BUPFUD3JK5PVZT2PYVZPQSNSGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Monte Carlo Methods for Multi-Dimensional Learning with Classifier Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Luengo, Jesse Read, Luca Martino","submitted_at":"2012-11-09T17:21:48Z","abstract_excerpt":"Multi-dimensional classification (MDC) is the supervised learning problem where an instance is associated with multiple classes, rather than with a single class, as in traditional classification problems. Since these classes are often strongly correlated, modeling the dependencies between them allows MDC methods to improve their performance - at the expense of an increased computational cost. In this paper we focus on the classifier chains (CC) approach for modeling dependencies, one of the most popular and highest- performing methods for multi-label classification (MLC), a particular case of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2190","kind":"arxiv","version":4},"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-18T02:51:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzfDwSG4+x+l2Yt78YlrEfRUhqhx42tX3PDTUznXg3klyMWlxGlRvJ8Uak367I0rqNbSxESTL68FT0bhv3HjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:12:41.200789Z"},"content_sha256":"328d57352ce42364e175b8aa1c8bf518bd5ecc2471bfc2d1850f8393bdf43ffc","schema_version":"1.0","event_id":"sha256:328d57352ce42364e175b8aa1c8bf518bd5ecc2471bfc2d1850f8393bdf43ffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUPFUD3JK5PVZT2PYVZPQSNSGE/bundle.json","state_url":"https://pith.science/pith/BUPFUD3JK5PVZT2PYVZPQSNSGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUPFUD3JK5PVZT2PYVZPQSNSGE/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-26T16:12:41Z","links":{"resolver":"https://pith.science/pith/BUPFUD3JK5PVZT2PYVZPQSNSGE","bundle":"https://pith.science/pith/BUPFUD3JK5PVZT2PYVZPQSNSGE/bundle.json","state":"https://pith.science/pith/BUPFUD3JK5PVZT2PYVZPQSNSGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUPFUD3JK5PVZT2PYVZPQSNSGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BUPFUD3JK5PVZT2PYVZPQSNSGE","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":"15062ba840f9c31cebf011dc12cea20986e12d580c1c04e06adac275391865a9","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T17:21:48Z","title_canon_sha256":"f7671ba9c428c33ee5473c4f13f87864318a4cd245b630def0f0a6b3acb59388"},"schema_version":"1.0","source":{"id":"1211.2190","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2190","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2190v4","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2190","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"pith_short_12","alias_value":"BUPFUD3JK5PV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BUPFUD3JK5PVZT2P","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BUPFUD3J","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:328d57352ce42364e175b8aa1c8bf518bd5ecc2471bfc2d1850f8393bdf43ffc","target":"graph","created_at":"2026-05-18T02:51: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":"Multi-dimensional classification (MDC) is the supervised learning problem where an instance is associated with multiple classes, rather than with a single class, as in traditional classification problems. Since these classes are often strongly correlated, modeling the dependencies between them allows MDC methods to improve their performance - at the expense of an increased computational cost. In this paper we focus on the classifier chains (CC) approach for modeling dependencies, one of the most popular and highest- performing methods for multi-label classification (MLC), a particular case of ","authors_text":"David Luengo, Jesse Read, Luca Martino","cross_cats":["stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T17:21:48Z","title":"Efficient Monte Carlo Methods for Multi-Dimensional Learning with Classifier Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2190","kind":"arxiv","version":4},"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:32df734b036d01e432fb7ee8942614691da6c880e9478dbfffd42cbe0c5eba03","target":"record","created_at":"2026-05-18T02:51: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":"15062ba840f9c31cebf011dc12cea20986e12d580c1c04e06adac275391865a9","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T17:21:48Z","title_canon_sha256":"f7671ba9c428c33ee5473c4f13f87864318a4cd245b630def0f0a6b3acb59388"},"schema_version":"1.0","source":{"id":"1211.2190","kind":"arxiv","version":4}},"canonical_sha256":"0d1e5a0f69575f5ccf4fc572f849b2310351345e63bae10a1146d12f731f4211","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d1e5a0f69575f5ccf4fc572f849b2310351345e63bae10a1146d12f731f4211","first_computed_at":"2026-05-18T02:51:42.534154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:42.534154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZD2u3UCcQLeX12Y67B5FwFHKWx7u61ftFANPJyVF3P6rT6rXKAgr5ODHEUgJu9ICLwobxiIpxYVUAucefTTgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:42.534640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2190","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32df734b036d01e432fb7ee8942614691da6c880e9478dbfffd42cbe0c5eba03","sha256:328d57352ce42364e175b8aa1c8bf518bd5ecc2471bfc2d1850f8393bdf43ffc"],"state_sha256":"c458a5f66959c7892b11149bac01ab068a485de099874e72c4b8e067060ff5f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTqiROpCvVu2caKXZ37A3/a7spjJYVvyf8YHzfYeQiid9pH+eN8Gee8NwfZ5DDVxfqI4Kw2xR/qeUoRPewx6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T16:12:41.202738Z","bundle_sha256":"1c6415a1d89b0b338dd1a1f3c923377c87c061fbc6f93a620081970cccb6a1f6"}}