{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5AZGDUHHTGHNUZICKLQTEZKCHD","short_pith_number":"pith:5AZGDUHH","canonical_record":{"source":{"id":"1304.5802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T21:32:20Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"c7db6a1e5477c6880214644bf5ec518315de72afa4d711d416fde2c018c07dc6","abstract_canon_sha256":"397b5af29390b0b0ef1718210a8814e0506672cc0473416e540de243330b9f6c"},"schema_version":"1.0"},"canonical_sha256":"e83261d0e7998eda650252e132654238e0af8d6b3e9c3d370871b10c64b66e78","source":{"kind":"arxiv","id":"1304.5802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5802","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5802v1","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5802","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"5AZGDUHHTGHN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5AZGDUHHTGHNUZIC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5AZGDUHH","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5AZGDUHHTGHNUZICKLQTEZKCHD","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T21:32:20Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"c7db6a1e5477c6880214644bf5ec518315de72afa4d711d416fde2c018c07dc6","abstract_canon_sha256":"397b5af29390b0b0ef1718210a8814e0506672cc0473416e540de243330b9f6c"},"schema_version":"1.0"},"canonical_sha256":"e83261d0e7998eda650252e132654238e0af8d6b3e9c3d370871b10c64b66e78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:24.077184Z","signature_b64":"fNldNWiGAO74peaYRZwNreKHS8YxhT1hHky1WmkEZXixw0Dl1imTR0saPfCPkUtFPA+egNCLncM8F6uaSHueCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83261d0e7998eda650252e132654238e0af8d6b3e9c3d370871b10c64b66e78","last_reissued_at":"2026-05-18T03:27:24.076340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:24.076340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5802","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:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyYjWL6BbPYrk7IJHSA/ig9/SER2cVLK02RMJBAD69ZayzK+PwnT8pfPpg3n/6b9qH/XjmUp3xA/hNJUi8SPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:39:56.930865Z"},"content_sha256":"fde86cb029fe5139782304d90934002dbab71f267f6c0d75b7607378fb226bac","schema_version":"1.0","event_id":"sha256:fde86cb029fe5139782304d90934002dbab71f267f6c0d75b7607378fb226bac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5AZGDUHHTGHNUZICKLQTEZKCHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonlinear Basis Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Allen Y. Yang, Henrik Ohlsson, Roy Dong, S. Shankar Sastry","submitted_at":"2013-04-21T21:32:20Z","abstract_excerpt":"In compressive sensing, the basis pursuit algorithm aims to find the sparsest solution to an underdetermined linear equation system. In this paper, we generalize basis pursuit to finding the sparsest solution to higher order nonlinear systems of equations, called nonlinear basis pursuit. In contrast to the existing nonlinear compressive sensing methods, the new algorithm that solves the nonlinear basis pursuit problem is convex and not greedy. The novel algorithm enables the compressive sensing approach to be used for a broader range of applications where there are nonlinear relationships betw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5802","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:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1D1thnbvchop8sJhtaeQqw4e/LDKxPoR9XzMxYkXDce3+oSia2t18KIEQoydOUbMoODRkvoBipHBk0W113VMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:39:56.931409Z"},"content_sha256":"3aca2c6e09ce8954da838e0b3e1fc356146aab2e1b217fcfd63d4cdc1587a1a4","schema_version":"1.0","event_id":"sha256:3aca2c6e09ce8954da838e0b3e1fc356146aab2e1b217fcfd63d4cdc1587a1a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AZGDUHHTGHNUZICKLQTEZKCHD/bundle.json","state_url":"https://pith.science/pith/5AZGDUHHTGHNUZICKLQTEZKCHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AZGDUHHTGHNUZICKLQTEZKCHD/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-27T03:39:56Z","links":{"resolver":"https://pith.science/pith/5AZGDUHHTGHNUZICKLQTEZKCHD","bundle":"https://pith.science/pith/5AZGDUHHTGHNUZICKLQTEZKCHD/bundle.json","state":"https://pith.science/pith/5AZGDUHHTGHNUZICKLQTEZKCHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AZGDUHHTGHNUZICKLQTEZKCHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5AZGDUHHTGHNUZICKLQTEZKCHD","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":"397b5af29390b0b0ef1718210a8814e0506672cc0473416e540de243330b9f6c","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T21:32:20Z","title_canon_sha256":"c7db6a1e5477c6880214644bf5ec518315de72afa4d711d416fde2c018c07dc6"},"schema_version":"1.0","source":{"id":"1304.5802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5802","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5802v1","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5802","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"5AZGDUHHTGHN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5AZGDUHHTGHNUZIC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5AZGDUHH","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:3aca2c6e09ce8954da838e0b3e1fc356146aab2e1b217fcfd63d4cdc1587a1a4","target":"graph","created_at":"2026-05-18T03:27:24Z","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 compressive sensing, the basis pursuit algorithm aims to find the sparsest solution to an underdetermined linear equation system. In this paper, we generalize basis pursuit to finding the sparsest solution to higher order nonlinear systems of equations, called nonlinear basis pursuit. In contrast to the existing nonlinear compressive sensing methods, the new algorithm that solves the nonlinear basis pursuit problem is convex and not greedy. The novel algorithm enables the compressive sensing approach to be used for a broader range of applications where there are nonlinear relationships betw","authors_text":"Allen Y. Yang, Henrik Ohlsson, Roy Dong, S. Shankar Sastry","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T21:32:20Z","title":"Nonlinear Basis Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5802","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:fde86cb029fe5139782304d90934002dbab71f267f6c0d75b7607378fb226bac","target":"record","created_at":"2026-05-18T03:27:24Z","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":"397b5af29390b0b0ef1718210a8814e0506672cc0473416e540de243330b9f6c","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T21:32:20Z","title_canon_sha256":"c7db6a1e5477c6880214644bf5ec518315de72afa4d711d416fde2c018c07dc6"},"schema_version":"1.0","source":{"id":"1304.5802","kind":"arxiv","version":1}},"canonical_sha256":"e83261d0e7998eda650252e132654238e0af8d6b3e9c3d370871b10c64b66e78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e83261d0e7998eda650252e132654238e0af8d6b3e9c3d370871b10c64b66e78","first_computed_at":"2026-05-18T03:27:24.076340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:24.076340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fNldNWiGAO74peaYRZwNreKHS8YxhT1hHky1WmkEZXixw0Dl1imTR0saPfCPkUtFPA+egNCLncM8F6uaSHueCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:24.077184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fde86cb029fe5139782304d90934002dbab71f267f6c0d75b7607378fb226bac","sha256:3aca2c6e09ce8954da838e0b3e1fc356146aab2e1b217fcfd63d4cdc1587a1a4"],"state_sha256":"553c276e91fc576231b97cd7f62f7a5d619d97f9fd5587a04300dab7fe9ffa67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnx/7jdGW7yfsLzTXb3IYh//3bfLKR0oWgP1AVr+v9w5rJNCUrMF+8mpBWDAmsR+59rMrn3/NPDOpLrh9z13Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:39:56.934303Z","bundle_sha256":"72676bb3600ea8ab7286d8650f3267e897f5d53135f93d0c8483955a03e90126"}}