{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZAJ2BRFSEFIXM5SKJX5R2KS3F7","short_pith_number":"pith:ZAJ2BRFS","schema_version":"1.0","canonical_sha256":"c813a0c4b2215176764a4dfb1d2a5b2fef6125dd86b9a9f9914ec5180c73911d","source":{"kind":"arxiv","id":"1406.1569","version":2},"attestation_state":"computed","paper":{"title":"Two-Part Reconstruction with Noisy-Sudocodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Deanna Needell, Dror Baron, Yanting Ma","submitted_at":"2014-06-06T02:20:38Z","abstract_excerpt":"We develop a two-part reconstruction framework for signal recovery in compressed sensing (CS), where a fast algorithm is applied to provide partial recovery in Part 1, and a CS algorithm is applied to complete the residual problem in Part 2. Partitioning the reconstruction process into two complementary parts provides a natural trade-off between runtime and reconstruction quality. To exploit the advantages of the two-part framework, we propose a Noisy-Sudocodes algorithm that performs two-part reconstruction of sparse signals in the presence of measurement noise. Specifically, we design a fast"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1406.1569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-06T02:20:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cebef5310db024a8de509850bb229f3bcc548ff310780d6b322c9cafc33d82b7","abstract_canon_sha256":"36e966f895ad64b654bb52b20049e19a6f91663969dc6543bccc2a05d65dd693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:43:01.687776Z","signature_b64":"Shb8NPup2Zr+Ypwqe1Y103WpiUxpYhmHFynLUV1EEzDuqeuhEUD6q58yKPB3dvtGfEUPL4/kDonL4b6857hXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c813a0c4b2215176764a4dfb1d2a5b2fef6125dd86b9a9f9914ec5180c73911d","last_reissued_at":"2026-05-18T01:43:01.687269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:43:01.687269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Part Reconstruction with Noisy-Sudocodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Deanna Needell, Dror Baron, Yanting Ma","submitted_at":"2014-06-06T02:20:38Z","abstract_excerpt":"We develop a two-part reconstruction framework for signal recovery in compressed sensing (CS), where a fast algorithm is applied to provide partial recovery in Part 1, and a CS algorithm is applied to complete the residual problem in Part 2. Partitioning the reconstruction process into two complementary parts provides a natural trade-off between runtime and reconstruction quality. To exploit the advantages of the two-part framework, we propose a Noisy-Sudocodes algorithm that performs two-part reconstruction of sparse signals in the presence of measurement noise. Specifically, we design a fast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1569","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.1569","created_at":"2026-05-18T01:43:01.687363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1569v2","created_at":"2026-05-18T01:43:01.687363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1569","created_at":"2026-05-18T01:43:01.687363+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAJ2BRFSEFIX","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAJ2BRFSEFIXM5SK","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAJ2BRFS","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7","json":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7.json","graph_json":"https://pith.science/api/pith-number/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/graph.json","events_json":"https://pith.science/api/pith-number/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/events.json","paper":"https://pith.science/paper/ZAJ2BRFS"},"agent_actions":{"view_html":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7","download_json":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7.json","view_paper":"https://pith.science/paper/ZAJ2BRFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1569&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/action/storage_attestation","attest_author":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/action/author_attestation","sign_citation":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/action/citation_signature","submit_replication":"https://pith.science/pith/ZAJ2BRFSEFIXM5SKJX5R2KS3F7/action/replication_record"}},"created_at":"2026-05-18T01:43:01.687363+00:00","updated_at":"2026-05-18T01:43:01.687363+00:00"}