{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I7IOVZLRPV64YP62XUUBVGBD4W","short_pith_number":"pith:I7IOVZLR","canonical_record":{"source":{"id":"1307.4502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T04:59:24Z","cross_cats_sorted":["math.IT","math.OC","stat.ML"],"title_canon_sha256":"0cf4e661278a471aebf3a3e653ae8beaba4ff1e30d67cabb2b0078207766f9ba","abstract_canon_sha256":"e518d82d8917e6a35ac39274f5f6066da7d9b25092fa4056fa735918cf93f3e1"},"schema_version":"1.0"},"canonical_sha256":"47d0eae5717d7dcc3fdabd281a9823e5b02ec1e7e58c84f7c1b9219fdf0b5d7e","source":{"kind":"arxiv","id":"1307.4502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4502","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4502v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4502","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"I7IOVZLRPV64","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I7IOVZLRPV64YP62","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I7IOVZLR","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I7IOVZLRPV64YP62XUUBVGBD4W","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T04:59:24Z","cross_cats_sorted":["math.IT","math.OC","stat.ML"],"title_canon_sha256":"0cf4e661278a471aebf3a3e653ae8beaba4ff1e30d67cabb2b0078207766f9ba","abstract_canon_sha256":"e518d82d8917e6a35ac39274f5f6066da7d9b25092fa4056fa735918cf93f3e1"},"schema_version":"1.0"},"canonical_sha256":"47d0eae5717d7dcc3fdabd281a9823e5b02ec1e7e58c84f7c1b9219fdf0b5d7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:07.620823Z","signature_b64":"zL8nO2UY01f4wA+yMsQYTVlo/85wBbWtl/nLfjDQ6d7KSqPBnpy/pGJ/oEX/jHUcTVgz/WBztlP4do+9B2E0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47d0eae5717d7dcc3fdabd281a9823e5b02ec1e7e58c84f7c1b9219fdf0b5d7e","last_reissued_at":"2026-05-18T03:18:07.620042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:07.620042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4502","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:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+yHC1VR6/nspo0KzBY9zaqEp7DWdavCcYXhsLBR0qJkPczgK4XXyxwIiHPtzJq5OalrelT9SaIn4rT46uNlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:05:27.766813Z"},"content_sha256":"df4406ef02383aa98b3c6178287de877a8fff51248c64b52e20fdfb6d500c91b","schema_version":"1.0","event_id":"sha256:df4406ef02383aa98b3c6178287de877a8fff51248c64b52e20fdfb6d500c91b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I7IOVZLRPV64YP62XUUBVGBD4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universally Elevating the Phase Transition Performance of Compressed Sensing: Non-Isometric Matrices are Not Necessarily Bad Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Myung Cho, Weiyu Xu","submitted_at":"2013-07-17T04:59:24Z","abstract_excerpt":"In compressed sensing problems, $\\ell_1$ minimization or Basis Pursuit was known to have the best provable phase transition performance of recoverable sparsity among polynomial-time algorithms. It is of great theoretical and practical interest to find alternative polynomial-time algorithms which perform better than $\\ell_1$ minimization. \\cite{Icassp reweighted l_1}, \\cite{Isit reweighted l_1}, \\cite{XuScaingLaw} and \\cite{iterativereweightedjournal} have shown that a two-stage re-weighted $\\ell_1$ minimization algorithm can boost the phase transition performance for signals whose nonzero elem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4502","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:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yA2/QjXdhOBXsRC9TWHmGsqpYoiI5MBBzk0EJIU57F5552a7Bn2CZ37YB4OTH0F3SCuyDUMwwcg/iGIf5TCLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:05:27.767381Z"},"content_sha256":"2af73feec2be2b892ac78206df27a157ae21c263a76cb564b5d645825a054b2b","schema_version":"1.0","event_id":"sha256:2af73feec2be2b892ac78206df27a157ae21c263a76cb564b5d645825a054b2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7IOVZLRPV64YP62XUUBVGBD4W/bundle.json","state_url":"https://pith.science/pith/I7IOVZLRPV64YP62XUUBVGBD4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7IOVZLRPV64YP62XUUBVGBD4W/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-31T10:05:27Z","links":{"resolver":"https://pith.science/pith/I7IOVZLRPV64YP62XUUBVGBD4W","bundle":"https://pith.science/pith/I7IOVZLRPV64YP62XUUBVGBD4W/bundle.json","state":"https://pith.science/pith/I7IOVZLRPV64YP62XUUBVGBD4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7IOVZLRPV64YP62XUUBVGBD4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I7IOVZLRPV64YP62XUUBVGBD4W","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":"e518d82d8917e6a35ac39274f5f6066da7d9b25092fa4056fa735918cf93f3e1","cross_cats_sorted":["math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T04:59:24Z","title_canon_sha256":"0cf4e661278a471aebf3a3e653ae8beaba4ff1e30d67cabb2b0078207766f9ba"},"schema_version":"1.0","source":{"id":"1307.4502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4502","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4502v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4502","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"I7IOVZLRPV64","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I7IOVZLRPV64YP62","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I7IOVZLR","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:2af73feec2be2b892ac78206df27a157ae21c263a76cb564b5d645825a054b2b","target":"graph","created_at":"2026-05-18T03:18:07Z","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":"In compressed sensing problems, $\\ell_1$ minimization or Basis Pursuit was known to have the best provable phase transition performance of recoverable sparsity among polynomial-time algorithms. It is of great theoretical and practical interest to find alternative polynomial-time algorithms which perform better than $\\ell_1$ minimization. \\cite{Icassp reweighted l_1}, \\cite{Isit reweighted l_1}, \\cite{XuScaingLaw} and \\cite{iterativereweightedjournal} have shown that a two-stage re-weighted $\\ell_1$ minimization algorithm can boost the phase transition performance for signals whose nonzero elem","authors_text":"Myung Cho, Weiyu Xu","cross_cats":["math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T04:59:24Z","title":"Universally Elevating the Phase Transition Performance of Compressed Sensing: Non-Isometric Matrices are Not Necessarily Bad Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4502","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:df4406ef02383aa98b3c6178287de877a8fff51248c64b52e20fdfb6d500c91b","target":"record","created_at":"2026-05-18T03:18:07Z","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":"e518d82d8917e6a35ac39274f5f6066da7d9b25092fa4056fa735918cf93f3e1","cross_cats_sorted":["math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T04:59:24Z","title_canon_sha256":"0cf4e661278a471aebf3a3e653ae8beaba4ff1e30d67cabb2b0078207766f9ba"},"schema_version":"1.0","source":{"id":"1307.4502","kind":"arxiv","version":1}},"canonical_sha256":"47d0eae5717d7dcc3fdabd281a9823e5b02ec1e7e58c84f7c1b9219fdf0b5d7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47d0eae5717d7dcc3fdabd281a9823e5b02ec1e7e58c84f7c1b9219fdf0b5d7e","first_computed_at":"2026-05-18T03:18:07.620042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:07.620042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zL8nO2UY01f4wA+yMsQYTVlo/85wBbWtl/nLfjDQ6d7KSqPBnpy/pGJ/oEX/jHUcTVgz/WBztlP4do+9B2E0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:07.620823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df4406ef02383aa98b3c6178287de877a8fff51248c64b52e20fdfb6d500c91b","sha256:2af73feec2be2b892ac78206df27a157ae21c263a76cb564b5d645825a054b2b"],"state_sha256":"09233ecaa300bf30ca72b754c9991bddc6f89a289f7ec7f56fe408ff42cf4fb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LV40Fb4ion6+r9e4v1vT8h/+/kRaTOvjQw6Grayr3MaBjGQwgTFTk8KcwTLDLjoh0lKQFSd7DguPXAokrXhYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:05:27.771152Z","bundle_sha256":"a9bf8e5fde065a6674ea74f0fce9caef82c53d8b971aa2aa70c46633e9174bb7"}}