{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DXEZJPIP4BRSWOQN3BXU6C4Y6T","short_pith_number":"pith:DXEZJPIP","schema_version":"1.0","canonical_sha256":"1dc994bd0fe0632b3a0dd86f4f0b98f4f55de20ca5868c4d9785c9a59388126f","source":{"kind":"arxiv","id":"1412.0624","version":2},"attestation_state":"computed","paper":{"title":"Reconstruction of Randomly Sampled Sparse Signals Using an Adaptive Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ljubisa Stankovic, Milos Dakovic","submitted_at":"2014-12-01T20:18:54Z","abstract_excerpt":"Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the remaining missing samples/measurements is recently proposed. The available samples are fixed, while the missing samples are considered as minimization variables. Recovery of missing samples/measurements is done using an adaptive gradient-based algorithm in the time domain. A new criterion for the parameter adaptation in this algorithm, based on the gradient d"},"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":"1412.0624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-01T20:18:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f02113104603c62dba787f894ff51858d06cc490e65d7815257b8d587a3a447","abstract_canon_sha256":"8dbeaf374cb4dae59d69613ded9d63960b901c504891a0e3ee2ef74fad3e9f35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:51.629286Z","signature_b64":"iBhux6lqx0LQxKSZRkise4KezL1KxGLxo+tW9+rndhEIUi7yHuqsdb9U6ylJ6Oe8rrIcvSCKowNwYnlE9O3RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dc994bd0fe0632b3a0dd86f4f0b98f4f55de20ca5868c4d9785c9a59388126f","last_reissued_at":"2026-05-18T02:17:51.628802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:51.628802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction of Randomly Sampled Sparse Signals Using an Adaptive Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ljubisa Stankovic, Milos Dakovic","submitted_at":"2014-12-01T20:18:54Z","abstract_excerpt":"Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the remaining missing samples/measurements is recently proposed. The available samples are fixed, while the missing samples are considered as minimization variables. Recovery of missing samples/measurements is done using an adaptive gradient-based algorithm in the time domain. A new criterion for the parameter adaptation in this algorithm, based on the gradient d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0624","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":"1412.0624","created_at":"2026-05-18T02:17:51.628882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0624v2","created_at":"2026-05-18T02:17:51.628882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0624","created_at":"2026-05-18T02:17:51.628882+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXEZJPIP4BRS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXEZJPIP4BRSWOQN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXEZJPIP","created_at":"2026-05-18T12:28:25.294606+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/DXEZJPIP4BRSWOQN3BXU6C4Y6T","json":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T.json","graph_json":"https://pith.science/api/pith-number/DXEZJPIP4BRSWOQN3BXU6C4Y6T/graph.json","events_json":"https://pith.science/api/pith-number/DXEZJPIP4BRSWOQN3BXU6C4Y6T/events.json","paper":"https://pith.science/paper/DXEZJPIP"},"agent_actions":{"view_html":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T","download_json":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T.json","view_paper":"https://pith.science/paper/DXEZJPIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0624&json=true","fetch_graph":"https://pith.science/api/pith-number/DXEZJPIP4BRSWOQN3BXU6C4Y6T/graph.json","fetch_events":"https://pith.science/api/pith-number/DXEZJPIP4BRSWOQN3BXU6C4Y6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/action/storage_attestation","attest_author":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/action/author_attestation","sign_citation":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/action/citation_signature","submit_replication":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/action/replication_record"}},"created_at":"2026-05-18T02:17:51.628882+00:00","updated_at":"2026-05-18T02:17:51.628882+00:00"}