{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QPDWLUFG2NN4ZBQB3FSRRLIXQX","short_pith_number":"pith:QPDWLUFG","canonical_record":{"source":{"id":"1508.02958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-12T15:35:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ab6d5e69bbd697e30a9a88ea217de846158e9277be4d0bc31f4b230f96838d20","abstract_canon_sha256":"cc17b048a3e4f0945c584b54158285f53a191dc999bec715d7ec1aced4cdc709"},"schema_version":"1.0"},"canonical_sha256":"83c765d0a6d35bcc8601d96518ad1785d549124d596b76087540c4484779a311","source":{"kind":"arxiv","id":"1508.02958","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02958","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02958v2","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02958","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"QPDWLUFG2NN4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QPDWLUFG2NN4ZBQB","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QPDWLUFG","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QPDWLUFG2NN4ZBQB3FSRRLIXQX","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-12T15:35:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ab6d5e69bbd697e30a9a88ea217de846158e9277be4d0bc31f4b230f96838d20","abstract_canon_sha256":"cc17b048a3e4f0945c584b54158285f53a191dc999bec715d7ec1aced4cdc709"},"schema_version":"1.0"},"canonical_sha256":"83c765d0a6d35bcc8601d96518ad1785d549124d596b76087540c4484779a311","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:31.381597Z","signature_b64":"CBihaShXNECN4GLcfRaaGST7vhDyw74rdPBySXoy21JZ7oaKLoGs7a8BgXiTV7ryZu2xc7I5Mg4bbw0ZRVbHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83c765d0a6d35bcc8601d96518ad1785d549124d596b76087540c4484779a311","last_reissued_at":"2026-05-18T01:29:31.381055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:31.381055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02958","source_version":2,"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-18T01:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+ITATJWoWierFl0QVRDyamMqZDs7IT4WS2I027x29Q/FDQCSKez2X2TzV4t0K08Fk5nhpdBUCR2ErGNdyNhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:00:19.629266Z"},"content_sha256":"0894f9902a6d8149da239cfd2941ec834178cfb77567f0daad5b694639153fab","schema_version":"1.0","event_id":"sha256:0894f9902a6d8149da239cfd2941ec834178cfb77567f0daad5b694639153fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QPDWLUFG2NN4ZBQB3FSRRLIXQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Design of Majorizers for Large-Scale Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.CO","authors_text":"Jeffrey A. Fessler, Madison G. McGaffin","submitted_at":"2015-08-12T15:35:02Z","abstract_excerpt":"Iterative majorize-minimize (MM) (also called optimization transfer) algorithms solve challenging numerical optimization problems by solving a series of \"easier\" optimization problems that are constructed to guarantee monotonic descent of the cost function. Many MM algorithms replace a computationally expensive Hessian matrix with another more computationally convenient majorizing matrix. These majorizing matrices are often generated using various matrix inequalities, and consequently the set of available majorizers is limited to structures for which these matrix inequalities can be efficientl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02958","kind":"arxiv","version":2},"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-18T01:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQ7OLoqhIBU/AzBQOgQ3Td7FWx4z5uChnnFyM0VjGpqyOfNNmSd5Ocg8Wi3e4nIXiV93w1OM9YD1kPvps8W3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:00:19.629641Z"},"content_sha256":"61d924b72973ebd22b6b9743a218d38a31de67a4881885194a5aa613a0c1fe65","schema_version":"1.0","event_id":"sha256:61d924b72973ebd22b6b9743a218d38a31de67a4881885194a5aa613a0c1fe65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPDWLUFG2NN4ZBQB3FSRRLIXQX/bundle.json","state_url":"https://pith.science/pith/QPDWLUFG2NN4ZBQB3FSRRLIXQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPDWLUFG2NN4ZBQB3FSRRLIXQX/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-11T10:00:19Z","links":{"resolver":"https://pith.science/pith/QPDWLUFG2NN4ZBQB3FSRRLIXQX","bundle":"https://pith.science/pith/QPDWLUFG2NN4ZBQB3FSRRLIXQX/bundle.json","state":"https://pith.science/pith/QPDWLUFG2NN4ZBQB3FSRRLIXQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPDWLUFG2NN4ZBQB3FSRRLIXQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QPDWLUFG2NN4ZBQB3FSRRLIXQX","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":"cc17b048a3e4f0945c584b54158285f53a191dc999bec715d7ec1aced4cdc709","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-12T15:35:02Z","title_canon_sha256":"ab6d5e69bbd697e30a9a88ea217de846158e9277be4d0bc31f4b230f96838d20"},"schema_version":"1.0","source":{"id":"1508.02958","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02958","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02958v2","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02958","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"QPDWLUFG2NN4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QPDWLUFG2NN4ZBQB","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QPDWLUFG","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:61d924b72973ebd22b6b9743a218d38a31de67a4881885194a5aa613a0c1fe65","target":"graph","created_at":"2026-05-18T01:29:31Z","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":"Iterative majorize-minimize (MM) (also called optimization transfer) algorithms solve challenging numerical optimization problems by solving a series of \"easier\" optimization problems that are constructed to guarantee monotonic descent of the cost function. Many MM algorithms replace a computationally expensive Hessian matrix with another more computationally convenient majorizing matrix. These majorizing matrices are often generated using various matrix inequalities, and consequently the set of available majorizers is limited to structures for which these matrix inequalities can be efficientl","authors_text":"Jeffrey A. Fessler, Madison G. McGaffin","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-12T15:35:02Z","title":"Algorithmic Design of Majorizers for Large-Scale Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02958","kind":"arxiv","version":2},"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:0894f9902a6d8149da239cfd2941ec834178cfb77567f0daad5b694639153fab","target":"record","created_at":"2026-05-18T01:29:31Z","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":"cc17b048a3e4f0945c584b54158285f53a191dc999bec715d7ec1aced4cdc709","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-12T15:35:02Z","title_canon_sha256":"ab6d5e69bbd697e30a9a88ea217de846158e9277be4d0bc31f4b230f96838d20"},"schema_version":"1.0","source":{"id":"1508.02958","kind":"arxiv","version":2}},"canonical_sha256":"83c765d0a6d35bcc8601d96518ad1785d549124d596b76087540c4484779a311","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83c765d0a6d35bcc8601d96518ad1785d549124d596b76087540c4484779a311","first_computed_at":"2026-05-18T01:29:31.381055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:31.381055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CBihaShXNECN4GLcfRaaGST7vhDyw74rdPBySXoy21JZ7oaKLoGs7a8BgXiTV7ryZu2xc7I5Mg4bbw0ZRVbHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:31.381597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02958","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0894f9902a6d8149da239cfd2941ec834178cfb77567f0daad5b694639153fab","sha256:61d924b72973ebd22b6b9743a218d38a31de67a4881885194a5aa613a0c1fe65"],"state_sha256":"fd7599e5b514a91ff736396adbd115a6d9feb274e586110fb862053391d5df52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4DdOxKIubV+KoeGvHc6TMvkyfCzmelKSzzIh+f5GjjVycEV88BosYyD7aCbd/iRaFOdDNr/pKZ381SVPHQRtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:00:19.631733Z","bundle_sha256":"2b78f3cde2176e110f130b86584d4a569e0eaccef23b9067f9f673204eb4333b"}}