{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K6X4LOTANLS2PWYMZDXQDOIDAV","short_pith_number":"pith:K6X4LOTA","canonical_record":{"source":{"id":"1207.0166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-30T23:07:03Z","cross_cats_sorted":[],"title_canon_sha256":"c4d25fc0bdc5ff3aaa7de0fcf238899426a8ca39ed72931cf3c685ffcd91006a","abstract_canon_sha256":"8525a8c98a8bc3f078a1646fa19edcf8a7d50e594e9ae4875e2524aabeb3c29a"},"schema_version":"1.0"},"canonical_sha256":"57afc5ba606ae5a7db0cc8ef01b903054651f4fdb7187eab3d992b23d5664996","source":{"kind":"arxiv","id":"1207.0166","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0166","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0166v3","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0166","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"K6X4LOTANLS2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K6X4LOTANLS2PWYM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K6X4LOTA","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K6X4LOTANLS2PWYMZDXQDOIDAV","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-30T23:07:03Z","cross_cats_sorted":[],"title_canon_sha256":"c4d25fc0bdc5ff3aaa7de0fcf238899426a8ca39ed72931cf3c685ffcd91006a","abstract_canon_sha256":"8525a8c98a8bc3f078a1646fa19edcf8a7d50e594e9ae4875e2524aabeb3c29a"},"schema_version":"1.0"},"canonical_sha256":"57afc5ba606ae5a7db0cc8ef01b903054651f4fdb7187eab3d992b23d5664996","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:16.682407Z","signature_b64":"wZHkiaDJJolXrZYneH8N3/EWFwdD81qt8xPpGFrBIoEIK9xTe/5ooDDRjIlAkWRwREtsyVdmjFJ4rMqRHX/jAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57afc5ba606ae5a7db0cc8ef01b903054651f4fdb7187eab3d992b23d5664996","last_reissued_at":"2026-05-18T03:36:16.681762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:16.681762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0166","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-18T03:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IT3rkECrM70kjDpC6MYKR/i2bw2q1ycpLCEEojzS8gWWeIBMPVRyk7WaTJVh6mzAZ1F+buYMmOWHFqHPv0TuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:15.616439Z"},"content_sha256":"c43a038420f6781d05bb939d8b64438f509d25315d5bbc3a838e484daa8799af","schema_version":"1.0","event_id":"sha256:c43a038420f6781d05bb939d8b64438f509d25315d5bbc3a838e484daa8799af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K6X4LOTANLS2PWYMZDXQDOIDAV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Multilabel Classification and Ranking with Partial Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Claudio Gentile, Francesco Orabona","submitted_at":"2012-06-30T23:07:03Z","abstract_excerpt":"We present a novel multilabel/ranking algorithm working in partial information settings. The algorithm is based on 2nd-order descent methods, and relies on upper-confidence bounds to trade-off exploration and exploitation. We analyze this algorithm in a partial adversarial setting, where covariates can be adversarial, but multilabel probabilities are ruled by (generalized) linear models. We show O(T^{1/2} log T) regret bounds, which improve in several ways on the existing results. We test the effectiveness of our upper-confidence scheme by contrasting against full-information baselines on real"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0166","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-18T03:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzEj1dcfiodO3nQd9KvJ58A17L1puDV4fqGHuABpdrCvL2aSvqM16vvwhGfDacfDvhybNXMojqeEYDVnRJtyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:15.617026Z"},"content_sha256":"dc7304bbac803f0f756b70303c6ad347d7169dc45bd999480505cd71cbdf48b2","schema_version":"1.0","event_id":"sha256:dc7304bbac803f0f756b70303c6ad347d7169dc45bd999480505cd71cbdf48b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6X4LOTANLS2PWYMZDXQDOIDAV/bundle.json","state_url":"https://pith.science/pith/K6X4LOTANLS2PWYMZDXQDOIDAV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6X4LOTANLS2PWYMZDXQDOIDAV/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-26T17:39:15Z","links":{"resolver":"https://pith.science/pith/K6X4LOTANLS2PWYMZDXQDOIDAV","bundle":"https://pith.science/pith/K6X4LOTANLS2PWYMZDXQDOIDAV/bundle.json","state":"https://pith.science/pith/K6X4LOTANLS2PWYMZDXQDOIDAV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6X4LOTANLS2PWYMZDXQDOIDAV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K6X4LOTANLS2PWYMZDXQDOIDAV","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":"8525a8c98a8bc3f078a1646fa19edcf8a7d50e594e9ae4875e2524aabeb3c29a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-30T23:07:03Z","title_canon_sha256":"c4d25fc0bdc5ff3aaa7de0fcf238899426a8ca39ed72931cf3c685ffcd91006a"},"schema_version":"1.0","source":{"id":"1207.0166","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0166","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0166v3","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0166","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"K6X4LOTANLS2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K6X4LOTANLS2PWYM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K6X4LOTA","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:dc7304bbac803f0f756b70303c6ad347d7169dc45bd999480505cd71cbdf48b2","target":"graph","created_at":"2026-05-18T03:36:16Z","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":"We present a novel multilabel/ranking algorithm working in partial information settings. The algorithm is based on 2nd-order descent methods, and relies on upper-confidence bounds to trade-off exploration and exploitation. We analyze this algorithm in a partial adversarial setting, where covariates can be adversarial, but multilabel probabilities are ruled by (generalized) linear models. We show O(T^{1/2} log T) regret bounds, which improve in several ways on the existing results. We test the effectiveness of our upper-confidence scheme by contrasting against full-information baselines on real","authors_text":"Claudio Gentile, Francesco Orabona","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-30T23:07:03Z","title":"On Multilabel Classification and Ranking with Partial Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0166","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:c43a038420f6781d05bb939d8b64438f509d25315d5bbc3a838e484daa8799af","target":"record","created_at":"2026-05-18T03:36:16Z","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":"8525a8c98a8bc3f078a1646fa19edcf8a7d50e594e9ae4875e2524aabeb3c29a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-30T23:07:03Z","title_canon_sha256":"c4d25fc0bdc5ff3aaa7de0fcf238899426a8ca39ed72931cf3c685ffcd91006a"},"schema_version":"1.0","source":{"id":"1207.0166","kind":"arxiv","version":3}},"canonical_sha256":"57afc5ba606ae5a7db0cc8ef01b903054651f4fdb7187eab3d992b23d5664996","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57afc5ba606ae5a7db0cc8ef01b903054651f4fdb7187eab3d992b23d5664996","first_computed_at":"2026-05-18T03:36:16.681762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:16.681762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wZHkiaDJJolXrZYneH8N3/EWFwdD81qt8xPpGFrBIoEIK9xTe/5ooDDRjIlAkWRwREtsyVdmjFJ4rMqRHX/jAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:16.682407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0166","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c43a038420f6781d05bb939d8b64438f509d25315d5bbc3a838e484daa8799af","sha256:dc7304bbac803f0f756b70303c6ad347d7169dc45bd999480505cd71cbdf48b2"],"state_sha256":"38f774d21c6e0cd841241b3bb025ac4026876600e888fb6e9ffebb18d8b206b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVp2+Rb3XROtWI7fX+nnvl/5kiX0nJQu2lNzkATER5Ly8TrNhlOXUC2qWw1/AzN+RcABTAIGM/vzfbYQ0//1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:39:15.619809Z","bundle_sha256":"9ce2575d9f157227108710134ebc2bd20d86e9b58740eee3fb5ec774a6ce4c40"}}