{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L7T7N7AG3LCH6WDRNP76TCBMBV","short_pith_number":"pith:L7T7N7AG","canonical_record":{"source":{"id":"1506.07613","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T04:56:50Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"ec8034ecf138edabe2f1a615b634c26debddaa1d3e96b1827fc2426bed01eb4d","abstract_canon_sha256":"ea00973d427d250aa41030d8a9e7730d5568b1f9455cacdaa481a3bd87cf02a0"},"schema_version":"1.0"},"canonical_sha256":"5fe7f6fc06dac47f58716bffe9882c0d40a5e2c63ae549d371a55c87068c6325","source":{"kind":"arxiv","id":"1506.07613","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07613","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07613v3","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07613","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"L7T7N7AG3LCH","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7T7N7AG3LCH6WDR","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7T7N7AG","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L7T7N7AG3LCH6WDRNP76TCBMBV","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07613","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T04:56:50Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"ec8034ecf138edabe2f1a615b634c26debddaa1d3e96b1827fc2426bed01eb4d","abstract_canon_sha256":"ea00973d427d250aa41030d8a9e7730d5568b1f9455cacdaa481a3bd87cf02a0"},"schema_version":"1.0"},"canonical_sha256":"5fe7f6fc06dac47f58716bffe9882c0d40a5e2c63ae549d371a55c87068c6325","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:57.078807Z","signature_b64":"sHN+nI6QC/rJCWQxrM4gQe8y+dAFQ6Tt/CLFMezaWPX2AgtJNXg55yE+DDQs/3WE8thXVsiR2zSqQoRHsorcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fe7f6fc06dac47f58716bffe9882c0d40a5e2c63ae549d371a55c87068c6325","last_reissued_at":"2026-05-17T23:45:57.078368Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:57.078368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07613","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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeQ/Z2Nk+OVSc92nKRBNN1Ht+E+AG5NegcmK4AzovxM+AaLlPV+0dOnxzNKzD7m0JXPLGUTl0b2j+LPXc/jHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:27:27.842976Z"},"content_sha256":"2297c5a581d64042d982463e87b9eae79f80645bdade34f863d0500bf6fc775e","schema_version":"1.0","event_id":"sha256:2297c5a581d64042d982463e87b9eae79f80645bdade34f863d0500bf6fc775e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L7T7N7AG3LCH6WDRNP76TCBMBV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Majorization-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.CV","authors_text":"Kun He, Pedro Felzenszwalb, Reza Aghajani, Sobhan Naderi Parizi, Stan Sclaroff","submitted_at":"2015-06-25T04:56:50Z","abstract_excerpt":"Non-convex optimization is ubiquitous in machine learning. Majorization-Minimization (MM) is a powerful iterative procedure for optimizing non-convex functions that works by optimizing a sequence of bounds on the function. In MM, the bound at each iteration is required to \\emph{touch} the objective function at the optimizer of the previous bound. We show that this touching constraint is unnecessary and overly restrictive. We generalize MM by relaxing this constraint, and propose a new optimization framework, named Generalized Majorization-Minimization (G-MM), that is more flexible. For instanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07613","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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"piBBtfX3t/yIDWsqbb83d3hOnQYzcJFz2Jul5zBBSHIjYdz5POhrM9/Pggn0FlDjJgqC/a7hhdfJwTHMz2tcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:27:27.843724Z"},"content_sha256":"ec999c0a754faad7926fa8de4a926e43d104a02b80cb5c1946e1ac0c37eae4eb","schema_version":"1.0","event_id":"sha256:ec999c0a754faad7926fa8de4a926e43d104a02b80cb5c1946e1ac0c37eae4eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7T7N7AG3LCH6WDRNP76TCBMBV/bundle.json","state_url":"https://pith.science/pith/L7T7N7AG3LCH6WDRNP76TCBMBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7T7N7AG3LCH6WDRNP76TCBMBV/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-30T22:27:27Z","links":{"resolver":"https://pith.science/pith/L7T7N7AG3LCH6WDRNP76TCBMBV","bundle":"https://pith.science/pith/L7T7N7AG3LCH6WDRNP76TCBMBV/bundle.json","state":"https://pith.science/pith/L7T7N7AG3LCH6WDRNP76TCBMBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7T7N7AG3LCH6WDRNP76TCBMBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L7T7N7AG3LCH6WDRNP76TCBMBV","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":"ea00973d427d250aa41030d8a9e7730d5568b1f9455cacdaa481a3bd87cf02a0","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T04:56:50Z","title_canon_sha256":"ec8034ecf138edabe2f1a615b634c26debddaa1d3e96b1827fc2426bed01eb4d"},"schema_version":"1.0","source":{"id":"1506.07613","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07613","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07613v3","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07613","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"L7T7N7AG3LCH","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7T7N7AG3LCH6WDR","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7T7N7AG","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:ec999c0a754faad7926fa8de4a926e43d104a02b80cb5c1946e1ac0c37eae4eb","target":"graph","created_at":"2026-05-17T23:45:57Z","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":"Non-convex optimization is ubiquitous in machine learning. Majorization-Minimization (MM) is a powerful iterative procedure for optimizing non-convex functions that works by optimizing a sequence of bounds on the function. In MM, the bound at each iteration is required to \\emph{touch} the objective function at the optimizer of the previous bound. We show that this touching constraint is unnecessary and overly restrictive. We generalize MM by relaxing this constraint, and propose a new optimization framework, named Generalized Majorization-Minimization (G-MM), that is more flexible. For instanc","authors_text":"Kun He, Pedro Felzenszwalb, Reza Aghajani, Sobhan Naderi Parizi, Stan Sclaroff","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T04:56:50Z","title":"Generalized Majorization-Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07613","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:2297c5a581d64042d982463e87b9eae79f80645bdade34f863d0500bf6fc775e","target":"record","created_at":"2026-05-17T23:45:57Z","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":"ea00973d427d250aa41030d8a9e7730d5568b1f9455cacdaa481a3bd87cf02a0","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T04:56:50Z","title_canon_sha256":"ec8034ecf138edabe2f1a615b634c26debddaa1d3e96b1827fc2426bed01eb4d"},"schema_version":"1.0","source":{"id":"1506.07613","kind":"arxiv","version":3}},"canonical_sha256":"5fe7f6fc06dac47f58716bffe9882c0d40a5e2c63ae549d371a55c87068c6325","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fe7f6fc06dac47f58716bffe9882c0d40a5e2c63ae549d371a55c87068c6325","first_computed_at":"2026-05-17T23:45:57.078368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:57.078368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sHN+nI6QC/rJCWQxrM4gQe8y+dAFQ6Tt/CLFMezaWPX2AgtJNXg55yE+DDQs/3WE8thXVsiR2zSqQoRHsorcBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:57.078807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07613","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2297c5a581d64042d982463e87b9eae79f80645bdade34f863d0500bf6fc775e","sha256:ec999c0a754faad7926fa8de4a926e43d104a02b80cb5c1946e1ac0c37eae4eb"],"state_sha256":"8d3a9b2064b2d715af9658b2bd70ade3bf1747ccf163a81ababf34bdd6e641e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxibpEgR8NttmLUdJRzgAM6ZahNMbXjKfvuTbE8dUAfaR3xD+iOwz6OT6Bz+YoPABlRCBsiNA1sVyrWcXg+BCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:27:27.847822Z","bundle_sha256":"b6742639911d9a4b9278c4485bb8f9955b1d2ec095228e0056177363f313b994"}}