{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:35XNNMBQIE5RMPPOIXBORHV26O","short_pith_number":"pith:35XNNMBQ","schema_version":"1.0","canonical_sha256":"df6ed6b030413b163dee45c2e89ebaf396d159a25b609a40ca418321abbaa21c","source":{"kind":"arxiv","id":"1703.00135","version":3},"attestation_state":"computed","paper":{"title":"Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Akil Narayan, Anyi Bao, Ben Adcock, John D. Jakeman","submitted_at":"2017-03-01T04:59:18Z","abstract_excerpt":"The recovery of approximately sparse or compressible coefficients in a Polynomial Chaos Expansion is a common goal in modern parametric uncertainty quantification (UQ). However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be diff"},"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":"1703.00135","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-01T04:59:18Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"49ca66939d70585ea6c87a2fc5cee06704291bc04a3ae34cd51296e91b0fbf4f","abstract_canon_sha256":"aab3597fb2d496310a07261d1a94f66b1939ac24154d0d29a76e0d15dc7f9534"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T18:10:32.381278Z","signature_b64":"A+lA2NRbdeWdQSXKIyBeBEP/qN7KnWP5c/29HsaJgPU2KtBVwM2Q8Q30olDOuGe7Q0qyEDeFmRoGzx+jbwceDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df6ed6b030413b163dee45c2e89ebaf396d159a25b609a40ca418321abbaa21c","last_reissued_at":"2026-06-04T18:10:32.380779Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T18:10:32.380779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Akil Narayan, Anyi Bao, Ben Adcock, John D. Jakeman","submitted_at":"2017-03-01T04:59:18Z","abstract_excerpt":"The recovery of approximately sparse or compressible coefficients in a Polynomial Chaos Expansion is a common goal in modern parametric uncertainty quantification (UQ). However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00135","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1703.00135/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1703.00135","created_at":"2026-06-04T18:10:32.380842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00135v3","created_at":"2026-06-04T18:10:32.380842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00135","created_at":"2026-06-04T18:10:32.380842+00:00"},{"alias_kind":"pith_short_12","alias_value":"35XNNMBQIE5R","created_at":"2026-06-04T18:10:32.380842+00:00"},{"alias_kind":"pith_short_16","alias_value":"35XNNMBQIE5RMPPO","created_at":"2026-06-04T18:10:32.380842+00:00"},{"alias_kind":"pith_short_8","alias_value":"35XNNMBQ","created_at":"2026-06-04T18:10:32.380842+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/35XNNMBQIE5RMPPOIXBORHV26O","json":"https://pith.science/pith/35XNNMBQIE5RMPPOIXBORHV26O.json","graph_json":"https://pith.science/api/pith-number/35XNNMBQIE5RMPPOIXBORHV26O/graph.json","events_json":"https://pith.science/api/pith-number/35XNNMBQIE5RMPPOIXBORHV26O/events.json","paper":"https://pith.science/paper/35XNNMBQ"},"agent_actions":{"view_html":"https://pith.science/pith/35XNNMBQIE5RMPPOIXBORHV26O","download_json":"https://pith.science/pith/35XNNMBQIE5RMPPOIXBORHV26O.json","view_paper":"https://pith.science/paper/35XNNMBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00135&json=true","fetch_graph":"https://pith.science/api/pith-number/35XNNMBQIE5RMPPOIXBORHV26O/graph.json","fetch_events":"https://pith.science/api/pith-number/35XNNMBQIE5RMPPOIXBORHV26O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35XNNMBQIE5RMPPOIXBORHV26O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35XNNMBQIE5RMPPOIXBORHV26O/action/storage_attestation","attest_author":"https://pith.science/pith/35XNNMBQIE5RMPPOIXBORHV26O/action/author_attestation","sign_citation":"https://pith.science/pith/35XNNMBQIE5RMPPOIXBORHV26O/action/citation_signature","submit_replication":"https://pith.science/pith/35XNNMBQIE5RMPPOIXBORHV26O/action/replication_record"}},"created_at":"2026-06-04T18:10:32.380842+00:00","updated_at":"2026-06-04T18:10:32.380842+00:00"}