{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I3EKMNBWR2RKRLG4WV2FJRJSA4","short_pith_number":"pith:I3EKMNBW","canonical_record":{"source":{"id":"1404.6871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-28T05:52:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"5e515d4d641d16569aa280ffec29cd1298ff7eafff684d06d5a5c54cc1ff0e89","abstract_canon_sha256":"b8a8bf84d86f2884016a66fd58b4c6ceac798b89efac51bbce79716310ebb9e5"},"schema_version":"1.0"},"canonical_sha256":"46c8a634368ea2a8acdcb57454c532072ec12779863338409d7143f2086ab7f0","source":{"kind":"arxiv","id":"1404.6871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6871","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6871v1","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6871","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"I3EKMNBWR2RK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3EKMNBWR2RKRLG4","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3EKMNBW","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I3EKMNBWR2RKRLG4WV2FJRJSA4","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-28T05:52:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"5e515d4d641d16569aa280ffec29cd1298ff7eafff684d06d5a5c54cc1ff0e89","abstract_canon_sha256":"b8a8bf84d86f2884016a66fd58b4c6ceac798b89efac51bbce79716310ebb9e5"},"schema_version":"1.0"},"canonical_sha256":"46c8a634368ea2a8acdcb57454c532072ec12779863338409d7143f2086ab7f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:05.694659Z","signature_b64":"HGC/xW/PtaNMLEuHCuzBZoXbBUGy7f4iRlwOzYee6Pu6yqiBKdBokqHgOMyvzgtQK7lLhXoP3i63wKj0TswwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c8a634368ea2a8acdcb57454c532072ec12779863338409d7143f2086ab7f0","last_reissued_at":"2026-05-18T02:53:05.694092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:05.694092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6871","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:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8310XLh8JSnWl/VX8eKBUB1uRkFHaOYqdV+CrcJeLPdC0hKvYtK+42tE/H8juDPhxUbF9ej0uEPnmiZOq5KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:57:49.656813Z"},"content_sha256":"9950caaf35e2638af0829de986f90f881f550a43acf8e319e68f90c98600c4b1","schema_version":"1.0","event_id":"sha256:9950caaf35e2638af0829de986f90f881f550a43acf8e319e68f90c98600c4b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I3EKMNBWR2RKRLG4WV2FJRJSA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Iteratively Reweighted Algorithm with Multiple Splitting for Nonconvex Sparsity Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NA","authors_text":"Canyi Lu, Shuicheng Yan, Yunchao Wei, Zhouchen Lin","submitted_at":"2014-04-28T05:52:30Z","abstract_excerpt":"This paper proposes the Proximal Iteratively REweighted (PIRE) algorithm for solving a general problem, which involves a large body of nonconvex sparse and structured sparse related problems. Comparing with previous iterative solvers for nonconvex sparse problem, PIRE is much more general and efficient. The computational cost of PIRE in each iteration is usually as low as the state-of-the-art convex solvers. We further propose the PIRE algorithm with Parallel Splitting (PIRE-PS) and PIRE algorithm with Alternative Updating (PIRE-AU) to handle the multi-variable problems. In theory, we prove th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6871","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:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V47oOMf5dFkfkvn/iVHE9la3TvjcGkxyPgAx57I41b8ROVtT4rEqoWbxa78b0mjgB4+22IbVV8Wu4/aT1PcGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:57:49.657470Z"},"content_sha256":"bb01b995365f8a460ecdb3e4728f47b19e908cc320903a7767821d801e5e54b9","schema_version":"1.0","event_id":"sha256:bb01b995365f8a460ecdb3e4728f47b19e908cc320903a7767821d801e5e54b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3EKMNBWR2RKRLG4WV2FJRJSA4/bundle.json","state_url":"https://pith.science/pith/I3EKMNBWR2RKRLG4WV2FJRJSA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3EKMNBWR2RKRLG4WV2FJRJSA4/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-05T03:57:49Z","links":{"resolver":"https://pith.science/pith/I3EKMNBWR2RKRLG4WV2FJRJSA4","bundle":"https://pith.science/pith/I3EKMNBWR2RKRLG4WV2FJRJSA4/bundle.json","state":"https://pith.science/pith/I3EKMNBWR2RKRLG4WV2FJRJSA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3EKMNBWR2RKRLG4WV2FJRJSA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I3EKMNBWR2RKRLG4WV2FJRJSA4","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":"b8a8bf84d86f2884016a66fd58b4c6ceac798b89efac51bbce79716310ebb9e5","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-28T05:52:30Z","title_canon_sha256":"5e515d4d641d16569aa280ffec29cd1298ff7eafff684d06d5a5c54cc1ff0e89"},"schema_version":"1.0","source":{"id":"1404.6871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6871","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6871v1","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6871","created_at":"2026-05-18T02:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"I3EKMNBWR2RK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3EKMNBWR2RKRLG4","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3EKMNBW","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:bb01b995365f8a460ecdb3e4728f47b19e908cc320903a7767821d801e5e54b9","target":"graph","created_at":"2026-05-18T02:53:05Z","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":"This paper proposes the Proximal Iteratively REweighted (PIRE) algorithm for solving a general problem, which involves a large body of nonconvex sparse and structured sparse related problems. Comparing with previous iterative solvers for nonconvex sparse problem, PIRE is much more general and efficient. The computational cost of PIRE in each iteration is usually as low as the state-of-the-art convex solvers. We further propose the PIRE algorithm with Parallel Splitting (PIRE-PS) and PIRE algorithm with Alternative Updating (PIRE-AU) to handle the multi-variable problems. In theory, we prove th","authors_text":"Canyi Lu, Shuicheng Yan, Yunchao Wei, Zhouchen Lin","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-28T05:52:30Z","title":"Proximal Iteratively Reweighted Algorithm with Multiple Splitting for Nonconvex Sparsity Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6871","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:9950caaf35e2638af0829de986f90f881f550a43acf8e319e68f90c98600c4b1","target":"record","created_at":"2026-05-18T02:53:05Z","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":"b8a8bf84d86f2884016a66fd58b4c6ceac798b89efac51bbce79716310ebb9e5","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-28T05:52:30Z","title_canon_sha256":"5e515d4d641d16569aa280ffec29cd1298ff7eafff684d06d5a5c54cc1ff0e89"},"schema_version":"1.0","source":{"id":"1404.6871","kind":"arxiv","version":1}},"canonical_sha256":"46c8a634368ea2a8acdcb57454c532072ec12779863338409d7143f2086ab7f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46c8a634368ea2a8acdcb57454c532072ec12779863338409d7143f2086ab7f0","first_computed_at":"2026-05-18T02:53:05.694092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:05.694092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HGC/xW/PtaNMLEuHCuzBZoXbBUGy7f4iRlwOzYee6Pu6yqiBKdBokqHgOMyvzgtQK7lLhXoP3i63wKj0TswwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:05.694659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9950caaf35e2638af0829de986f90f881f550a43acf8e319e68f90c98600c4b1","sha256:bb01b995365f8a460ecdb3e4728f47b19e908cc320903a7767821d801e5e54b9"],"state_sha256":"f5dfb5bfc540693c1b3a24ca4d8a13f99b38d0e417dbf46fd073f9024545cd14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utLM/CmIIbnGNAzG61+aLjjY8C/3wwLM7qrUaB/0u2JUKawVK34k5LYsaOzAhiv3fk1R630Fb+7G/6lO12nyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:57:49.661199Z","bundle_sha256":"1be049d607e8549e86a4bcc379f664f79443a283bff79d3b598a65361a2c2c2b"}}