{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MTRMMH3T6O2TXIPFCXBMKQSO7Q","short_pith_number":"pith:MTRMMH3T","schema_version":"1.0","canonical_sha256":"64e2c61f73f3b53ba1e515c2c5424efc2db742b0e71491ec5e68aecbc0b4a852","source":{"kind":"arxiv","id":"1501.07315","version":3},"attestation_state":"computed","paper":{"title":"Per-Block-Convex Data Modeling by Accelerated Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios B. Giannakis, Konstantinos Slavakis","submitted_at":"2015-01-29T00:15:28Z","abstract_excerpt":"Applications involving dictionary learning, non-negative matrix factorization, subspace clustering, and parallel factor tensor decomposition tasks motivate well algorithms for per-block-convex and non-smooth optimization problems. By leveraging the stochastic approximation paradigm and first-order acceleration schemes, this paper develops an online and modular learning algorithm for a large class of non-convex data models, where convexity is manifested only per-block of variables whenever the rest of them are held fixed. The advocated algorithm incurs computational complexity that scales linea"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1501.07315","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-29T00:15:28Z","cross_cats_sorted":[],"title_canon_sha256":"33975a4232a0840998767c23ce435b29d5e0059dc88551e2d6dbec60a8bde8ad","abstract_canon_sha256":"e00b4e659fc10b71a7830b718d6bbbd88e57a2c29a1883c20293e578ba248080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:04.365713Z","signature_b64":"hw0yVjXQv7uO+THztj4ZJtFHdQ5hvWF2FLSP8ChVvxPFhmyxyIXHWQ7DIJjktw44+d7DiQyN4ZTC3T48e/6rBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e2c61f73f3b53ba1e515c2c5424efc2db742b0e71491ec5e68aecbc0b4a852","last_reissued_at":"2026-05-18T00:52:04.365243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:04.365243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Per-Block-Convex Data Modeling by Accelerated Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios B. Giannakis, Konstantinos Slavakis","submitted_at":"2015-01-29T00:15:28Z","abstract_excerpt":"Applications involving dictionary learning, non-negative matrix factorization, subspace clustering, and parallel factor tensor decomposition tasks motivate well algorithms for per-block-convex and non-smooth optimization problems. By leveraging the stochastic approximation paradigm and first-order acceleration schemes, this paper develops an online and modular learning algorithm for a large class of non-convex data models, where convexity is manifested only per-block of variables whenever the rest of them are held fixed. The advocated algorithm incurs computational complexity that scales linea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07315","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.07315","created_at":"2026-05-18T00:52:04.365322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07315v3","created_at":"2026-05-18T00:52:04.365322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07315","created_at":"2026-05-18T00:52:04.365322+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTRMMH3T6O2T","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTRMMH3T6O2TXIPF","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTRMMH3T","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q","json":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q.json","graph_json":"https://pith.science/api/pith-number/MTRMMH3T6O2TXIPFCXBMKQSO7Q/graph.json","events_json":"https://pith.science/api/pith-number/MTRMMH3T6O2TXIPFCXBMKQSO7Q/events.json","paper":"https://pith.science/paper/MTRMMH3T"},"agent_actions":{"view_html":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q","download_json":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q.json","view_paper":"https://pith.science/paper/MTRMMH3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07315&json=true","fetch_graph":"https://pith.science/api/pith-number/MTRMMH3T6O2TXIPFCXBMKQSO7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/MTRMMH3T6O2TXIPFCXBMKQSO7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q/action/storage_attestation","attest_author":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q/action/author_attestation","sign_citation":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q/action/citation_signature","submit_replication":"https://pith.science/pith/MTRMMH3T6O2TXIPFCXBMKQSO7Q/action/replication_record"}},"created_at":"2026-05-18T00:52:04.365322+00:00","updated_at":"2026-05-18T00:52:04.365322+00:00"}