{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7QAVCGSCXGC7HMWCYMGMJJDY5M","short_pith_number":"pith:7QAVCGSC","canonical_record":{"source":{"id":"1502.01220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-04T14:54:37Z","cross_cats_sorted":[],"title_canon_sha256":"3d789693becee26a356217892c8f0d4fe01d473d33f3ddb858f000e60ae787dd","abstract_canon_sha256":"0899d6184f7fb945b7a8bb0b3039e90488b482a407116ac9ee63a0b2947a54b6"},"schema_version":"1.0"},"canonical_sha256":"fc01511a42b985f3b2c2c30cc4a478eb25a224b52e758affeeef6f6bf5b6dae8","source":{"kind":"arxiv","id":"1502.01220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01220","created_at":"2026-05-18T01:33:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01220v1","created_at":"2026-05-18T01:33:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01220","created_at":"2026-05-18T01:33:06Z"},{"alias_kind":"pith_short_12","alias_value":"7QAVCGSCXGC7","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7QAVCGSCXGC7HMWC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7QAVCGSC","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7QAVCGSCXGC7HMWCYMGMJJDY5M","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-04T14:54:37Z","cross_cats_sorted":[],"title_canon_sha256":"3d789693becee26a356217892c8f0d4fe01d473d33f3ddb858f000e60ae787dd","abstract_canon_sha256":"0899d6184f7fb945b7a8bb0b3039e90488b482a407116ac9ee63a0b2947a54b6"},"schema_version":"1.0"},"canonical_sha256":"fc01511a42b985f3b2c2c30cc4a478eb25a224b52e758affeeef6f6bf5b6dae8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:06.368281Z","signature_b64":"tDMOA2Ra5fvlp5VAYjiAjz1pNdTBHRITl2NjPG30yi0rnJCvCvYbJ9Z62PJv2YemsAxOYsP2E4kc8B+XFxlYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc01511a42b985f3b2c2c30cc4a478eb25a224b52e758affeeef6f6bf5b6dae8","last_reissued_at":"2026-05-18T01:33:06.367732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:06.367732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01220","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-18T01:33:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73cZj+cmb/q4SI/e9XPJHjWDrjuXJSyXKEzYqZYgkbuwy4fcMCmP+7IQZzdwhkfy9w3eUvJlPGeX0pkTtxtoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:42:09.055151Z"},"content_sha256":"a325e717c550a7227b1e75d1a3e4aba4b48bc194d2cb589f9062b43eb55f315a","schema_version":"1.0","event_id":"sha256:a325e717c550a7227b1e75d1a3e4aba4b48bc194d2cb589f9062b43eb55f315a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7QAVCGSCXGC7HMWCYMGMJJDY5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unveiling The Tree: A Convex Framework for Sparse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan V. Oppenheim, Tarek A. Lahlou","submitted_at":"2015-02-04T14:54:37Z","abstract_excerpt":"This paper presents a general framework for generating greedy algorithms for solving convex constraint satisfaction problems for sparse solutions by mapping the satisfaction problem into one of graph traversal on a rooted tree of unknown topology. For every pre-walk of the tree an initial set of generally dense feasible solutions is processed in such a way that the sparsity of each solution increases with each generation unveiled. The specific computation performed at any particular child node is shown to correspond to an embedding of a polytope into the polytope received from that nodes paren"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01220","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-18T01:33:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7cP/xXOdquX0NhtJAh9gdEZmMhANlreiF1RJmbx0pKUll9yUokb4SMEUNDdzG8v8OrvwNpAhcbt7+71Wbr8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:42:09.055585Z"},"content_sha256":"b414e2a8bad1380c3bb135ad3256081b3fe521b5fb38c57fd4496eb02d2bff05","schema_version":"1.0","event_id":"sha256:b414e2a8bad1380c3bb135ad3256081b3fe521b5fb38c57fd4496eb02d2bff05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/bundle.json","state_url":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/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-31T09:42:09Z","links":{"resolver":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M","bundle":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/bundle.json","state":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7QAVCGSCXGC7HMWCYMGMJJDY5M","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":"0899d6184f7fb945b7a8bb0b3039e90488b482a407116ac9ee63a0b2947a54b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-04T14:54:37Z","title_canon_sha256":"3d789693becee26a356217892c8f0d4fe01d473d33f3ddb858f000e60ae787dd"},"schema_version":"1.0","source":{"id":"1502.01220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01220","created_at":"2026-05-18T01:33:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01220v1","created_at":"2026-05-18T01:33:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01220","created_at":"2026-05-18T01:33:06Z"},{"alias_kind":"pith_short_12","alias_value":"7QAVCGSCXGC7","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7QAVCGSCXGC7HMWC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7QAVCGSC","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:b414e2a8bad1380c3bb135ad3256081b3fe521b5fb38c57fd4496eb02d2bff05","target":"graph","created_at":"2026-05-18T01:33:06Z","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":"This paper presents a general framework for generating greedy algorithms for solving convex constraint satisfaction problems for sparse solutions by mapping the satisfaction problem into one of graph traversal on a rooted tree of unknown topology. For every pre-walk of the tree an initial set of generally dense feasible solutions is processed in such a way that the sparsity of each solution increases with each generation unveiled. The specific computation performed at any particular child node is shown to correspond to an embedding of a polytope into the polytope received from that nodes paren","authors_text":"Alan V. Oppenheim, Tarek A. Lahlou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-04T14:54:37Z","title":"Unveiling The Tree: A Convex Framework for Sparse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01220","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:a325e717c550a7227b1e75d1a3e4aba4b48bc194d2cb589f9062b43eb55f315a","target":"record","created_at":"2026-05-18T01:33:06Z","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":"0899d6184f7fb945b7a8bb0b3039e90488b482a407116ac9ee63a0b2947a54b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-04T14:54:37Z","title_canon_sha256":"3d789693becee26a356217892c8f0d4fe01d473d33f3ddb858f000e60ae787dd"},"schema_version":"1.0","source":{"id":"1502.01220","kind":"arxiv","version":1}},"canonical_sha256":"fc01511a42b985f3b2c2c30cc4a478eb25a224b52e758affeeef6f6bf5b6dae8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc01511a42b985f3b2c2c30cc4a478eb25a224b52e758affeeef6f6bf5b6dae8","first_computed_at":"2026-05-18T01:33:06.367732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:06.367732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tDMOA2Ra5fvlp5VAYjiAjz1pNdTBHRITl2NjPG30yi0rnJCvCvYbJ9Z62PJv2YemsAxOYsP2E4kc8B+XFxlYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:06.368281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a325e717c550a7227b1e75d1a3e4aba4b48bc194d2cb589f9062b43eb55f315a","sha256:b414e2a8bad1380c3bb135ad3256081b3fe521b5fb38c57fd4496eb02d2bff05"],"state_sha256":"dbb8db2d0c997c140f197add1bbc57ad108e6a5a3b3a670f86a782caf2446f65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYPtB4sC1t77q6kYdZV2QC4I30bbpCTsOGdqxqfAhhm/ygEIn6qy4KPfhdqu3Yu7hFxHtuALXCDbGwtGlL6DCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:42:09.058181Z","bundle_sha256":"77483492d06d9d590ac3670099ab962c43df9a01c2f872016ad93fa768b81d7a"}}