{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UDMREQGPYWKYVGVPN6XS6TDR75","short_pith_number":"pith:UDMREQGP","canonical_record":{"source":{"id":"1310.6475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-24T03:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"dc1c804c9e42f75318bd81c718032feb7edc60c4c674614d435f9c1e4d4ffdc9","abstract_canon_sha256":"d22b5a91394c6a415d18c9ac95597e80d00b71cc28fc291712249863336c92d1"},"schema_version":"1.0"},"canonical_sha256":"a0d91240cfc5958a9aaf6faf2f4c71ff4f2dbd5f05fa39b0ca405c2d5811fb82","source":{"kind":"arxiv","id":"1310.6475","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6475","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6475v2","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6475","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"UDMREQGPYWKY","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UDMREQGPYWKYVGVP","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UDMREQGP","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UDMREQGPYWKYVGVPN6XS6TDR75","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-24T03:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"dc1c804c9e42f75318bd81c718032feb7edc60c4c674614d435f9c1e4d4ffdc9","abstract_canon_sha256":"d22b5a91394c6a415d18c9ac95597e80d00b71cc28fc291712249863336c92d1"},"schema_version":"1.0"},"canonical_sha256":"a0d91240cfc5958a9aaf6faf2f4c71ff4f2dbd5f05fa39b0ca405c2d5811fb82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:12.779575Z","signature_b64":"aUhVg12xGJ8kQ1K/ljNGyVgHllboNZ2hAsP0jBPB6o7jSxjPRC7u4EJqPGi+Dn12n0rgnraaxDEL9EKCbrYPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0d91240cfc5958a9aaf6faf2f4c71ff4f2dbd5f05fa39b0ca405c2d5811fb82","last_reissued_at":"2026-05-18T03:06:12.779053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:12.779053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6475","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-18T03:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zpNgjHV17FtR4vteNZxx4Cb+A5BEHccJYdj0cEvRFkF7H0JZgfeb5Eht37+TmVHMTTjztQ//C6nenevtbd61Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:14:21.704563Z"},"content_sha256":"784c13afd7834715aeb4148957f2445ed2789df05e9fb1ab18e573e7020a510a","schema_version":"1.0","event_id":"sha256:784c13afd7834715aeb4148957f2445ed2789df05e9fb1ab18e573e7020a510a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UDMREQGPYWKYVGVPN6XS6TDR75","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A time continuation based fast approximate algorithm for compressed sensing related optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Farzin Barekat, Jerome Darbon, Stanley Osher","submitted_at":"2013-10-24T03:57:48Z","abstract_excerpt":"Recently, significant connections between compressed sensing problems and optimization of a particular class of functions relating to solutions of Hamilton-Jacobi equation was discovered. In this paper we introduce a fast approximate algorithm to optimize this particular class of functions and subsequently find the solution to the compressed sensing problem. Although we emphasize that the methodology of our algorithm finds an approximate solution, numerical experiments show that our algorithm perfectly recovers the solution when the solution is relatively sparse with respect to the number of m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6475","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-18T03:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqCAdkOhtfbeO/vqqBNlwzIT6MRgViXG+BiGS/hLMs2ke6IdSkQ+G2HNlKPl79C5fBOqUpnC5ktImj5fqgjOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:14:21.705266Z"},"content_sha256":"190ed78faff08417897ea393b18451c3e899c79cbe52472fcbe8a752bdca7b71","schema_version":"1.0","event_id":"sha256:190ed78faff08417897ea393b18451c3e899c79cbe52472fcbe8a752bdca7b71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDMREQGPYWKYVGVPN6XS6TDR75/bundle.json","state_url":"https://pith.science/pith/UDMREQGPYWKYVGVPN6XS6TDR75/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDMREQGPYWKYVGVPN6XS6TDR75/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-31T18:14:21Z","links":{"resolver":"https://pith.science/pith/UDMREQGPYWKYVGVPN6XS6TDR75","bundle":"https://pith.science/pith/UDMREQGPYWKYVGVPN6XS6TDR75/bundle.json","state":"https://pith.science/pith/UDMREQGPYWKYVGVPN6XS6TDR75/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDMREQGPYWKYVGVPN6XS6TDR75/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UDMREQGPYWKYVGVPN6XS6TDR75","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":"d22b5a91394c6a415d18c9ac95597e80d00b71cc28fc291712249863336c92d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-24T03:57:48Z","title_canon_sha256":"dc1c804c9e42f75318bd81c718032feb7edc60c4c674614d435f9c1e4d4ffdc9"},"schema_version":"1.0","source":{"id":"1310.6475","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6475","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6475v2","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6475","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"UDMREQGPYWKY","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UDMREQGPYWKYVGVP","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UDMREQGP","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:190ed78faff08417897ea393b18451c3e899c79cbe52472fcbe8a752bdca7b71","target":"graph","created_at":"2026-05-18T03:06:12Z","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":"Recently, significant connections between compressed sensing problems and optimization of a particular class of functions relating to solutions of Hamilton-Jacobi equation was discovered. In this paper we introduce a fast approximate algorithm to optimize this particular class of functions and subsequently find the solution to the compressed sensing problem. Although we emphasize that the methodology of our algorithm finds an approximate solution, numerical experiments show that our algorithm perfectly recovers the solution when the solution is relatively sparse with respect to the number of m","authors_text":"Farzin Barekat, Jerome Darbon, Stanley Osher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-24T03:57:48Z","title":"A time continuation based fast approximate algorithm for compressed sensing related optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6475","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:784c13afd7834715aeb4148957f2445ed2789df05e9fb1ab18e573e7020a510a","target":"record","created_at":"2026-05-18T03:06:12Z","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":"d22b5a91394c6a415d18c9ac95597e80d00b71cc28fc291712249863336c92d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-24T03:57:48Z","title_canon_sha256":"dc1c804c9e42f75318bd81c718032feb7edc60c4c674614d435f9c1e4d4ffdc9"},"schema_version":"1.0","source":{"id":"1310.6475","kind":"arxiv","version":2}},"canonical_sha256":"a0d91240cfc5958a9aaf6faf2f4c71ff4f2dbd5f05fa39b0ca405c2d5811fb82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0d91240cfc5958a9aaf6faf2f4c71ff4f2dbd5f05fa39b0ca405c2d5811fb82","first_computed_at":"2026-05-18T03:06:12.779053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:12.779053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aUhVg12xGJ8kQ1K/ljNGyVgHllboNZ2hAsP0jBPB6o7jSxjPRC7u4EJqPGi+Dn12n0rgnraaxDEL9EKCbrYPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:12.779575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6475","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:784c13afd7834715aeb4148957f2445ed2789df05e9fb1ab18e573e7020a510a","sha256:190ed78faff08417897ea393b18451c3e899c79cbe52472fcbe8a752bdca7b71"],"state_sha256":"96247de8d1c4a35222aa23dddf8e5cc82ade309a48089978e2daa8f15c0e263c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2YWW4wKB3Mk98hBiX2Ovq4s8Av40UIfrk4rScbeX5BtFa4NtU4ndqmNNV0nVagjzn8xB8/KwlB1+j2BfMnBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:14:21.709333Z","bundle_sha256":"382a6e0b4e932c17b808b98564c0502525159365da9467806be3b672964b4d60"}}