{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KSTX7XMVI4PP7FNO2XCSVQOGV4","short_pith_number":"pith:KSTX7XMV","schema_version":"1.0","canonical_sha256":"54a77fdd95471eff95aed5c52ac1c6af38ccfa9659862bb56910647eb46d8507","source":{"kind":"arxiv","id":"1105.4936","version":1},"attestation_state":"computed","paper":{"title":"Sparse Random Approximation and Lossy Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"physics.data-an","authors_text":"M. Andrecut","submitted_at":"2011-05-25T05:01:58Z","abstract_excerpt":"We discuss a method for sparse signal approximation, which is based on the correlation of the target signal with a pseudo-random signal, and uses a modification of the greedy matching pursuit algorithm. We show that this approach provides an efficient encoding-decoding method, which can be used also for lossy compression and encryption purposes."},"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":"1105.4936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2011-05-25T05:01:58Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"7ff56ef2b8b7c2a25d3c0990c1127b0c020fb025b2ffccdb519963f6bcf3652b","abstract_canon_sha256":"9daa19aa3257597c1f24d36d212be7acde3f822a0f4c3c0854061a5ed4cfee5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:21.055967Z","signature_b64":"Wz1KeAmVM9Kcp1J5d5MytWlypUZ6Alvvh6mB5Sz+AUWE8514mH+LyeR5HSN8Cqu7favW2gPELNDg+7bkkis6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54a77fdd95471eff95aed5c52ac1c6af38ccfa9659862bb56910647eb46d8507","last_reissued_at":"2026-05-18T04:21:21.055354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:21.055354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Random Approximation and Lossy Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"physics.data-an","authors_text":"M. Andrecut","submitted_at":"2011-05-25T05:01:58Z","abstract_excerpt":"We discuss a method for sparse signal approximation, which is based on the correlation of the target signal with a pseudo-random signal, and uses a modification of the greedy matching pursuit algorithm. We show that this approach provides an efficient encoding-decoding method, which can be used also for lossy compression and encryption purposes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4936","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.4936","created_at":"2026-05-18T04:21:21.055454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4936v1","created_at":"2026-05-18T04:21:21.055454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4936","created_at":"2026-05-18T04:21:21.055454+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSTX7XMVI4PP","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSTX7XMVI4PP7FNO","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSTX7XMV","created_at":"2026-05-18T12:26:34.985390+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/KSTX7XMVI4PP7FNO2XCSVQOGV4","json":"https://pith.science/pith/KSTX7XMVI4PP7FNO2XCSVQOGV4.json","graph_json":"https://pith.science/api/pith-number/KSTX7XMVI4PP7FNO2XCSVQOGV4/graph.json","events_json":"https://pith.science/api/pith-number/KSTX7XMVI4PP7FNO2XCSVQOGV4/events.json","paper":"https://pith.science/paper/KSTX7XMV"},"agent_actions":{"view_html":"https://pith.science/pith/KSTX7XMVI4PP7FNO2XCSVQOGV4","download_json":"https://pith.science/pith/KSTX7XMVI4PP7FNO2XCSVQOGV4.json","view_paper":"https://pith.science/paper/KSTX7XMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4936&json=true","fetch_graph":"https://pith.science/api/pith-number/KSTX7XMVI4PP7FNO2XCSVQOGV4/graph.json","fetch_events":"https://pith.science/api/pith-number/KSTX7XMVI4PP7FNO2XCSVQOGV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSTX7XMVI4PP7FNO2XCSVQOGV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSTX7XMVI4PP7FNO2XCSVQOGV4/action/storage_attestation","attest_author":"https://pith.science/pith/KSTX7XMVI4PP7FNO2XCSVQOGV4/action/author_attestation","sign_citation":"https://pith.science/pith/KSTX7XMVI4PP7FNO2XCSVQOGV4/action/citation_signature","submit_replication":"https://pith.science/pith/KSTX7XMVI4PP7FNO2XCSVQOGV4/action/replication_record"}},"created_at":"2026-05-18T04:21:21.055454+00:00","updated_at":"2026-05-18T04:21:21.055454+00:00"}