{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ETUVACQDDC7MIBZMCOFR4S7VEU","short_pith_number":"pith:ETUVACQD","canonical_record":{"source":{"id":"1107.2509","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T10:06:35Z","cross_cats_sorted":[],"title_canon_sha256":"d753c982f29ed3b562bf61c7b7ad90df02d41c55323d4b5183120cbc24831115","abstract_canon_sha256":"6ddd40432392a1eb346e0f52e2beccb427fb28b05a433a7f243e7386b7ecfb88"},"schema_version":"1.0"},"canonical_sha256":"24e9500a0318bec4072c138b1e4bf5251fa180c9dedc7ba8ef7972e9115aa6b0","source":{"kind":"arxiv","id":"1107.2509","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2509","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2509v3","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2509","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"ETUVACQDDC7M","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETUVACQDDC7MIBZM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETUVACQD","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ETUVACQDDC7MIBZMCOFR4S7VEU","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2509","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T10:06:35Z","cross_cats_sorted":[],"title_canon_sha256":"d753c982f29ed3b562bf61c7b7ad90df02d41c55323d4b5183120cbc24831115","abstract_canon_sha256":"6ddd40432392a1eb346e0f52e2beccb427fb28b05a433a7f243e7386b7ecfb88"},"schema_version":"1.0"},"canonical_sha256":"24e9500a0318bec4072c138b1e4bf5251fa180c9dedc7ba8ef7972e9115aa6b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:36.861155Z","signature_b64":"FI/ya3VSjjDb93bhM9q2cCoVGAtU+D2ByL2r7BwGioF2gUsVT10aVw4uDkSFwU+jjAG/Recq3nqSD4GSGTKCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24e9500a0318bec4072c138b1e4bf5251fa180c9dedc7ba8ef7972e9115aa6b0","last_reissued_at":"2026-05-18T03:58:36.859634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:36.859634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2509","source_version":3,"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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jwmk70Q6FvoScT0DEGknwBjtEI9cCCBl1Bdqx7szd6u6KsqxPBhkWvlGWlcel/55su+i2T/Zg1XwnlK3kFpjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:36:40.966936Z"},"content_sha256":"e1591b5bb6036feeee00a77cb77770308f6ac70aaeebe91882f6ebc66ee1ff05","schema_version":"1.0","event_id":"sha256:e1591b5bb6036feeee00a77cb77770308f6ac70aaeebe91882f6ebc66ee1ff05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ETUVACQDDC7MIBZMCOFR4S7VEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matching Pursuits with Random Sequential Subdictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ga\\\"el Richard, Laurent Daudet, Manuel Moussallam","submitted_at":"2011-07-13T10:06:35Z","abstract_excerpt":"Matching pursuits are a class of greedy algorithms commonly used in signal processing, for solving the sparse approximation problem. They rely on an atom selection step that requires the calculation of numerous projections, which can be computationally costly for large dictionaries and burdens their competitiveness in coding applications. We propose using a non adaptive random sequence of subdictionaries in the decomposition process, thus parsing a large dictionary in a probabilistic fashion with no additional projection cost nor parameter estimation. A theoretical modeling based on order stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2509","kind":"arxiv","version":3},"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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIf4XKkRj7NPTJfI1Hzgb3LQ9wMtikfLCTjeaJ7Yvroq7N/deArNGJiDl0p0FqM7IZa37GarK52uEMzbmER6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:36:40.967554Z"},"content_sha256":"b4272ab88faeff9dd03b7c5c7ea4477453af9035a038f581f702affdc2d42288","schema_version":"1.0","event_id":"sha256:b4272ab88faeff9dd03b7c5c7ea4477453af9035a038f581f702affdc2d42288"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETUVACQDDC7MIBZMCOFR4S7VEU/bundle.json","state_url":"https://pith.science/pith/ETUVACQDDC7MIBZMCOFR4S7VEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETUVACQDDC7MIBZMCOFR4S7VEU/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-27T09:36:40Z","links":{"resolver":"https://pith.science/pith/ETUVACQDDC7MIBZMCOFR4S7VEU","bundle":"https://pith.science/pith/ETUVACQDDC7MIBZMCOFR4S7VEU/bundle.json","state":"https://pith.science/pith/ETUVACQDDC7MIBZMCOFR4S7VEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETUVACQDDC7MIBZMCOFR4S7VEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ETUVACQDDC7MIBZMCOFR4S7VEU","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":"6ddd40432392a1eb346e0f52e2beccb427fb28b05a433a7f243e7386b7ecfb88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T10:06:35Z","title_canon_sha256":"d753c982f29ed3b562bf61c7b7ad90df02d41c55323d4b5183120cbc24831115"},"schema_version":"1.0","source":{"id":"1107.2509","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2509","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2509v3","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2509","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"ETUVACQDDC7M","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETUVACQDDC7MIBZM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETUVACQD","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:b4272ab88faeff9dd03b7c5c7ea4477453af9035a038f581f702affdc2d42288","target":"graph","created_at":"2026-05-18T03:58:36Z","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":"Matching pursuits are a class of greedy algorithms commonly used in signal processing, for solving the sparse approximation problem. They rely on an atom selection step that requires the calculation of numerous projections, which can be computationally costly for large dictionaries and burdens their competitiveness in coding applications. We propose using a non adaptive random sequence of subdictionaries in the decomposition process, thus parsing a large dictionary in a probabilistic fashion with no additional projection cost nor parameter estimation. A theoretical modeling based on order stat","authors_text":"Ga\\\"el Richard, Laurent Daudet, Manuel Moussallam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T10:06:35Z","title":"Matching Pursuits with Random Sequential Subdictionaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2509","kind":"arxiv","version":3},"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:e1591b5bb6036feeee00a77cb77770308f6ac70aaeebe91882f6ebc66ee1ff05","target":"record","created_at":"2026-05-18T03:58:36Z","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":"6ddd40432392a1eb346e0f52e2beccb427fb28b05a433a7f243e7386b7ecfb88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T10:06:35Z","title_canon_sha256":"d753c982f29ed3b562bf61c7b7ad90df02d41c55323d4b5183120cbc24831115"},"schema_version":"1.0","source":{"id":"1107.2509","kind":"arxiv","version":3}},"canonical_sha256":"24e9500a0318bec4072c138b1e4bf5251fa180c9dedc7ba8ef7972e9115aa6b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24e9500a0318bec4072c138b1e4bf5251fa180c9dedc7ba8ef7972e9115aa6b0","first_computed_at":"2026-05-18T03:58:36.859634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:36.859634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FI/ya3VSjjDb93bhM9q2cCoVGAtU+D2ByL2r7BwGioF2gUsVT10aVw4uDkSFwU+jjAG/Recq3nqSD4GSGTKCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:36.861155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2509","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1591b5bb6036feeee00a77cb77770308f6ac70aaeebe91882f6ebc66ee1ff05","sha256:b4272ab88faeff9dd03b7c5c7ea4477453af9035a038f581f702affdc2d42288"],"state_sha256":"9cdb9b557bce30fb68357c6ed99de93cf91593bce68640db5f2b7a859fa1068d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTfut+jZOttdyDE8erkThvLaZbotUnfFHrs9cf/JanyxXmkPW3UhN1kKmdey4QwYDUpL+ujTr4v6Zi9Y1douAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:36:40.970722Z","bundle_sha256":"f055977e4608f3e5a6145d25dcec8838b3cec2aa782b19d50ab9488ba67801a6"}}