{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3AZP64ADFKUGPO3EEUYWAXNSBG","short_pith_number":"pith:3AZP64AD","canonical_record":{"source":{"id":"1703.06104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"16e5df935ca7c99f6e6473195a60c20579ebe5f1a3806b3c955a9c9b4c8fd80f","abstract_canon_sha256":"ebd2d1dc19aa4fa40bc653e1f6e4267f259a8a61a420fb5c25667869e49eb4f6"},"schema_version":"1.0"},"canonical_sha256":"d832ff70032aa867bb642531605db209a6e43210bcefa5500fbe81561c63d902","source":{"kind":"arxiv","id":"1703.06104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06104","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06104v1","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06104","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"3AZP64ADFKUG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3AZP64ADFKUGPO3E","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3AZP64AD","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3AZP64ADFKUGPO3EEUYWAXNSBG","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"16e5df935ca7c99f6e6473195a60c20579ebe5f1a3806b3c955a9c9b4c8fd80f","abstract_canon_sha256":"ebd2d1dc19aa4fa40bc653e1f6e4267f259a8a61a420fb5c25667869e49eb4f6"},"schema_version":"1.0"},"canonical_sha256":"d832ff70032aa867bb642531605db209a6e43210bcefa5500fbe81561c63d902","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:29.487769Z","signature_b64":"becGnv/sPBQC3t/FxshQz7X093xR6kOjW7NIXEQ4QHG/DMfwlFA+xX7cylke0Ivu2qH/W1GFG5DK5e6cd/K/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d832ff70032aa867bb642531605db209a6e43210bcefa5500fbe81561c63d902","last_reissued_at":"2026-05-18T00:48:29.487135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:29.487135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06104","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:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvEc7aLBcZSqsIDAySIYMujQWCZ6LL+yPLVrfZ3PIupBNpYka1Qj6rHIVbt5B+nJctI5murq4ytWZg8I2mKxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:19:40.220287Z"},"content_sha256":"503c7129c6290a9c7ef1a93f42d67acfdb0e4ebee3c4aea181b859d33ed5093a","schema_version":"1.0","event_id":"sha256:503c7129c6290a9c7ef1a93f42d67acfdb0e4ebee3c4aea181b859d33ed5093a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3AZP64ADFKUGPO3EEUYWAXNSBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonconvex One-bit Single-label Multi-label Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jieping Ye, Ming Lin, Shuang Qiu, Tingjin Luo","submitted_at":"2017-03-17T17:09:15Z","abstract_excerpt":"We study an extreme scenario in multi-label learning where each training instance is endowed with a single one-bit label out of multiple labels. We formulate this problem as a non-trivial special case of one-bit rank-one matrix sensing and develop an efficient non-convex algorithm based on alternating power iteration. The proposed algorithm is able to recover the underlying low-rank matrix model with linear convergence. For a rank-$k$ model with $d_1$ features and $d_2$ classes, the proposed algorithm achieves $O(\\epsilon)$ recovery error after retrieving $O(k^{1.5}d_1 d_2/\\epsilon)$ one-bit l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06104","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:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwT84hErK7fjWrshYNCboohKSvpOWgMC7in2wHu4kQSAVmmUjEQkbEyXRUwr26QfTIuep411S+6R2ELLQkh9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:19:40.221045Z"},"content_sha256":"d327f70f4a1cd03a97de6d4531a1ca444e028e5cbbb22ba1db976fe898b167b9","schema_version":"1.0","event_id":"sha256:d327f70f4a1cd03a97de6d4531a1ca444e028e5cbbb22ba1db976fe898b167b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AZP64ADFKUGPO3EEUYWAXNSBG/bundle.json","state_url":"https://pith.science/pith/3AZP64ADFKUGPO3EEUYWAXNSBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AZP64ADFKUGPO3EEUYWAXNSBG/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-01T02:19:40Z","links":{"resolver":"https://pith.science/pith/3AZP64ADFKUGPO3EEUYWAXNSBG","bundle":"https://pith.science/pith/3AZP64ADFKUGPO3EEUYWAXNSBG/bundle.json","state":"https://pith.science/pith/3AZP64ADFKUGPO3EEUYWAXNSBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AZP64ADFKUGPO3EEUYWAXNSBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3AZP64ADFKUGPO3EEUYWAXNSBG","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":"ebd2d1dc19aa4fa40bc653e1f6e4267f259a8a61a420fb5c25667869e49eb4f6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:15Z","title_canon_sha256":"16e5df935ca7c99f6e6473195a60c20579ebe5f1a3806b3c955a9c9b4c8fd80f"},"schema_version":"1.0","source":{"id":"1703.06104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06104","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06104v1","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06104","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"3AZP64ADFKUG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3AZP64ADFKUGPO3E","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3AZP64AD","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:d327f70f4a1cd03a97de6d4531a1ca444e028e5cbbb22ba1db976fe898b167b9","target":"graph","created_at":"2026-05-18T00:48:29Z","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 study an extreme scenario in multi-label learning where each training instance is endowed with a single one-bit label out of multiple labels. We formulate this problem as a non-trivial special case of one-bit rank-one matrix sensing and develop an efficient non-convex algorithm based on alternating power iteration. The proposed algorithm is able to recover the underlying low-rank matrix model with linear convergence. For a rank-$k$ model with $d_1$ features and $d_2$ classes, the proposed algorithm achieves $O(\\epsilon)$ recovery error after retrieving $O(k^{1.5}d_1 d_2/\\epsilon)$ one-bit l","authors_text":"Jieping Ye, Ming Lin, Shuang Qiu, Tingjin Luo","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:15Z","title":"Nonconvex One-bit Single-label Multi-label Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06104","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:503c7129c6290a9c7ef1a93f42d67acfdb0e4ebee3c4aea181b859d33ed5093a","target":"record","created_at":"2026-05-18T00:48:29Z","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":"ebd2d1dc19aa4fa40bc653e1f6e4267f259a8a61a420fb5c25667869e49eb4f6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:15Z","title_canon_sha256":"16e5df935ca7c99f6e6473195a60c20579ebe5f1a3806b3c955a9c9b4c8fd80f"},"schema_version":"1.0","source":{"id":"1703.06104","kind":"arxiv","version":1}},"canonical_sha256":"d832ff70032aa867bb642531605db209a6e43210bcefa5500fbe81561c63d902","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d832ff70032aa867bb642531605db209a6e43210bcefa5500fbe81561c63d902","first_computed_at":"2026-05-18T00:48:29.487135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:29.487135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"becGnv/sPBQC3t/FxshQz7X093xR6kOjW7NIXEQ4QHG/DMfwlFA+xX7cylke0Ivu2qH/W1GFG5DK5e6cd/K/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:29.487769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:503c7129c6290a9c7ef1a93f42d67acfdb0e4ebee3c4aea181b859d33ed5093a","sha256:d327f70f4a1cd03a97de6d4531a1ca444e028e5cbbb22ba1db976fe898b167b9"],"state_sha256":"ddaeb9a1e42f0d5820cc07217e66a99c6e33f92bd34b3c86a020af94977aafa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFtnuD1krXF2Fsnh5Rnvvk9YlOyf/FS/IqnBY46NetDkJ1ie9y6t2EieOIaKhoJo4e01BR0P/9JPH55xvOsADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:19:40.225076Z","bundle_sha256":"f87e03bc3e44179420b6e7fcf5cb5a4c38628c71c751be003d67cc687ae78fd0"}}