{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6ZAUMBLTNKH63SI3JO37FG7G6L","short_pith_number":"pith:6ZAUMBLT","canonical_record":{"source":{"id":"1303.2251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T18:53:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ca0fe3e278e8c3ada8dd8e5346ef711efd4511e41115e4a8e57f1cbcfdbf4d3d","abstract_canon_sha256":"ce434731d2d2ae2b451e9fa722c8509c5b22ef49fe8ee4be6873ab7e6b8281e3"},"schema_version":"1.0"},"canonical_sha256":"f6414605736a8fedc91b4bb7f29be6f2f4c9272ff72e87db26135c3bde25354a","source":{"kind":"arxiv","id":"1303.2251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2251","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2251v1","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2251","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"6ZAUMBLTNKH6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6ZAUMBLTNKH63SI3","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6ZAUMBLT","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6ZAUMBLTNKH63SI3JO37FG7G6L","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T18:53:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ca0fe3e278e8c3ada8dd8e5346ef711efd4511e41115e4a8e57f1cbcfdbf4d3d","abstract_canon_sha256":"ce434731d2d2ae2b451e9fa722c8509c5b22ef49fe8ee4be6873ab7e6b8281e3"},"schema_version":"1.0"},"canonical_sha256":"f6414605736a8fedc91b4bb7f29be6f2f4c9272ff72e87db26135c3bde25354a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:19.544925Z","signature_b64":"6VRDthVbQZLdrl9mydPK2DmeWpEXMA716LWeTY1zwVYGVZAg/LGFcM5LvVulSefwlVbV4iwWyl7hD2VBOnVSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6414605736a8fedc91b4bb7f29be6f2f4c9272ff72e87db26135c3bde25354a","last_reissued_at":"2026-05-18T03:31:19.544118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:19.544118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2251","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:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O54EUsA2exvguPpMSYJrQ+9XWPpV4JNgwdUUCjF82YITTds14ha0PVN54+Z2bEr92PbscnXHAwOwv6fzWoIwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:55:38.891192Z"},"content_sha256":"bbab1173018abd3b57acca4470b44a90430e94ee4ecf03d54fe399b687525189","schema_version":"1.0","event_id":"sha256:bbab1173018abd3b57acca4470b44a90430e94ee4ecf03d54fe399b687525189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6ZAUMBLTNKH63SI3JO37FG7G6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zero-point attracting projection algorithm for sequential compressive sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jian Jin, Jian Yang, Ningning Liu, Wei Duan, Yang You, Yuantao Gu","submitted_at":"2013-03-09T18:53:38Z","abstract_excerpt":"Sequential Compressive Sensing, which may be widely used in sensing devices, is a popular topic of recent research. This paper proposes an online recovery algorithm for sparse approximation of sequential compressive sensing. Several techniques including warm start, fast iteration, and variable step size are adopted in the proposed algorithm to improve its online performance. Finally, numerical simulations demonstrate its better performance than the relative art."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2251","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:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnLajUqhegYqMS+CVr2t5otpI5LSWCUNa5nvxJE9XkMjylk4eYOhlYrNQGjz9neTcZRWe60Vbieu/OeNM9ngDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:55:38.891552Z"},"content_sha256":"ae6671b53e3022cdfef6319cee127c2a6a4ff12f96bd374df0047b35d47e1f8e","schema_version":"1.0","event_id":"sha256:ae6671b53e3022cdfef6319cee127c2a6a4ff12f96bd374df0047b35d47e1f8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZAUMBLTNKH63SI3JO37FG7G6L/bundle.json","state_url":"https://pith.science/pith/6ZAUMBLTNKH63SI3JO37FG7G6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZAUMBLTNKH63SI3JO37FG7G6L/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-05-28T09:55:38Z","links":{"resolver":"https://pith.science/pith/6ZAUMBLTNKH63SI3JO37FG7G6L","bundle":"https://pith.science/pith/6ZAUMBLTNKH63SI3JO37FG7G6L/bundle.json","state":"https://pith.science/pith/6ZAUMBLTNKH63SI3JO37FG7G6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZAUMBLTNKH63SI3JO37FG7G6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6ZAUMBLTNKH63SI3JO37FG7G6L","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":"ce434731d2d2ae2b451e9fa722c8509c5b22ef49fe8ee4be6873ab7e6b8281e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T18:53:38Z","title_canon_sha256":"ca0fe3e278e8c3ada8dd8e5346ef711efd4511e41115e4a8e57f1cbcfdbf4d3d"},"schema_version":"1.0","source":{"id":"1303.2251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2251","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2251v1","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2251","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"6ZAUMBLTNKH6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6ZAUMBLTNKH63SI3","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6ZAUMBLT","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:ae6671b53e3022cdfef6319cee127c2a6a4ff12f96bd374df0047b35d47e1f8e","target":"graph","created_at":"2026-05-18T03:31:19Z","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":"Sequential Compressive Sensing, which may be widely used in sensing devices, is a popular topic of recent research. This paper proposes an online recovery algorithm for sparse approximation of sequential compressive sensing. Several techniques including warm start, fast iteration, and variable step size are adopted in the proposed algorithm to improve its online performance. Finally, numerical simulations demonstrate its better performance than the relative art.","authors_text":"Jian Jin, Jian Yang, Ningning Liu, Wei Duan, Yang You, Yuantao Gu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T18:53:38Z","title":"Zero-point attracting projection algorithm for sequential compressive sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2251","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:bbab1173018abd3b57acca4470b44a90430e94ee4ecf03d54fe399b687525189","target":"record","created_at":"2026-05-18T03:31:19Z","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":"ce434731d2d2ae2b451e9fa722c8509c5b22ef49fe8ee4be6873ab7e6b8281e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T18:53:38Z","title_canon_sha256":"ca0fe3e278e8c3ada8dd8e5346ef711efd4511e41115e4a8e57f1cbcfdbf4d3d"},"schema_version":"1.0","source":{"id":"1303.2251","kind":"arxiv","version":1}},"canonical_sha256":"f6414605736a8fedc91b4bb7f29be6f2f4c9272ff72e87db26135c3bde25354a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6414605736a8fedc91b4bb7f29be6f2f4c9272ff72e87db26135c3bde25354a","first_computed_at":"2026-05-18T03:31:19.544118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:19.544118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6VRDthVbQZLdrl9mydPK2DmeWpEXMA716LWeTY1zwVYGVZAg/LGFcM5LvVulSefwlVbV4iwWyl7hD2VBOnVSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:19.544925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbab1173018abd3b57acca4470b44a90430e94ee4ecf03d54fe399b687525189","sha256:ae6671b53e3022cdfef6319cee127c2a6a4ff12f96bd374df0047b35d47e1f8e"],"state_sha256":"598c22177720b97ddb151a3d88a14a59add3f968ce7673220ea059071287c651"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kzCqzDbAK4M8XVHzIeis4yxoSzzMEsXFubET1HvkuNgoUnuAEc+nIqNS8mmAH25b0PPPj8fjSQwZmIowMG5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:55:38.893748Z","bundle_sha256":"1817cc16342add1c01a0317c658c76e159be9aeb6b2217f59b38a269e621bfab"}}