{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JQRP6YTVD6AW45XM5E2JFBEVBK","short_pith_number":"pith:JQRP6YTV","canonical_record":{"source":{"id":"1404.4104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-15T22:54:21Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"90653f090c3eb612d41663c4f1ed424613a8d8ebae503d10563ec5197ba36384","abstract_canon_sha256":"28f087bba2359255347de14bc8677e9ff516abec8dee9f13ab6df019396a8298"},"schema_version":"1.0"},"canonical_sha256":"4c22ff62751f816e76ece9349284950ab1eaae19be45fe1db6cb3d0ac07f54df","source":{"kind":"arxiv","id":"1404.4104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4104","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4104v1","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4104","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"JQRP6YTVD6AW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JQRP6YTVD6AW45XM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JQRP6YTV","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JQRP6YTVD6AW45XM5E2JFBEVBK","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-15T22:54:21Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"90653f090c3eb612d41663c4f1ed424613a8d8ebae503d10563ec5197ba36384","abstract_canon_sha256":"28f087bba2359255347de14bc8677e9ff516abec8dee9f13ab6df019396a8298"},"schema_version":"1.0"},"canonical_sha256":"4c22ff62751f816e76ece9349284950ab1eaae19be45fe1db6cb3d0ac07f54df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:06.244495Z","signature_b64":"Bj2mPi//EN1OXmn/q9mKgqrU9S+xxYKKbCGMuToTVJtxUldMcmYuZiIJYxlio6wpngmbKt/vbj+VRZnsx7eyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c22ff62751f816e76ece9349284950ab1eaae19be45fe1db6cb3d0ac07f54df","last_reissued_at":"2026-05-18T02:54:06.243805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:06.243805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4104","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-18T02:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0SNm+gFaCsyDJuQnPXbMimDLej8PfKLrmt3ZTxGb64miyGSfzFBJZPgxJ4yyCtDf+hgmNWcgC4NX5VVGnCgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:57:38.685496Z"},"content_sha256":"61e954b1d2d780f773825abcf6a328076270a723d34716b0f66960b74d7cbf4c","schema_version":"1.0","event_id":"sha256:61e954b1d2d780f773825abcf6a328076270a723d34716b0f66960b74d7cbf4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JQRP6YTVD6AW45XM5E2JFBEVBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Bilinear Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"math.OC","authors_text":"Jianing V. Shi, Richard G. Baraniuk, Yangyang Xu","submitted_at":"2014-04-15T22:54:21Z","abstract_excerpt":"In this paper, we introduce the concept of sparse bilinear logistic regression for decision problems involving explanatory variables that are two-dimensional matrices. Such problems are common in computer vision, brain-computer interfaces, style/content factorization, and parallel factor analysis. The underlying optimization problem is bi-convex; we study its solution and develop an efficient algorithm based on block coordinate descent. We provide a theoretical guarantee for global convergence and estimate the asymptotical convergence rate using the Kurdyka-{\\L}ojasiewicz inequality. A range o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4104","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-18T02:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5y4dSwQcltWff1Co3uhlUylMEGzyFfrujuOWAlxNKGmXs2sWhwAmkgSBcmGO3kchkON8rcyhoEU0MWFk3s5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:57:38.686225Z"},"content_sha256":"ff3b17ec98b7dd285319fb1308940cd33e08b416d080425333ed58c1374e0f6b","schema_version":"1.0","event_id":"sha256:ff3b17ec98b7dd285319fb1308940cd33e08b416d080425333ed58c1374e0f6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQRP6YTVD6AW45XM5E2JFBEVBK/bundle.json","state_url":"https://pith.science/pith/JQRP6YTVD6AW45XM5E2JFBEVBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQRP6YTVD6AW45XM5E2JFBEVBK/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-25T08:57:38Z","links":{"resolver":"https://pith.science/pith/JQRP6YTVD6AW45XM5E2JFBEVBK","bundle":"https://pith.science/pith/JQRP6YTVD6AW45XM5E2JFBEVBK/bundle.json","state":"https://pith.science/pith/JQRP6YTVD6AW45XM5E2JFBEVBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQRP6YTVD6AW45XM5E2JFBEVBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JQRP6YTVD6AW45XM5E2JFBEVBK","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":"28f087bba2359255347de14bc8677e9ff516abec8dee9f13ab6df019396a8298","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-15T22:54:21Z","title_canon_sha256":"90653f090c3eb612d41663c4f1ed424613a8d8ebae503d10563ec5197ba36384"},"schema_version":"1.0","source":{"id":"1404.4104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4104","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4104v1","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4104","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"JQRP6YTVD6AW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JQRP6YTVD6AW45XM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JQRP6YTV","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:ff3b17ec98b7dd285319fb1308940cd33e08b416d080425333ed58c1374e0f6b","target":"graph","created_at":"2026-05-18T02:54:06Z","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":"In this paper, we introduce the concept of sparse bilinear logistic regression for decision problems involving explanatory variables that are two-dimensional matrices. Such problems are common in computer vision, brain-computer interfaces, style/content factorization, and parallel factor analysis. The underlying optimization problem is bi-convex; we study its solution and develop an efficient algorithm based on block coordinate descent. We provide a theoretical guarantee for global convergence and estimate the asymptotical convergence rate using the Kurdyka-{\\L}ojasiewicz inequality. A range o","authors_text":"Jianing V. Shi, Richard G. Baraniuk, Yangyang Xu","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-15T22:54:21Z","title":"Sparse Bilinear Logistic Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4104","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:61e954b1d2d780f773825abcf6a328076270a723d34716b0f66960b74d7cbf4c","target":"record","created_at":"2026-05-18T02:54:06Z","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":"28f087bba2359255347de14bc8677e9ff516abec8dee9f13ab6df019396a8298","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-15T22:54:21Z","title_canon_sha256":"90653f090c3eb612d41663c4f1ed424613a8d8ebae503d10563ec5197ba36384"},"schema_version":"1.0","source":{"id":"1404.4104","kind":"arxiv","version":1}},"canonical_sha256":"4c22ff62751f816e76ece9349284950ab1eaae19be45fe1db6cb3d0ac07f54df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c22ff62751f816e76ece9349284950ab1eaae19be45fe1db6cb3d0ac07f54df","first_computed_at":"2026-05-18T02:54:06.243805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:06.243805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bj2mPi//EN1OXmn/q9mKgqrU9S+xxYKKbCGMuToTVJtxUldMcmYuZiIJYxlio6wpngmbKt/vbj+VRZnsx7eyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:06.244495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61e954b1d2d780f773825abcf6a328076270a723d34716b0f66960b74d7cbf4c","sha256:ff3b17ec98b7dd285319fb1308940cd33e08b416d080425333ed58c1374e0f6b"],"state_sha256":"282a2f0b13f91be2f6d4bfd90a140f223421c2ca87bdf8add5e55de6a5cde2c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebXnBjhRxptd4tz9lBsSerXJBY5zDsnHyzW5N1Ezo92tmSCYGfnRXo99v9F0Txc+Ewcbsd6uRWeSem9UaHN6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:57:38.690479Z","bundle_sha256":"ca3b028605360a017771ec8dd9ee61c5132bc6b97aceb7e7eb6953be77c2365a"}}