{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MEBEFIA3C7H7VBNYQNW7QR3ZFO","short_pith_number":"pith:MEBEFIA3","canonical_record":{"source":{"id":"1901.00544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T22:09:12Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"b462ea12832e99e3032034ca9b014ee45cd93c9cc498af13f13ef6558f9fbc59","abstract_canon_sha256":"412c63e0cb51bd57bb6a2eab84db4ff5f16b924b104206fd14dbc47d49b29cd6"},"schema_version":"1.0"},"canonical_sha256":"610242a01b17cffa85b8836df847792b8b051f16d073fd0b5a1fef306d7c218e","source":{"kind":"arxiv","id":"1901.00544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00544","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00544v1","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00544","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"MEBEFIA3C7H7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MEBEFIA3C7H7VBNY","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MEBEFIA3","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MEBEFIA3C7H7VBNYQNW7QR3ZFO","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T22:09:12Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"b462ea12832e99e3032034ca9b014ee45cd93c9cc498af13f13ef6558f9fbc59","abstract_canon_sha256":"412c63e0cb51bd57bb6a2eab84db4ff5f16b924b104206fd14dbc47d49b29cd6"},"schema_version":"1.0"},"canonical_sha256":"610242a01b17cffa85b8836df847792b8b051f16d073fd0b5a1fef306d7c218e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:02.192412Z","signature_b64":"gSgOvBrEZuJiEbUi5QwTAj81W3Eu1XYP0+BVy4qsY/GzKkXmBk/ile3INb2kQf5zr/8kjcZcDIYiYSsLFko2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"610242a01b17cffa85b8836df847792b8b051f16d073fd0b5a1fef306d7c218e","last_reissued_at":"2026-05-17T23:57:02.191896Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:02.191896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00544","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-17T23:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+aPd5Y4LFVSKN///dtlltAVoyuAwGQMkvGN06kEqjDa7M9okh/4VSF/mXUqIrT8SPfunfKg8bJ3WQ5u2aCtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:59:22.449071Z"},"content_sha256":"2b8980df457e5153c54cfd4eb1997adbbf5da785e1bf6793976859ca50f50bce","schema_version":"1.0","event_id":"sha256:2b8980df457e5153c54cfd4eb1997adbbf5da785e1bf6793976859ca50f50bce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MEBEFIA3C7H7VBNYQNW7QR3ZFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-class Classification without Multi-class Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Joel Schlosser, Phillip Odom, Yen-Chang Hsu, Zhaoyang Lv, Zsolt Kira","submitted_at":"2019-01-02T22:09:12Z","abstract_excerpt":"This work presents a new strategy for multi-class classification that requires no class-specific labels, but instead leverages pairwise similarity between examples, which is a weaker form of annotation. The proposed method, meta classification learning, optimizes a binary classifier for pairwise similarity prediction and through this process learns a multi-class classifier as a submodule. We formulate this approach, present a probabilistic graphical model for it, and derive a surprisingly simple loss function that can be used to learn neural network-based models. We then demonstrate that this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00544","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-17T23:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8UKVQEmv7fHegrhAPv9fshvDeET3/Dy8n67Jg0lBaNcGQcqhB/u2to+VFja3cDPIz4UU6WILLK3DMIdKhz6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:59:22.449431Z"},"content_sha256":"7c0b64a357aa958e3f22267432f0c872659940ef5883092a1b1706be65862b7c","schema_version":"1.0","event_id":"sha256:7c0b64a357aa958e3f22267432f0c872659940ef5883092a1b1706be65862b7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEBEFIA3C7H7VBNYQNW7QR3ZFO/bundle.json","state_url":"https://pith.science/pith/MEBEFIA3C7H7VBNYQNW7QR3ZFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEBEFIA3C7H7VBNYQNW7QR3ZFO/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-08T14:59:22Z","links":{"resolver":"https://pith.science/pith/MEBEFIA3C7H7VBNYQNW7QR3ZFO","bundle":"https://pith.science/pith/MEBEFIA3C7H7VBNYQNW7QR3ZFO/bundle.json","state":"https://pith.science/pith/MEBEFIA3C7H7VBNYQNW7QR3ZFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEBEFIA3C7H7VBNYQNW7QR3ZFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MEBEFIA3C7H7VBNYQNW7QR3ZFO","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":"412c63e0cb51bd57bb6a2eab84db4ff5f16b924b104206fd14dbc47d49b29cd6","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T22:09:12Z","title_canon_sha256":"b462ea12832e99e3032034ca9b014ee45cd93c9cc498af13f13ef6558f9fbc59"},"schema_version":"1.0","source":{"id":"1901.00544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00544","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00544v1","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00544","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"MEBEFIA3C7H7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MEBEFIA3C7H7VBNY","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MEBEFIA3","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:7c0b64a357aa958e3f22267432f0c872659940ef5883092a1b1706be65862b7c","target":"graph","created_at":"2026-05-17T23:57:02Z","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":"This work presents a new strategy for multi-class classification that requires no class-specific labels, but instead leverages pairwise similarity between examples, which is a weaker form of annotation. The proposed method, meta classification learning, optimizes a binary classifier for pairwise similarity prediction and through this process learns a multi-class classifier as a submodule. We formulate this approach, present a probabilistic graphical model for it, and derive a surprisingly simple loss function that can be used to learn neural network-based models. We then demonstrate that this ","authors_text":"Joel Schlosser, Phillip Odom, Yen-Chang Hsu, Zhaoyang Lv, Zsolt Kira","cross_cats":["cs.AI","cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T22:09:12Z","title":"Multi-class Classification without Multi-class Labels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00544","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:2b8980df457e5153c54cfd4eb1997adbbf5da785e1bf6793976859ca50f50bce","target":"record","created_at":"2026-05-17T23:57:02Z","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":"412c63e0cb51bd57bb6a2eab84db4ff5f16b924b104206fd14dbc47d49b29cd6","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T22:09:12Z","title_canon_sha256":"b462ea12832e99e3032034ca9b014ee45cd93c9cc498af13f13ef6558f9fbc59"},"schema_version":"1.0","source":{"id":"1901.00544","kind":"arxiv","version":1}},"canonical_sha256":"610242a01b17cffa85b8836df847792b8b051f16d073fd0b5a1fef306d7c218e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"610242a01b17cffa85b8836df847792b8b051f16d073fd0b5a1fef306d7c218e","first_computed_at":"2026-05-17T23:57:02.191896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:02.191896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gSgOvBrEZuJiEbUi5QwTAj81W3Eu1XYP0+BVy4qsY/GzKkXmBk/ile3INb2kQf5zr/8kjcZcDIYiYSsLFko2AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:02.192412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b8980df457e5153c54cfd4eb1997adbbf5da785e1bf6793976859ca50f50bce","sha256:7c0b64a357aa958e3f22267432f0c872659940ef5883092a1b1706be65862b7c"],"state_sha256":"3f48d29c994f77574bad31aac7f776cb401620858d0c59561e99b922844d313e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4Y7q4o0SYJyCxX2MfeENqujG43/0vW4znNrfjUaLL6QooEykEMpfr5TF3xeCDFDfUNMN8vHpe55z2iZrA1wAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:59:22.451300Z","bundle_sha256":"3d5b99427c95164a282f2494a764e713d32b3aa93b3e1f943211baee7b29174d"}}