{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KK75LW7WOZLGNVX7GTAXUWN7DN","short_pith_number":"pith:KK75LW7W","canonical_record":{"source":{"id":"1208.0651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.CO","submitted_at":"2012-08-03T04:06:32Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"04c00835ed9ef8e86748d796d6680f7683611513b9aa98094c1da8aee5823af2","abstract_canon_sha256":"2f360fb1d89910d1e875be85b917ac2a9cf15acc85ad0382ab9be7e1dfb34b0b"},"schema_version":"1.0"},"canonical_sha256":"52bfd5dbf6765666d6ff34c17a59bf1b74745f05379bae654030db184f3e35c7","source":{"kind":"arxiv","id":"1208.0651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0651","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0651v1","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0651","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"KK75LW7WOZLG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KK75LW7WOZLGNVX7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KK75LW7W","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KK75LW7WOZLGNVX7GTAXUWN7DN","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.CO","submitted_at":"2012-08-03T04:06:32Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"04c00835ed9ef8e86748d796d6680f7683611513b9aa98094c1da8aee5823af2","abstract_canon_sha256":"2f360fb1d89910d1e875be85b917ac2a9cf15acc85ad0382ab9be7e1dfb34b0b"},"schema_version":"1.0"},"canonical_sha256":"52bfd5dbf6765666d6ff34c17a59bf1b74745f05379bae654030db184f3e35c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:32.102424Z","signature_b64":"YIPzfe0hosUE5n2AkqcA+29djJVi4rGxMgFCTWfAFDXGiiPiodrbeSqo59f6G75CZn77XVjUEv5vzngaC642Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52bfd5dbf6765666d6ff34c17a59bf1b74745f05379bae654030db184f3e35c7","last_reissued_at":"2026-05-18T03:49:32.101521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:32.101521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0651","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-18T03:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xrmi0kP/TSZ7lzrtbBidWwdDBj/Yk5cO258ETovWQblzRXp1I7stEcClm8T6xBNGCofcaidYZ0BMHnERHHcRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:30:31.096920Z"},"content_sha256":"98a1caa815e085fd399c88ba827d04ef86cb9883c3ed0c5a293782c75bc4ca3a","schema_version":"1.0","event_id":"sha256:98a1caa815e085fd399c88ba827d04ef86cb9883c3ed0c5a293782c75bc4ca3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KK75LW7WOZLGNVX7GTAXUWN7DN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Accurate Algorithms for Re-Weighted L1-Norm Minimization","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"stat.CO","authors_text":"Justin Romberg, M. Salman Asif","submitted_at":"2012-08-03T04:06:32Z","abstract_excerpt":"To recover a sparse signal from an underdetermined system, we often solve a constrained L1-norm minimization problem. In many cases, the signal sparsity and the recovery performance can be further improved by replacing the L1 norm with a \"weighted\" L1 norm. Without any prior information about nonzero elements of the signal, the procedure for selecting weights is iterative in nature. Common approaches update the weights at every iteration using the solution of a weighted L1 problem from the previous iteration.\n  In this paper, we present two homotopy-based algorithms that efficiently solve rewe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0651","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-18T03:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edSKHYQpOfdRRjh29hKadgO5UaIGckoHlO+eVJgP0giFTMrC9ZQOT0ww15utVf8GKdZYMEgkWklE139635FSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:30:31.097273Z"},"content_sha256":"339e2631797cb71184aacd84d20f5c16c5cf79231d2d3e5d7315b6f45fb5a50a","schema_version":"1.0","event_id":"sha256:339e2631797cb71184aacd84d20f5c16c5cf79231d2d3e5d7315b6f45fb5a50a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KK75LW7WOZLGNVX7GTAXUWN7DN/bundle.json","state_url":"https://pith.science/pith/KK75LW7WOZLGNVX7GTAXUWN7DN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KK75LW7WOZLGNVX7GTAXUWN7DN/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-27T18:30:31Z","links":{"resolver":"https://pith.science/pith/KK75LW7WOZLGNVX7GTAXUWN7DN","bundle":"https://pith.science/pith/KK75LW7WOZLGNVX7GTAXUWN7DN/bundle.json","state":"https://pith.science/pith/KK75LW7WOZLGNVX7GTAXUWN7DN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KK75LW7WOZLGNVX7GTAXUWN7DN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KK75LW7WOZLGNVX7GTAXUWN7DN","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":"2f360fb1d89910d1e875be85b917ac2a9cf15acc85ad0382ab9be7e1dfb34b0b","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.CO","submitted_at":"2012-08-03T04:06:32Z","title_canon_sha256":"04c00835ed9ef8e86748d796d6680f7683611513b9aa98094c1da8aee5823af2"},"schema_version":"1.0","source":{"id":"1208.0651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0651","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0651v1","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0651","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"KK75LW7WOZLG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KK75LW7WOZLGNVX7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KK75LW7W","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:339e2631797cb71184aacd84d20f5c16c5cf79231d2d3e5d7315b6f45fb5a50a","target":"graph","created_at":"2026-05-18T03:49:32Z","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":"To recover a sparse signal from an underdetermined system, we often solve a constrained L1-norm minimization problem. In many cases, the signal sparsity and the recovery performance can be further improved by replacing the L1 norm with a \"weighted\" L1 norm. Without any prior information about nonzero elements of the signal, the procedure for selecting weights is iterative in nature. Common approaches update the weights at every iteration using the solution of a weighted L1 problem from the previous iteration.\n  In this paper, we present two homotopy-based algorithms that efficiently solve rewe","authors_text":"Justin Romberg, M. Salman Asif","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.CO","submitted_at":"2012-08-03T04:06:32Z","title":"Fast and Accurate Algorithms for Re-Weighted L1-Norm Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0651","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:98a1caa815e085fd399c88ba827d04ef86cb9883c3ed0c5a293782c75bc4ca3a","target":"record","created_at":"2026-05-18T03:49:32Z","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":"2f360fb1d89910d1e875be85b917ac2a9cf15acc85ad0382ab9be7e1dfb34b0b","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.CO","submitted_at":"2012-08-03T04:06:32Z","title_canon_sha256":"04c00835ed9ef8e86748d796d6680f7683611513b9aa98094c1da8aee5823af2"},"schema_version":"1.0","source":{"id":"1208.0651","kind":"arxiv","version":1}},"canonical_sha256":"52bfd5dbf6765666d6ff34c17a59bf1b74745f05379bae654030db184f3e35c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52bfd5dbf6765666d6ff34c17a59bf1b74745f05379bae654030db184f3e35c7","first_computed_at":"2026-05-18T03:49:32.101521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:32.101521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YIPzfe0hosUE5n2AkqcA+29djJVi4rGxMgFCTWfAFDXGiiPiodrbeSqo59f6G75CZn77XVjUEv5vzngaC642Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:32.102424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98a1caa815e085fd399c88ba827d04ef86cb9883c3ed0c5a293782c75bc4ca3a","sha256:339e2631797cb71184aacd84d20f5c16c5cf79231d2d3e5d7315b6f45fb5a50a"],"state_sha256":"0537b0d91d49efb882ee32e292bcedbc1e735af7f953a7147635c0e9711753b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDXgpW8VXVSug+LwOXNOf73ODLlbf2K5gwr+lWI4X5n/zVT0Gn1vY/Xt5WFpqw4Ugr4euMH7tEWV9zZgGkTmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:30:31.099807Z","bundle_sha256":"c971080356912c16fe12086d2b50d2e9db89951da7169d1f3643a2c4ecf3406b"}}