{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SXJNZIUNIATTLLBASMH4SBQY4R","short_pith_number":"pith:SXJNZIUN","canonical_record":{"source":{"id":"1906.07341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-18T02:14:36Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"8cddebaa5132f1d9a1afd4ce8e63c0540602b4c3c77a0bb7618cdebbf5d04d04","abstract_canon_sha256":"6b6fa4db86835947f9426ddefc87a7dcd4df899f0477ee3a4dac33bcb0d3a79f"},"schema_version":"1.0"},"canonical_sha256":"95d2dca28d402735ac20930fc90618e459f09b20e39b61d630f85c32718d05cd","source":{"kind":"arxiv","id":"1906.07341","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07341","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07341v1","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07341","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"SXJNZIUNIATT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SXJNZIUNIATTLLBA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SXJNZIUN","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SXJNZIUNIATTLLBASMH4SBQY4R","target":"record","payload":{"canonical_record":{"source":{"id":"1906.07341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-18T02:14:36Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"8cddebaa5132f1d9a1afd4ce8e63c0540602b4c3c77a0bb7618cdebbf5d04d04","abstract_canon_sha256":"6b6fa4db86835947f9426ddefc87a7dcd4df899f0477ee3a4dac33bcb0d3a79f"},"schema_version":"1.0"},"canonical_sha256":"95d2dca28d402735ac20930fc90618e459f09b20e39b61d630f85c32718d05cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:08.155779Z","signature_b64":"pJDzjydKM362vjNzN/sXmXiUxs9a4d8n9xERrH234HQyl17soeg9tRGrHOoAHgGpomv4cgjMY77Kj1Bjv6uwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d2dca28d402735ac20930fc90618e459f09b20e39b61d630f85c32718d05cd","last_reissued_at":"2026-05-17T23:43:08.155131Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:08.155131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.07341","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:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkac2poOwZLgDPtiMtJtrzGaMjqUpBfM37yyCVRFsOzHOnOq4WGtrmSvixxrjjpMN7TomYiZlmRwKMti9SmACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:52:59.777866Z"},"content_sha256":"a86769229a79f05616a554486c5631758b2d5cfd901eec80d13557565f750e7c","schema_version":"1.0","event_id":"sha256:a86769229a79f05616a554486c5631758b2d5cfd901eec80d13557565f750e7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SXJNZIUNIATTLLBASMH4SBQY4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Personalized Attribute Preference via Multi-task AUC Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qianqian Xu, Qingming Huang, Xiaochun Cao, Zhiyong Yang","submitted_at":"2019-06-18T02:14:36Z","abstract_excerpt":"Traditionally, most of the existing attribute learning methods are trained based on the consensus of annotations aggregated from a limited number of annotators. However, the consensus might fail in settings, especially when a wide spectrum of annotators with different interests and comprehension about the attribute words are involved. In this paper, we develop a novel multi-task method to understand and predict personalized attribute annotations. Regarding the attribute preference learning for each annotator as a specific task, we first propose a multi-level task parameter decomposition to cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07341","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:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ReyDMeT3Yyo5xlMa4l7GV2ncDD0KpZX7I9u9TPi7ee+Kgiw/uk7pw3nlfkvxaxiWfwy8iT319I5grcYSPA7AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:52:59.778588Z"},"content_sha256":"2b40e4c47b8b804946f11bb06c8ff2a04a215fe6fe1a867a1ebe3e287ea3a04d","schema_version":"1.0","event_id":"sha256:2b40e4c47b8b804946f11bb06c8ff2a04a215fe6fe1a867a1ebe3e287ea3a04d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXJNZIUNIATTLLBASMH4SBQY4R/bundle.json","state_url":"https://pith.science/pith/SXJNZIUNIATTLLBASMH4SBQY4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXJNZIUNIATTLLBASMH4SBQY4R/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-27T16:52:59Z","links":{"resolver":"https://pith.science/pith/SXJNZIUNIATTLLBASMH4SBQY4R","bundle":"https://pith.science/pith/SXJNZIUNIATTLLBASMH4SBQY4R/bundle.json","state":"https://pith.science/pith/SXJNZIUNIATTLLBASMH4SBQY4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXJNZIUNIATTLLBASMH4SBQY4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SXJNZIUNIATTLLBASMH4SBQY4R","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":"6b6fa4db86835947f9426ddefc87a7dcd4df899f0477ee3a4dac33bcb0d3a79f","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-18T02:14:36Z","title_canon_sha256":"8cddebaa5132f1d9a1afd4ce8e63c0540602b4c3c77a0bb7618cdebbf5d04d04"},"schema_version":"1.0","source":{"id":"1906.07341","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07341","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07341v1","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07341","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"SXJNZIUNIATT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SXJNZIUNIATTLLBA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SXJNZIUN","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:2b40e4c47b8b804946f11bb06c8ff2a04a215fe6fe1a867a1ebe3e287ea3a04d","target":"graph","created_at":"2026-05-17T23:43:08Z","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":"Traditionally, most of the existing attribute learning methods are trained based on the consensus of annotations aggregated from a limited number of annotators. However, the consensus might fail in settings, especially when a wide spectrum of annotators with different interests and comprehension about the attribute words are involved. In this paper, we develop a novel multi-task method to understand and predict personalized attribute annotations. Regarding the attribute preference learning for each annotator as a specific task, we first propose a multi-level task parameter decomposition to cap","authors_text":"Qianqian Xu, Qingming Huang, Xiaochun Cao, Zhiyong Yang","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-18T02:14:36Z","title":"Learning Personalized Attribute Preference via Multi-task AUC Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07341","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:a86769229a79f05616a554486c5631758b2d5cfd901eec80d13557565f750e7c","target":"record","created_at":"2026-05-17T23:43:08Z","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":"6b6fa4db86835947f9426ddefc87a7dcd4df899f0477ee3a4dac33bcb0d3a79f","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-18T02:14:36Z","title_canon_sha256":"8cddebaa5132f1d9a1afd4ce8e63c0540602b4c3c77a0bb7618cdebbf5d04d04"},"schema_version":"1.0","source":{"id":"1906.07341","kind":"arxiv","version":1}},"canonical_sha256":"95d2dca28d402735ac20930fc90618e459f09b20e39b61d630f85c32718d05cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95d2dca28d402735ac20930fc90618e459f09b20e39b61d630f85c32718d05cd","first_computed_at":"2026-05-17T23:43:08.155131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:08.155131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pJDzjydKM362vjNzN/sXmXiUxs9a4d8n9xERrH234HQyl17soeg9tRGrHOoAHgGpomv4cgjMY77Kj1Bjv6uwBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:08.155779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.07341","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a86769229a79f05616a554486c5631758b2d5cfd901eec80d13557565f750e7c","sha256:2b40e4c47b8b804946f11bb06c8ff2a04a215fe6fe1a867a1ebe3e287ea3a04d"],"state_sha256":"499335366c374ecfbb31fae8fdbfad98bef352a7d5f4cb4f85edc4a5d49f1c40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q85gNciIe7zEG3sCEd6fhdOZZBfUX8XaZeb899n+veUTV4Vndb0E/iyKdYaFEtqh7pSr9/m6OQcjZAP+asiwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:52:59.782634Z","bundle_sha256":"02c148e0b9e22b9c033350de76bc14adac09594a983e1545ccda5e40466209d5"}}