{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QSK6WQFPFAWKVQEBJZ677RRDQX","short_pith_number":"pith:QSK6WQFP","canonical_record":{"source":{"id":"1309.5749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-23T10:01:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"839d3b10732ae26b9bd1e6ccd331a72521286f7a0752b104a3f133c108b430b2","abstract_canon_sha256":"00cf87923f64bb0a28db0a7fab96ef31e7d6b4fe437a7b1498ead30f7dfcdc2b"},"schema_version":"1.0"},"canonical_sha256":"8495eb40af282caac0814e7dffc62385ed67f8bb5daac4907ad8933e4bf940d9","source":{"kind":"arxiv","id":"1309.5749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5749","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5749v1","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5749","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"QSK6WQFPFAWK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QSK6WQFPFAWKVQEB","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QSK6WQFP","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QSK6WQFPFAWKVQEBJZ677RRDQX","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-23T10:01:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"839d3b10732ae26b9bd1e6ccd331a72521286f7a0752b104a3f133c108b430b2","abstract_canon_sha256":"00cf87923f64bb0a28db0a7fab96ef31e7d6b4fe437a7b1498ead30f7dfcdc2b"},"schema_version":"1.0"},"canonical_sha256":"8495eb40af282caac0814e7dffc62385ed67f8bb5daac4907ad8933e4bf940d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:34.294897Z","signature_b64":"4HUC+yoEl0RMx3llGBHzHAnTKga5aTVE2sidHOBSFdl9OVi3EdRpR5q3pcDf8uqlScdAn/gOkq53YAKetm3DBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8495eb40af282caac0814e7dffc62385ed67f8bb5daac4907ad8933e4bf940d9","last_reissued_at":"2026-05-18T03:12:34.294183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:34.294183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5749","source_version":1,"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-18T03:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXbRt2v3R+wDQQ/43CU12ujoNtu+TVasJgtCBtTVJ4Ds3QkJ5R7SHXPlAaiKPxCN5mQGwO/XsBKG50mCj3B+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:29:15.836534Z"},"content_sha256":"a633e1cbc1e52f4c9c06fca2a4f0d01aff5c70cfedac0322f43abeaa4302827f","schema_version":"1.0","event_id":"sha256:a633e1cbc1e52f4c9c06fca2a4f0d01aff5c70cfedac0322f43abeaa4302827f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QSK6WQFPFAWKVQEBJZ677RRDQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Variable Step Algorithm for Missing Samples Recovery in Sparse Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ljubisa Stankovic, Milos Dakovic, Stefan Vujovic","submitted_at":"2013-09-23T10:01:29Z","abstract_excerpt":"Recovery of arbitrarily positioned samples that are missing in sparse signals recently attracted significant research interest. Sparse signals with heavily corrupted arbitrary positioned samples could be analyzed in the same way as compressive sensed signals by omitting the corrupted samples and considering them as unavailable during the recovery process. The reconstruction of missing samples is done by using one of the well known reconstruction algorithms. In this paper we will propose a very simple and efficient adaptive variable step algorithm, applied directly to the concentration measures"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5749","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"},"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-18T03:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCnjdz5DdP94Mrgm+UUc867joWqwOHFMb+vQpLj1ovQhkrgAHDGXCHb5wp2KEvGXB7cV7EoCktaFSpgYxvq+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:29:15.837269Z"},"content_sha256":"4eed0b795b0d618fbd4ae80e9fd8a231e35b428ea9a79f6b375bcd42d24cf6d1","schema_version":"1.0","event_id":"sha256:4eed0b795b0d618fbd4ae80e9fd8a231e35b428ea9a79f6b375bcd42d24cf6d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSK6WQFPFAWKVQEBJZ677RRDQX/bundle.json","state_url":"https://pith.science/pith/QSK6WQFPFAWKVQEBJZ677RRDQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSK6WQFPFAWKVQEBJZ677RRDQX/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-11T22:29:15Z","links":{"resolver":"https://pith.science/pith/QSK6WQFPFAWKVQEBJZ677RRDQX","bundle":"https://pith.science/pith/QSK6WQFPFAWKVQEBJZ677RRDQX/bundle.json","state":"https://pith.science/pith/QSK6WQFPFAWKVQEBJZ677RRDQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSK6WQFPFAWKVQEBJZ677RRDQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QSK6WQFPFAWKVQEBJZ677RRDQX","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":"00cf87923f64bb0a28db0a7fab96ef31e7d6b4fe437a7b1498ead30f7dfcdc2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-23T10:01:29Z","title_canon_sha256":"839d3b10732ae26b9bd1e6ccd331a72521286f7a0752b104a3f133c108b430b2"},"schema_version":"1.0","source":{"id":"1309.5749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5749","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5749v1","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5749","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"QSK6WQFPFAWK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QSK6WQFPFAWKVQEB","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QSK6WQFP","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:4eed0b795b0d618fbd4ae80e9fd8a231e35b428ea9a79f6b375bcd42d24cf6d1","target":"graph","created_at":"2026-05-18T03:12:34Z","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":"Recovery of arbitrarily positioned samples that are missing in sparse signals recently attracted significant research interest. Sparse signals with heavily corrupted arbitrary positioned samples could be analyzed in the same way as compressive sensed signals by omitting the corrupted samples and considering them as unavailable during the recovery process. The reconstruction of missing samples is done by using one of the well known reconstruction algorithms. In this paper we will propose a very simple and efficient adaptive variable step algorithm, applied directly to the concentration measures","authors_text":"Ljubisa Stankovic, Milos Dakovic, Stefan Vujovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-23T10:01:29Z","title":"Adaptive Variable Step Algorithm for Missing Samples Recovery in Sparse Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5749","kind":"arxiv","version":1},"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:a633e1cbc1e52f4c9c06fca2a4f0d01aff5c70cfedac0322f43abeaa4302827f","target":"record","created_at":"2026-05-18T03:12:34Z","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":"00cf87923f64bb0a28db0a7fab96ef31e7d6b4fe437a7b1498ead30f7dfcdc2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-23T10:01:29Z","title_canon_sha256":"839d3b10732ae26b9bd1e6ccd331a72521286f7a0752b104a3f133c108b430b2"},"schema_version":"1.0","source":{"id":"1309.5749","kind":"arxiv","version":1}},"canonical_sha256":"8495eb40af282caac0814e7dffc62385ed67f8bb5daac4907ad8933e4bf940d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8495eb40af282caac0814e7dffc62385ed67f8bb5daac4907ad8933e4bf940d9","first_computed_at":"2026-05-18T03:12:34.294183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:34.294183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4HUC+yoEl0RMx3llGBHzHAnTKga5aTVE2sidHOBSFdl9OVi3EdRpR5q3pcDf8uqlScdAn/gOkq53YAKetm3DBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:34.294897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a633e1cbc1e52f4c9c06fca2a4f0d01aff5c70cfedac0322f43abeaa4302827f","sha256:4eed0b795b0d618fbd4ae80e9fd8a231e35b428ea9a79f6b375bcd42d24cf6d1"],"state_sha256":"f499f2fc67ea8341c8660fe0c06ae465d26c9954f075f1e5101aa70569cb1a80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eQAZAxODFkyZosYX/zq1N6f6aTL+CjeURD76Ugzoop0UamBFW/Uf3qjuYJ0+2y6QlRlHfFWn9RExbt/hYDfVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:29:15.841444Z","bundle_sha256":"d550b2e7c993880c2d75f85a728db07b564339e3516e9af62822b20ca36a4930"}}