{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DXEZJPIP4BRSWOQN3BXU6C4Y6T","short_pith_number":"pith:DXEZJPIP","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"},"canonical_sha256":"1dc994bd0fe0632b3a0dd86f4f0b98f4f55de20ca5868c4d9785c9a59388126f","source":{"kind":"arxiv","id":"1412.0624","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0624","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0624v2","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0624","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"DXEZJPIP4BRS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DXEZJPIP4BRSWOQN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DXEZJPIP","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DXEZJPIP4BRSWOQN3BXU6C4Y6T","target":"record","payload":{"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"},"canonical_sha256":"1dc994bd0fe0632b3a0dd86f4f0b98f4f55de20ca5868c4d9785c9a59388126f","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"},"source_kind":"arxiv","source_id":"1412.0624","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-18T02:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBCsBhCrLA+vtPeRmo68LetBZdsUCHqLhWkXHs2S+TsMN6pNYeNpHI81gcAJXld/DyEBvbDO71E7aPsGV5E2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:07:21.637510Z"},"content_sha256":"f6af9cd3781bf619eb311cbe739158a43a0985f3ba2972da417d704c21447988","schema_version":"1.0","event_id":"sha256:f6af9cd3781bf619eb311cbe739158a43a0985f3ba2972da417d704c21447988"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DXEZJPIP4BRSWOQN3BXU6C4Y6T","target":"graph","payload":{"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"},"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-18T02:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFvtO3lXeKU8kOwrAxyo7HAgnL5x66TG5gRvUkhSkdGht7zUN5jyZLGnWH/a2lcnalgzADSPSauTBrsWFNB5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:07:21.638180Z"},"content_sha256":"c93c196e1334ba6ec89ef3148112c028f2c9a72b21422f6b21027efe15b3ac86","schema_version":"1.0","event_id":"sha256:c93c196e1334ba6ec89ef3148112c028f2c9a72b21422f6b21027efe15b3ac86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/bundle.json","state_url":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/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-06-11T23:07:21Z","links":{"resolver":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T","bundle":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/bundle.json","state":"https://pith.science/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXEZJPIP4BRSWOQN3BXU6C4Y6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DXEZJPIP4BRSWOQN3BXU6C4Y6T","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":"8dbeaf374cb4dae59d69613ded9d63960b901c504891a0e3ee2ef74fad3e9f35","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-01T20:18:54Z","title_canon_sha256":"0f02113104603c62dba787f894ff51858d06cc490e65d7815257b8d587a3a447"},"schema_version":"1.0","source":{"id":"1412.0624","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0624","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0624v2","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0624","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"DXEZJPIP4BRS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DXEZJPIP4BRSWOQN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DXEZJPIP","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:c93c196e1334ba6ec89ef3148112c028f2c9a72b21422f6b21027efe15b3ac86","target":"graph","created_at":"2026-05-18T02:17:51Z","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":"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","authors_text":"Ljubisa Stankovic, Milos Dakovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-01T20:18:54Z","title":"Reconstruction of Randomly Sampled Sparse Signals Using an Adaptive Gradient Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0624","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:f6af9cd3781bf619eb311cbe739158a43a0985f3ba2972da417d704c21447988","target":"record","created_at":"2026-05-18T02:17:51Z","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":"8dbeaf374cb4dae59d69613ded9d63960b901c504891a0e3ee2ef74fad3e9f35","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-01T20:18:54Z","title_canon_sha256":"0f02113104603c62dba787f894ff51858d06cc490e65d7815257b8d587a3a447"},"schema_version":"1.0","source":{"id":"1412.0624","kind":"arxiv","version":2}},"canonical_sha256":"1dc994bd0fe0632b3a0dd86f4f0b98f4f55de20ca5868c4d9785c9a59388126f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dc994bd0fe0632b3a0dd86f4f0b98f4f55de20ca5868c4d9785c9a59388126f","first_computed_at":"2026-05-18T02:17:51.628802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:51.628802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iBhux6lqx0LQxKSZRkise4KezL1KxGLxo+tW9+rndhEIUi7yHuqsdb9U6ylJ6Oe8rrIcvSCKowNwYnlE9O3RCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:51.629286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0624","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6af9cd3781bf619eb311cbe739158a43a0985f3ba2972da417d704c21447988","sha256:c93c196e1334ba6ec89ef3148112c028f2c9a72b21422f6b21027efe15b3ac86"],"state_sha256":"f9c89922c211407ae9046f9d5d299071ecded13330cb17c295c9e7af5530dbb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pofpjwzxJMYFIS0Wvee6mZHSdqvgK/AwBN1eJLga90QK2EsI3pclDkRFKNTvBOFygv8Klpp0XWR8zC+TWNoODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:07:21.642519Z","bundle_sha256":"92e5b99e191bb43502257101990b0fbb245707dffd9210a61dba2ba3ddc3a4e7"}}