{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NWFE3FGFMQ7Z4TA3FCGZQISM4L","short_pith_number":"pith:NWFE3FGF","canonical_record":{"source":{"id":"1109.6202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T13:45:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5a9b3af7698ccdc06bbffa2aba64a87c6d257ddaa4da8ee3762f1395bf3db52","abstract_canon_sha256":"827d15310b16ecff3a2be1d8ac01fe0182808567e1b8273681e40f9d2a2e62c6"},"schema_version":"1.0"},"canonical_sha256":"6d8a4d94c5643f9e4c1b288d98224ce2e200665d1fc03bbbc9ce5c48d6d87dac","source":{"kind":"arxiv","id":"1109.6202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6202","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6202v1","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6202","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"NWFE3FGFMQ7Z","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NWFE3FGFMQ7Z4TA3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NWFE3FGF","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NWFE3FGFMQ7Z4TA3FCGZQISM4L","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T13:45:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5a9b3af7698ccdc06bbffa2aba64a87c6d257ddaa4da8ee3762f1395bf3db52","abstract_canon_sha256":"827d15310b16ecff3a2be1d8ac01fe0182808567e1b8273681e40f9d2a2e62c6"},"schema_version":"1.0"},"canonical_sha256":"6d8a4d94c5643f9e4c1b288d98224ce2e200665d1fc03bbbc9ce5c48d6d87dac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:09.574916Z","signature_b64":"bmHeHArADXS9X7iDLMXPtYC+0w13cuTGvzzRmDGxz5k0kauOsqKzNlQGEJ4ZN02zafvAYDrk+IUFlm+AyjmkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d8a4d94c5643f9e4c1b288d98224ce2e200665d1fc03bbbc9ce5c48d6d87dac","last_reissued_at":"2026-05-18T04:12:09.574391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:09.574391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6202","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-18T04:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LNVzVq0ADGpdgmwFwFo0y61cwxu9U9QAXn14jedjjU5ZkYSFQqE1vWLvgqE1/h6RTcCiSMR3YBS+rgoFYepAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:30:54.288368Z"},"content_sha256":"c33345cd3dc126296d256225a03b9998635d2e12819bf879ee021a46c92d0515","schema_version":"1.0","event_id":"sha256:c33345cd3dc126296d256225a03b9998635d2e12819bf879ee021a46c92d0515"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NWFE3FGFMQ7Z4TA3FCGZQISM4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Variable Density Compressive Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gilles Puy, Pierre Vandergheynst, Yves Wiaux","submitted_at":"2011-09-28T13:45:01Z","abstract_excerpt":"We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution provides an optimized sampling profile. This minimization problem is solved with the use of convex optimization algorithms. We also propose a refinement of our technique when prior information is available on the signal support in the sparsity basis. The effectiveness of the method is confirmed by numerical experiments. Our results also provide a theoretical und"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6202","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-18T04:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHbBRfjBcFGxwK/lFx/r8jNZKtsBl8VcxnlWzGwBLxrbgG9qzj5JqrPelNOYQULM25FqRuEJTyIBLPcV4t09CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:30:54.288720Z"},"content_sha256":"d806ad0ee4b939deebb533d65302f61651786771d9d3e5b51e8c2be1a8a7576a","schema_version":"1.0","event_id":"sha256:d806ad0ee4b939deebb533d65302f61651786771d9d3e5b51e8c2be1a8a7576a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWFE3FGFMQ7Z4TA3FCGZQISM4L/bundle.json","state_url":"https://pith.science/pith/NWFE3FGFMQ7Z4TA3FCGZQISM4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWFE3FGFMQ7Z4TA3FCGZQISM4L/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-01T10:30:54Z","links":{"resolver":"https://pith.science/pith/NWFE3FGFMQ7Z4TA3FCGZQISM4L","bundle":"https://pith.science/pith/NWFE3FGFMQ7Z4TA3FCGZQISM4L/bundle.json","state":"https://pith.science/pith/NWFE3FGFMQ7Z4TA3FCGZQISM4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWFE3FGFMQ7Z4TA3FCGZQISM4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NWFE3FGFMQ7Z4TA3FCGZQISM4L","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":"827d15310b16ecff3a2be1d8ac01fe0182808567e1b8273681e40f9d2a2e62c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T13:45:01Z","title_canon_sha256":"e5a9b3af7698ccdc06bbffa2aba64a87c6d257ddaa4da8ee3762f1395bf3db52"},"schema_version":"1.0","source":{"id":"1109.6202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6202","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6202v1","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6202","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"NWFE3FGFMQ7Z","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NWFE3FGFMQ7Z4TA3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NWFE3FGF","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:d806ad0ee4b939deebb533d65302f61651786771d9d3e5b51e8c2be1a8a7576a","target":"graph","created_at":"2026-05-18T04:12:09Z","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":"We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution provides an optimized sampling profile. This minimization problem is solved with the use of convex optimization algorithms. We also propose a refinement of our technique when prior information is available on the signal support in the sparsity basis. The effectiveness of the method is confirmed by numerical experiments. Our results also provide a theoretical und","authors_text":"Gilles Puy, Pierre Vandergheynst, Yves Wiaux","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T13:45:01Z","title":"On Variable Density Compressive Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6202","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:c33345cd3dc126296d256225a03b9998635d2e12819bf879ee021a46c92d0515","target":"record","created_at":"2026-05-18T04:12:09Z","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":"827d15310b16ecff3a2be1d8ac01fe0182808567e1b8273681e40f9d2a2e62c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T13:45:01Z","title_canon_sha256":"e5a9b3af7698ccdc06bbffa2aba64a87c6d257ddaa4da8ee3762f1395bf3db52"},"schema_version":"1.0","source":{"id":"1109.6202","kind":"arxiv","version":1}},"canonical_sha256":"6d8a4d94c5643f9e4c1b288d98224ce2e200665d1fc03bbbc9ce5c48d6d87dac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d8a4d94c5643f9e4c1b288d98224ce2e200665d1fc03bbbc9ce5c48d6d87dac","first_computed_at":"2026-05-18T04:12:09.574391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:09.574391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bmHeHArADXS9X7iDLMXPtYC+0w13cuTGvzzRmDGxz5k0kauOsqKzNlQGEJ4ZN02zafvAYDrk+IUFlm+AyjmkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:09.574916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c33345cd3dc126296d256225a03b9998635d2e12819bf879ee021a46c92d0515","sha256:d806ad0ee4b939deebb533d65302f61651786771d9d3e5b51e8c2be1a8a7576a"],"state_sha256":"2947f8edf86e5494cb3e6eb9c92492288a441dc31327c0972825456714b09f96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71Zl8b6rfM+aDztqOmd58FGsaSpn/wjnaEnCI1YmmWI35RREeUWPF1QYiwSprQjNnplVBNTi8A0EINhXUjNkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:30:54.290624Z","bundle_sha256":"7a9effdafb45e9cf32707b85407cdb65041c436ae0f79e4b34927e2e3f639d89"}}